/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:10:05,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:10:05,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:10:05,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:10:05,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:10:05,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:10:05,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:10:05,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:10:05,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:10:05,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:10:05,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:10:05,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:10:05,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:10:05,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:10:05,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:10:05,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:10:05,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:10:05,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:10:05,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:10:05,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:10:05,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:10:05,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:10:06,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:10:06,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:10:06,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:10:06,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:10:06,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:10:06,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:10:06,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:10:06,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:10:06,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:10:06,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:10:06,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:10:06,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:10:06,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:10:06,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:10:06,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:10:06,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:10:06,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:10:06,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:10:06,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:10:06,012 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:10:06,026 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:10:06,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:10:06,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:10:06,028 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:10:06,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:10:06,028 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:10:06,028 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:10:06,028 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:10:06,029 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:10:06,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:10:06,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:10:06,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:10:06,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:10:06,030 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:10:06,031 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:10:06,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:10:06,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:10:06,031 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:10:06,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:10:06,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:10:06,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:10:06,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:10:06,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:10:06,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:10:06,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:10:06,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:10:06,214 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:10:06,215 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:10:06,215 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:10:06,271 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_pwssvX/tmp/c982f39ffa1341a7829b8d2bbd566118/FLAGe6945f457 [2020-07-01 12:10:06,620 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:10:06,620 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:10:06,621 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:10:06,627 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_pwssvX/tmp/c982f39ffa1341a7829b8d2bbd566118/FLAGe6945f457 [2020-07-01 12:10:07,010 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_pwssvX/tmp/c982f39ffa1341a7829b8d2bbd566118 [2020-07-01 12:10:07,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:10:07,023 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:10:07,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:10:07,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:10:07,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:10:07,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32950d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07, skipping insertion in model container [2020-07-01 12:10:07,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:10:07,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:10:07,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:10:07,287 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:10:07,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:10:07,319 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:10:07,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07 WrapperNode [2020-07-01 12:10:07,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:10:07,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:10:07,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:10:07,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:10:07,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:10:07,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:10:07,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:10:07,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:10:07,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:10:07,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:10:07,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:10:07,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:10:07,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:10:07,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:10:07,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:10:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:10:07,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:10:07,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:10:07,452 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2020-07-01 12:10:07,453 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2020-07-01 12:10:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:10:07,636 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:10:07,636 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-01 12:10:07,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:10:07 BoogieIcfgContainer [2020-07-01 12:10:07,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:10:07,641 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:10:07,641 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:10:07,643 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:10:07,644 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:10:07" (1/1) ... [2020-07-01 12:10:07,660 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 23 edges [2020-07-01 12:10:07,662 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:10:07,662 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:10:07,663 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:10:07,663 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:10:07,665 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:10:07,666 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:10:07,666 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:10:07,684 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:10:07,704 INFO L200 BlockEncoder]: SBE split 6 edges [2020-07-01 12:10:07,709 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:10:07,711 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:10:07,732 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 12:10:07,735 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-07-01 12:10:07,736 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:10:07,737 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:10:07,737 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:10:07,738 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:10:07,738 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 24 edges [2020-07-01 12:10:07,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:10:07 BasicIcfg [2020-07-01 12:10:07,739 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:10:07,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:10:07,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:10:07,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:10:07,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:10:07" (1/4) ... [2020-07-01 12:10:07,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2929671c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:10:07, skipping insertion in model container [2020-07-01 12:10:07,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (2/4) ... [2020-07-01 12:10:07,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2929671c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:10:07, skipping insertion in model container [2020-07-01 12:10:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:10:07" (3/4) ... [2020-07-01 12:10:07,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2929671c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:10:07, skipping insertion in model container [2020-07-01 12:10:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:10:07" (4/4) ... [2020-07-01 12:10:07,748 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:10:07,758 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:10:07,765 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-01 12:10:07,779 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-01 12:10:07,802 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:10:07,803 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:10:07,803 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:10:07,803 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:10:07,803 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:10:07,803 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:10:07,804 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:10:07,804 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:10:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-01 12:10:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:10:07,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:07,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:10:07,826 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 3208906, now seen corresponding path program 1 times [2020-07-01 12:10:07,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:07,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070384269] [2020-07-01 12:10:07,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:07,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070384269] [2020-07-01 12:10:07,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:07,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:10:07,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766820153] [2020-07-01 12:10:08,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:10:08,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:10:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:10:08,021 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2020-07-01 12:10:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,087 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2020-07-01 12:10:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:10:08,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:10:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,099 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:10:08,099 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 12:10:08,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:10:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 12:10:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 12:10:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:10:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-01 12:10:08,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 4 [2020-07-01 12:10:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,140 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-01 12:10:08,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:10:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-01 12:10:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:10:08,141 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:10:08,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:10:08,143 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 3208875, now seen corresponding path program 1 times [2020-07-01 12:10:08,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904370230] [2020-07-01 12:10:08,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:08,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904370230] [2020-07-01 12:10:08,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:08,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:10:08,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140970607] [2020-07-01 12:10:08,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:10:08,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:10:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:10:08,184 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 3 states. [2020-07-01 12:10:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,225 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-01 12:10:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:10:08,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:10:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,227 INFO L225 Difference]: With dead ends: 13 [2020-07-01 12:10:08,227 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:10:08,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:10:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:10:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 12:10:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:10:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-01 12:10:08,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 4 [2020-07-01 12:10:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,232 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-01 12:10:08,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:10:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-01 12:10:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:10:08,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:10:08,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:10:08,233 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 3208877, now seen corresponding path program 1 times [2020-07-01 12:10:08,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223065515] [2020-07-01 12:10:08,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:08,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223065515] [2020-07-01 12:10:08,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:08,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:10:08,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465990225] [2020-07-01 12:10:08,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:10:08,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:10:08,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:10:08,267 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2020-07-01 12:10:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,306 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-01 12:10:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:10:08,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:10:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,308 INFO L225 Difference]: With dead ends: 13 [2020-07-01 12:10:08,308 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:10:08,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:10:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:10:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 12:10:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:10:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-01 12:10:08,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 4 [2020-07-01 12:10:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,312 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-01 12:10:08,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:10:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-01 12:10:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:10:08,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:10:08,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:10:08,313 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 3208878, now seen corresponding path program 1 times [2020-07-01 12:10:08,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128490348] [2020-07-01 12:10:08,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:08,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128490348] [2020-07-01 12:10:08,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:08,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:10:08,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682963240] [2020-07-01 12:10:08,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:10:08,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:10:08,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:10:08,349 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2020-07-01 12:10:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,399 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 12:10:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:10:08,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 12:10:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,401 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:10:08,401 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:10:08,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:10:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:10:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:10:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:10:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-07-01 12:10:08,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 4 [2020-07-01 12:10:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,405 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-01 12:10:08,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:10:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-07-01 12:10:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:10:08,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:08,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:10:08,406 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1105454649, now seen corresponding path program 1 times [2020-07-01 12:10:08,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832523505] [2020-07-01 12:10:08,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:08,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832523505] [2020-07-01 12:10:08,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:08,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:10:08,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114089658] [2020-07-01 12:10:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:10:08,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:10:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:10:08,460 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 5 states. [2020-07-01 12:10:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,514 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-01 12:10:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:10:08,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:10:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,515 INFO L225 Difference]: With dead ends: 11 [2020-07-01 12:10:08,515 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 12:10:08,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:10:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 12:10:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 12:10:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 12:10:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-01 12:10:08,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2020-07-01 12:10:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,519 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-01 12:10:08,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:10:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-01 12:10:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:10:08,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:08,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:10:08,520 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1105454651, now seen corresponding path program 1 times [2020-07-01 12:10:08,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889989702] [2020-07-01 12:10:08,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:08,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889989702] [2020-07-01 12:10:08,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:08,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:10:08,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698230112] [2020-07-01 12:10:08,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:10:08,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:10:08,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:10:08,600 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 7 states. [2020-07-01 12:10:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,691 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-01 12:10:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:10:08,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2020-07-01 12:10:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,692 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:10:08,693 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:10:08,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:10:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:10:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-01 12:10:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:10:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-01 12:10:08,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2020-07-01 12:10:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,698 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-01 12:10:08,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:10:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-01 12:10:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:10:08,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,699 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:08,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:10:08,699 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1128895084, now seen corresponding path program 1 times [2020-07-01 12:10:08,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955753014] [2020-07-01 12:10:08,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:08,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955753014] [2020-07-01 12:10:08,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:10:08,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:10:08,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079266801] [2020-07-01 12:10:08,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:10:08,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:10:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:10:08,824 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 8 states. [2020-07-01 12:10:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:08,959 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-01 12:10:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:10:08,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-01 12:10:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:08,960 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:10:08,960 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:10:08,961 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:10:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:10:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 12:10:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:10:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-07-01 12:10:08,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 11 [2020-07-01 12:10:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:08,965 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-01 12:10:08,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:10:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-01 12:10:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:10:08,966 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:08,966 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:08,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:10:08,966 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash 146327559, now seen corresponding path program 1 times [2020-07-01 12:10:08,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:08,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821536770] [2020-07-01 12:10:08,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:09,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821536770] [2020-07-01 12:10:09,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329928751] [2020-07-01 12:10:09,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:10:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:09,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-01 12:10:09,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:10:09,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:10:09,340 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:10:09,351 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:09,352 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:09,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 12:10:09,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:10:09,379 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:10:09,385 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:09,385 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:09,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 12:10:09,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:09,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 12:10:09,513 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:10:09,516 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:10:09,530 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:09,531 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:10:09,534 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:09,535 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:34 [2020-07-01 12:10:09,593 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:10:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:09,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:10:09,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-01 12:10:09,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445820368] [2020-07-01 12:10:09,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:10:09,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:10:09,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:10:09,677 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 19 states. [2020-07-01 12:10:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:10,178 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-01 12:10:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:10:10,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2020-07-01 12:10:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:10,179 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:10:10,179 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:10:10,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:10:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:10:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2020-07-01 12:10:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:10:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-01 12:10:10,185 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2020-07-01 12:10:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:10,185 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-01 12:10:10,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:10:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-01 12:10:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:10:10,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:10,186 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:10,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 12:10:10,387 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:10,388 INFO L82 PathProgramCache]: Analyzing trace with hash 146327560, now seen corresponding path program 1 times [2020-07-01 12:10:10,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:10,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729850349] [2020-07-01 12:10:10,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:10,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729850349] [2020-07-01 12:10:10,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534432343] [2020-07-01 12:10:10,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:10:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:10,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:10:10,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:10:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:10,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:10:10,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2020-07-01 12:10:10,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630162449] [2020-07-01 12:10:10,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:10:10,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:10:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:10:10,474 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 5 states. [2020-07-01 12:10:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:10,506 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-01 12:10:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:10:10,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:10:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:10,507 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:10:10,507 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:10:10,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:10:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:10:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:10:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:10:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-01 12:10:10,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2020-07-01 12:10:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:10,512 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-01 12:10:10,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:10:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-01 12:10:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:10:10,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:10,513 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:10,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:10:10,714 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:10,714 INFO L82 PathProgramCache]: Analyzing trace with hash -301945288, now seen corresponding path program 2 times [2020-07-01 12:10:10,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:10,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807329678] [2020-07-01 12:10:10,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:10,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807329678] [2020-07-01 12:10:10,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672324283] [2020-07-01 12:10:10,977 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:10:11,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:10:11,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:10:11,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 12:10:11,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:10:11,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:10:11,017 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:10:11,021 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:11,022 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:11,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 12:10:11,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:10:11,042 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:10:11,044 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:11,044 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:11,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:10:11,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:11,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:10:11,105 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:10:11,106 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:10:11,113 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:11,114 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:11,114 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 12:10:11,140 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:10:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:10:11,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:10:11,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-07-01 12:10:11,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348579045] [2020-07-01 12:10:11,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:10:11,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:10:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:10:11,185 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 18 states. [2020-07-01 12:10:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:12,006 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-01 12:10:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-01 12:10:12,007 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2020-07-01 12:10:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:12,007 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:10:12,008 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:10:12,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=1276, Unknown=0, NotChecked=0, Total=1560 [2020-07-01 12:10:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:10:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2020-07-01 12:10:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:10:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-07-01 12:10:12,015 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-07-01 12:10:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:12,015 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-01 12:10:12,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:10:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-01 12:10:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:10:12,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:10:12,016 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:10:12,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 12:10:12,217 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-07-01 12:10:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2087155640, now seen corresponding path program 1 times [2020-07-01 12:10:12,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:12,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368747136] [2020-07-01 12:10:12,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-01 12:10:12,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368747136] [2020-07-01 12:10:12,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42124621] [2020-07-01 12:10:12,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:10:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:12,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 12:10:12,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:10:12,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:10:12,400 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:10:12,406 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:12,406 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:12,406 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 12:10:12,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:10:12,411 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:10:12,414 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:12,414 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:12,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:10:12,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:12,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:10:12,446 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:10:12,446 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:10:12,455 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:10:12,455 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:10:12,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 12:10:12,479 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:10:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 12:10:12,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:10:12,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-01 12:10:12,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436475925] [2020-07-01 12:10:12,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 12:10:12,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:10:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 12:10:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:10:12,497 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 13 states. [2020-07-01 12:10:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:10:12,723 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-01 12:10:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:10:12,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2020-07-01 12:10:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:10:12,724 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:10:12,724 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:10:12,725 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:10:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:10:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:10:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:10:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:10:12,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-01 12:10:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:10:12,726 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:10:12,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 12:10:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:10:12,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:10:12,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:10:12,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:10:13,323 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2020-07-01 12:10:13,327 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (and (= .cse0 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse0 (- 1)))) (<= 1 .cse0))) [2020-07-01 12:10:13,327 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-01 12:10:13,327 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:10:13,327 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 16) no Hoare annotation was computed. [2020-07-01 12:10:13,327 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:10:13,327 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:10:13,328 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:10:13,328 INFO L268 CegarLoopResult]: For program point strlen_recFINAL(lines 5 10) no Hoare annotation was computed. [2020-07-01 12:10:13,328 INFO L268 CegarLoopResult]: For program point strlen_recErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 12:10:13,328 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (let ((.cse7 (select |#length| |strlen_rec_#in~p.base|)) (.cse8 (select |#length| strlen_rec_~p.base))) (let ((.cse1 (<= (+ strlen_rec_~p.offset 2) .cse8)) (.cse2 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse0 (not (= 0 |strlen_rec_#in~p.offset|))) (.cse3 (not (<= 1 .cse7))) (.cse4 (not (= 1 (select |#valid| |strlen_rec_#in~p.base|)))) (.cse5 (not (<= 1 |#StackHeapBarrier|))) (.cse6 (select |#memory_int| |strlen_rec_#in~p.base|))) (and (or .cse0 (and .cse1 (<= 0 strlen_rec_~p.offset) .cse2 (exists ((v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1 Int)) (and (<= strlen_rec_~p.offset v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1) (= (select (select |#memory_int| strlen_rec_~p.base) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1 (select |#length| strlen_rec_~p.base) (- 1))) 0) (<= v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1 0)))) .cse3 .cse4 (forall ((v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1 Int)) (or (not (<= |strlen_rec_#in~p.offset| v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1)) (not (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1 (select |#length| |strlen_rec_#in~p.base|) (- 1))))) (not (<= v_ULTIMATE.start_main_~nondetString1~0.offset_BEFORE_CALL_1 0)))) .cse5) (or (not (= 0 (select .cse6 (+ .cse7 (- 1))))) (and .cse1 (<= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ .cse8 (- 1)))) .cse2) .cse4 (not (<= 1 |strlen_rec_#in~p.offset|)) (not (<= (+ |strlen_rec_#in~p.offset| 1) .cse7)) .cse5) (or .cse0 .cse3 .cse4 .cse5 (not (= 0 (select .cse6 |strlen_rec_#in~p.offset|))))))) [2020-07-01 12:10:13,328 INFO L271 CegarLoopResult]: At program point strlen_recENTRY(lines 5 10) the Hoare annotation is: true [2020-07-01 12:10:13,328 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 12:10:13,328 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-01 12:10:13,329 INFO L268 CegarLoopResult]: For program point L6-1(lines 6 9) no Hoare annotation was computed. [2020-07-01 12:10:13,329 INFO L268 CegarLoopResult]: For program point strlen_recEXIT(lines 5 10) no Hoare annotation was computed. [2020-07-01 12:10:13,329 INFO L268 CegarLoopResult]: For program point strlen_recErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 12:10:13,331 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:10:13,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:10:13 BasicIcfg [2020-07-01 12:10:13,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:10:13,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:10:13,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:10:13,338 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:10:13,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:10:13,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:10:07" (1/5) ... [2020-07-01 12:10:13,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@641bcda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:10:13, skipping insertion in model container [2020-07-01 12:10:13,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:10:13,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:10:07" (2/5) ... [2020-07-01 12:10:13,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@641bcda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:10:13, skipping insertion in model container [2020-07-01 12:10:13,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:10:13,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:10:07" (3/5) ... [2020-07-01 12:10:13,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@641bcda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:10:13, skipping insertion in model container [2020-07-01 12:10:13,341 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:10:13,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:10:07" (4/5) ... [2020-07-01 12:10:13,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@641bcda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:10:13, skipping insertion in model container [2020-07-01 12:10:13,341 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:10:13,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:10:13" (5/5) ... [2020-07-01 12:10:13,343 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:10:13,365 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:10:13,365 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:10:13,365 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:10:13,365 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:10:13,365 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:10:13,365 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:10:13,366 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:10:13,366 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:10:13,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-01 12:10:13,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:10:13,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:10:13,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:10:13,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:10:13,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:10:13,380 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:10:13,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-01 12:10:13,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:10:13,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:10:13,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:10:13,382 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:10:13,382 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:10:13,388 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue [75] ULTIMATE.startENTRY-->L14: Formula: (and (= 0 |v_#NULL.base_2|) (= |v_#valid_11| (store |v_#valid_12| 0 0)) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 16#L14true [56] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 13#L14-2true [63] L14-2-->L18: Formula: (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|)) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 8#L18true [35] L18-->L18-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 6#L18-1true [34] L18-1-->strlen_recENTRY: Formula: (and (= |v_strlen_rec_#in~p.baseInParam_1| v_ULTIMATE.start_main_~nondetString1~0.base_7) (= |v_strlen_rec_#in~p.offsetInParam_1| v_ULTIMATE.start_main_~nondetString1~0.offset_6)) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7} OutVars{strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offsetInParam_1|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.baseInParam_1|} AuxVars[] AssignedVars[strlen_rec_#in~p.offset, strlen_rec_#in~p.base]< 4#strlen_recENTRYtrue [2020-07-01 12:10:13,388 INFO L796 eck$LassoCheckResult]: Loop: 4#strlen_recENTRYtrue [33] strlen_recENTRY-->L6: Formula: (and (= v_strlen_rec_~p.offset_1 |v_strlen_rec_#in~p.offset_1|) (= v_strlen_rec_~p.base_1 |v_strlen_rec_#in~p.base_1|)) InVars {strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offset_1|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.base_1|} OutVars{strlen_rec_~p.base=v_strlen_rec_~p.base_1, strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offset_1|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_1, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.base_1|} AuxVars[] AssignedVars[strlen_rec_~p.offset, strlen_rec_~p.base] 11#L6true [42] L6-->L6-1: Formula: (and (= 1 (select |v_#valid_9| v_strlen_rec_~p.base_2)) (<= (+ v_strlen_rec_~p.offset_2 1) (select |v_#length_5| v_strlen_rec_~p.base_2)) (<= 0 v_strlen_rec_~p.offset_2) (= |v_strlen_rec_#t~mem0_1| (select (select |v_#memory_int_3| v_strlen_rec_~p.base_2) v_strlen_rec_~p.offset_2))) InVars {#memory_int=|v_#memory_int_3|, strlen_rec_~p.base=v_strlen_rec_~p.base_2, #length=|v_#length_5|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_2, #valid=|v_#valid_9|} OutVars{strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_1|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_2, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, strlen_rec_~p.base=v_strlen_rec_~p.base_2, #length=|v_#length_5|} AuxVars[] AssignedVars[strlen_rec_#t~mem0] 12#L6-1true [73] L6-1-->L9: Formula: (< |v_strlen_rec_#t~mem0_5| 0) InVars {strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_5|} OutVars{strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_4|} AuxVars[] AssignedVars[strlen_rec_#t~mem0] 15#L9true [49] L9-->strlen_recENTRY: Formula: (and (= |v_strlen_rec_#in~p.baseInParam_2| v_strlen_rec_~p.base_6) (= |v_strlen_rec_#in~p.offsetInParam_2| (+ v_strlen_rec_~p.offset_5 1))) InVars {strlen_rec_~p.offset=v_strlen_rec_~p.offset_5, strlen_rec_~p.base=v_strlen_rec_~p.base_6} OutVars{strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offsetInParam_2|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.baseInParam_2|} AuxVars[] AssignedVars[strlen_rec_#in~p.offset, strlen_rec_#in~p.base]< 4#strlen_recENTRYtrue [2020-07-01 12:10:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash 99623184, now seen corresponding path program 1 times [2020-07-01 12:10:13,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:13,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827992054] [2020-07-01 12:10:13,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:13,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:10:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1949298, now seen corresponding path program 1 times [2020-07-01 12:10:13,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:13,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433044337] [2020-07-01 12:10:13,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:13,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:10:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1609089025, now seen corresponding path program 1 times [2020-07-01 12:10:13,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:10:13,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952689900] [2020-07-01 12:10:13,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:10:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:13,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:10:13,739 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:10:13,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:10:13,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:10:13,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:10:13,740 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:10:13,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:13,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:10:13,740 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:10:13,740 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 12:10:13,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:10:13,741 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:10:13,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:13,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:10:14,016 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:10:14,021 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:10:14,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:10:14,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:10:14,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:10:14,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:10:14,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:10:14,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:10:14,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:10:14,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:10:14,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:10:14,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:10:14,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:10:14,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:10:14,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:10:14,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:10:14,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:10:14,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:10:14,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:10:14,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:10:14,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:10:14,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:10:14,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:10:14,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:10:14,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:10:14,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:10:14,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:10:14,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:10:14,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:10:14,356 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-01 12:10:14,356 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:10:14,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:10:14,366 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 12:10:14,366 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:10:14,367 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length strlen_rec_#in~p.base)_1, strlen_rec_#in~p.offset) = 1*v_rep(select #length strlen_rec_#in~p.base)_1 - 1*strlen_rec_#in~p.offset Supporting invariants [] [2020-07-01 12:10:14,403 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-01 12:10:14,411 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:10:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:10:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:14,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:10:14,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:10:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:10:14,462 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:10:14,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:10:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:10:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:10:14,516 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 12:10:14,516 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 12:10:14,520 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-01 12:10:14,521 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 4 states. [2020-07-01 12:10:14,619 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 4 states. Result 49 states and 69 transitions. Complement of second has 15 states. [2020-07-01 12:10:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 12:10:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 12:10:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-01 12:10:14,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-01 12:10:14,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:10:14,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-01 12:10:14,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:10:14,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-01 12:10:14,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:10:14,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. [2020-07-01 12:10:14,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:10:14,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-07-01 12:10:14,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 12:10:14,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 12:10:14,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 12:10:14,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:10:14,642 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:10:14,642 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:10:14,642 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:10:14,643 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 12:10:14,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:10:14,643 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:10:14,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 12:10:14,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:10:14 BasicIcfg [2020-07-01 12:10:14,649 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 12:10:14,651 INFO L168 Benchmark]: Toolchain (without parser) took 7628.11 ms. Allocated memory was 649.6 MB in the beginning and 772.3 MB in the end (delta: 122.7 MB). Free memory was 562.8 MB in the beginning and 394.2 MB in the end (delta: 168.6 MB). Peak memory consumption was 291.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,651 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:10:14,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.74 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 561.4 MB in the beginning and 653.0 MB in the end (delta: -91.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.36 ms. Allocated memory is still 691.0 MB. Free memory was 653.0 MB in the beginning and 651.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,652 INFO L168 Benchmark]: Boogie Preprocessor took 20.07 ms. Allocated memory is still 691.0 MB. Free memory was 651.6 MB in the beginning and 650.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,653 INFO L168 Benchmark]: RCFGBuilder took 262.95 ms. Allocated memory is still 691.0 MB. Free memory was 650.3 MB in the beginning and 631.9 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,653 INFO L168 Benchmark]: BlockEncodingV2 took 98.17 ms. Allocated memory is still 691.0 MB. Free memory was 631.9 MB in the beginning and 626.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,654 INFO L168 Benchmark]: TraceAbstraction took 5593.52 ms. Allocated memory was 691.0 MB in the beginning and 772.3 MB in the end (delta: 81.3 MB). Free memory was 625.2 MB in the beginning and 589.2 MB in the end (delta: 35.9 MB). Peak memory consumption was 117.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,654 INFO L168 Benchmark]: BuchiAutomizer took 1315.03 ms. Allocated memory is still 772.3 MB. Free memory was 589.2 MB in the beginning and 394.2 MB in the end (delta: 195.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:10:14,658 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 21 locations, 23 edges - StatisticsResult: Encoded RCFG 16 locations, 24 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.74 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 561.4 MB in the beginning and 653.0 MB in the end (delta: -91.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.36 ms. Allocated memory is still 691.0 MB. Free memory was 653.0 MB in the beginning and 651.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.07 ms. Allocated memory is still 691.0 MB. Free memory was 651.6 MB in the beginning and 650.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 262.95 ms. Allocated memory is still 691.0 MB. Free memory was 650.3 MB in the beginning and 631.9 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 98.17 ms. Allocated memory is still 691.0 MB. Free memory was 631.9 MB in the beginning and 626.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 5593.52 ms. Allocated memory was 691.0 MB in the beginning and 772.3 MB in the end (delta: 81.3 MB). Free memory was 625.2 MB in the beginning and 589.2 MB in the end (delta: 35.9 MB). Peak memory consumption was 117.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1315.03 ms. Allocated memory is still 772.3 MB. Free memory was 589.2 MB in the beginning and 394.2 MB in the end (delta: 195.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.1s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 131 SDslu, 192 SDs, 0 SdLazy, 645 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 206 HoareAnnotationTreeSize, 17 FomulaSimplifications, 2987 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 654 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 138 ConstructedInterpolants, 2 QuantifiedInterpolants, 15472 SizeOfPredicates, 28 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 20/62 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 49 SDslu, 10 SDs, 0 SdLazy, 39 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn62 mio100 lsp52 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 12:10:03.729 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_pwssvX/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:10:15.092 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check