./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6ea490b9c20ea87d0996e916d918afb3a914616 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:21:28,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:21:28,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:21:28,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:21:28,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:21:28,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:21:28,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:21:28,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:21:28,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:21:28,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:21:28,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:21:28,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:21:28,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:21:28,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:21:28,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:21:28,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:21:28,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:21:28,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:21:28,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:21:28,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:21:28,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:21:28,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:21:28,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:21:28,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:21:28,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:21:28,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:21:28,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:21:28,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:21:28,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:21:28,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:21:28,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:21:28,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:21:28,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:21:28,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:21:28,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:21:28,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:21:28,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:21:28,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:21:28,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:21:28,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:21:28,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:21:28,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:21:28,492 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:21:28,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:21:28,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:21:28,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:21:28,495 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:21:28,495 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:21:28,495 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:21:28,496 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:21:28,496 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:21:28,496 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:21:28,496 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:21:28,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:21:28,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:21:28,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:21:28,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:21:28,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:21:28,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:21:28,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:21:28,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:21:28,499 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:21:28,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:21:28,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:21:28,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:21:28,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:21:28,501 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:21:28,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:21:28,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:21:28,501 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:21:28,502 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:21:28,503 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6ea490b9c20ea87d0996e916d918afb3a914616 [2019-11-19 22:21:28,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:21:28,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:21:28,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:21:28,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:21:28,829 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:21:28,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2019-11-19 22:21:28,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c081a415/b2e60fd289d2475da2d2b9bd34f27c72/FLAGe982026f4 [2019-11-19 22:21:29,414 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:21:29,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2019-11-19 22:21:29,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c081a415/b2e60fd289d2475da2d2b9bd34f27c72/FLAGe982026f4 [2019-11-19 22:21:29,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c081a415/b2e60fd289d2475da2d2b9bd34f27c72 [2019-11-19 22:21:29,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:21:29,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:21:29,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:29,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:21:29,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:21:29,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:29" (1/1) ... [2019-11-19 22:21:29,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489b320b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:29, skipping insertion in model container [2019-11-19 22:21:29,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:29" (1/1) ... [2019-11-19 22:21:29,760 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:21:29,820 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:21:30,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:30,319 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:21:30,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:30,440 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:21:30,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30 WrapperNode [2019-11-19 22:21:30,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:30,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:30,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:21:30,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:21:30,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:30,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:21:30,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:21:30,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:21:30,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... [2019-11-19 22:21:30,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:21:30,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:21:30,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:21:30,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:21:30,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:21:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:21:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:21:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:21:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:21:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:21:30,878 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:21:30,879 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-19 22:21:30,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:30 BoogieIcfgContainer [2019-11-19 22:21:30,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:21:30,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:21:30,881 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:21:30,884 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:21:30,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:30,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:21:29" (1/3) ... [2019-11-19 22:21:30,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bf69adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:30, skipping insertion in model container [2019-11-19 22:21:30,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:30,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:30" (2/3) ... [2019-11-19 22:21:30,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bf69adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:30, skipping insertion in model container [2019-11-19 22:21:30,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:30,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:30" (3/3) ... [2019-11-19 22:21:30,890 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2019-11-19 22:21:30,932 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:21:30,932 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:21:30,933 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:21:30,933 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:21:30,934 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:21:30,934 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:21:30,934 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:21:30,934 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:21:30,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-19 22:21:30,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:30,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:30,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:30,979 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:30,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:30,980 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:21:30,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-19 22:21:30,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:30,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:30,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:30,982 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:30,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:30,991 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L549-3true [2019-11-19 22:21:30,992 INFO L796 eck$LassoCheckResult]: Loop: 8#L549-3true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 4#L549-1true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 5#L551-3true assume !true; 7#L551-4true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 8#L549-3true [2019-11-19 22:21:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 22:21:31,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160014480] [2019-11-19 22:21:31,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-11-19 22:21:31,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283175493] [2019-11-19 22:21:31,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:31,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283175493] [2019-11-19 22:21:31,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:31,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:21:31,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959604806] [2019-11-19 22:21:31,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:31,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:21:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:21:31,221 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2019-11-19 22:21:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:31,228 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-19 22:21:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:21:31,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-19 22:21:31,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:31,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-11-19 22:21:31,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-19 22:21:31,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:21:31,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-19 22:21:31,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:31,239 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 22:21:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-19 22:21:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-19 22:21:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:21:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-19 22:21:31,268 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 22:21:31,268 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 22:21:31,268 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:21:31,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-19 22:21:31,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:31,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:31,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:31,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:31,270 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:31,271 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 31#L549-3 [2019-11-19 22:21:31,271 INFO L796 eck$LassoCheckResult]: Loop: 31#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 32#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 33#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 34#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 36#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 31#L549-3 [2019-11-19 22:21:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-19 22:21:31,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214305519] [2019-11-19 22:21:31,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-11-19 22:21:31,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183084682] [2019-11-19 22:21:31,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:31,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183084682] [2019-11-19 22:21:31,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:31,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:21:31,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418684338] [2019-11-19 22:21:31,369 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:31,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:21:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:21:31,370 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-19 22:21:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:31,437 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-19 22:21:31,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:31,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-19 22:21:31,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:21:31,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 22:21:31,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 22:21:31,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 22:21:31,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-19 22:21:31,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:31,441 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:21:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-19 22:21:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-19 22:21:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:21:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 22:21:31,446 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:21:31,446 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:21:31,446 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:21:31,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-19 22:21:31,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:21:31,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:31,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:31,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:31,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-19 22:21:31,450 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 57#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 58#L549-3 [2019-11-19 22:21:31,450 INFO L796 eck$LassoCheckResult]: Loop: 58#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 59#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 55#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 56#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 62#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 63#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 60#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 58#L549-3 [2019-11-19 22:21:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-19 22:21:31,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176129191] [2019-11-19 22:21:31,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,491 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2019-11-19 22:21:31,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637991431] [2019-11-19 22:21:31,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:31,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637991431] [2019-11-19 22:21:31,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521632694] [2019-11-19 22:21:31,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:31,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:31,691 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 11 treesize of output 7 [2019-11-19 22:21:31,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:31,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:31,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:31,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:31,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:31,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:31,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:31,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:31,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:31,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:31,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:31,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:31,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:31,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:31,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:31,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-19 22:21:31,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577581152] [2019-11-19 22:21:31,768 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:31,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:21:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:21:31,770 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-19 22:21:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:31,836 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-19 22:21:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:21:31,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-19 22:21:31,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:31,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-19 22:21:31,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-19 22:21:31,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 22:21:31,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-19 22:21:31,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:31,840 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 22:21:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-19 22:21:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-19 22:21:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-19 22:21:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-19 22:21:31,845 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 22:21:31,845 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 22:21:31,845 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:21:31,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-19 22:21:31,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:31,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:31,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:31,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:31,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2019-11-19 22:21:31,850 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 107#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 108#L549-3 [2019-11-19 22:21:31,851 INFO L796 eck$LassoCheckResult]: Loop: 108#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 109#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 105#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 106#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 112#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 115#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 114#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 113#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 110#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 108#L549-3 [2019-11-19 22:21:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-19 22:21:31,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841491162] [2019-11-19 22:21:31,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:31,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1970998361, now seen corresponding path program 2 times [2019-11-19 22:21:31,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588747818] [2019-11-19 22:21:31,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:31,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588747818] [2019-11-19 22:21:31,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561810957] [2019-11-19 22:21:31,994 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:32,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:21:32,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:32,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:21:32,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:32,064 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 11 treesize of output 7 [2019-11-19 22:21:32,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:32,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:32,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:32,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:32,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:32,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:32,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:32,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:32,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-19 22:21:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766804296] [2019-11-19 22:21:32,141 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:32,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:21:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:21:32,147 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-11-19 22:21:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:32,242 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-19 22:21:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:21:32,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-19 22:21:32,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:21:32,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 22:21:32,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-19 22:21:32,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-19 22:21:32,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-19 22:21:32,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:32,248 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:21:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-19 22:21:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-19 22:21:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 22:21:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 22:21:32,253 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:21:32,253 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:21:32,254 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:21:32,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-19 22:21:32,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:21:32,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:32,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:32,256 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:32,256 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2019-11-19 22:21:32,257 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L549-3 [2019-11-19 22:21:32,257 INFO L796 eck$LassoCheckResult]: Loop: 173#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 174#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 175#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 178#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 182#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 181#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 180#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 179#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 176#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 173#L549-3 [2019-11-19 22:21:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-11-19 22:21:32,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:32,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220584514] [2019-11-19 22:21:32,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:32,281 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash -48795806, now seen corresponding path program 3 times [2019-11-19 22:21:32,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:32,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750695218] [2019-11-19 22:21:32,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:32,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750695218] [2019-11-19 22:21:32,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287498984] [2019-11-19 22:21:32,422 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:32,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:21:32,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:32,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:21:32,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:32,481 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 11 treesize of output 7 [2019-11-19 22:21:32,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:32,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:32,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:32,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:32,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:32,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:32,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:32,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:32,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:32,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:32,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:32,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:32,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2019-11-19 22:21:32,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831996915] [2019-11-19 22:21:32,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:32,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:21:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:21:32,588 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 13 states. [2019-11-19 22:21:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:32,708 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-19 22:21:32,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:21:32,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-19 22:21:32,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-19 22:21:32,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 22:21:32,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-19 22:21:32,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-19 22:21:32,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-19 22:21:32,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:32,713 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:21:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-19 22:21:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-19 22:21:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:21:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 22:21:32,715 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:21:32,716 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:21:32,717 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:21:32,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-19 22:21:32,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-19 22:21:32,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:32,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:32,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:32,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2019-11-19 22:21:32,726 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 250#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 251#L549-3 [2019-11-19 22:21:32,727 INFO L796 eck$LassoCheckResult]: Loop: 251#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 252#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 253#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 258#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 254#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 255#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 264#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 263#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 262#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 261#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 260#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 259#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 257#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 251#L549-3 [2019-11-19 22:21:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-11-19 22:21:32,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:32,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784142479] [2019-11-19 22:21:32,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:32,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 4 times [2019-11-19 22:21:32,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:32,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483285067] [2019-11-19 22:21:32,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:33,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483285067] [2019-11-19 22:21:33,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689820538] [2019-11-19 22:21:33,007 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:33,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:21:33,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:33,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:21:33,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:33,065 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 11 treesize of output 7 [2019-11-19 22:21:33,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:33,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:33,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:33,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:33,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-19 22:21:33,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463462846] [2019-11-19 22:21:33,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:33,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:21:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:21:33,186 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 16 states. [2019-11-19 22:21:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:33,405 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-19 22:21:33,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:21:33,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-19 22:21:33,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-19 22:21:33,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 22:21:33,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-19 22:21:33,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-19 22:21:33,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-19 22:21:33,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:33,408 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 22:21:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-19 22:21:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-19 22:21:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 22:21:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 22:21:33,410 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 22:21:33,410 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 22:21:33,410 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:21:33,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-19 22:21:33,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-19 22:21:33,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:33,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:33,411 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:33,411 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2019-11-19 22:21:33,412 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 345#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 346#L549-3 [2019-11-19 22:21:33,412 INFO L796 eck$LassoCheckResult]: Loop: 346#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 347#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 348#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 353#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 349#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 350#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 361#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 360#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 359#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 358#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 357#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 356#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 355#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 354#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 352#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 346#L549-3 [2019-11-19 22:21:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-11-19 22:21:33,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:33,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252624440] [2019-11-19 22:21:33,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:33,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1105064296, now seen corresponding path program 5 times [2019-11-19 22:21:33,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:33,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799674588] [2019-11-19 22:21:33,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:33,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799674588] [2019-11-19 22:21:33,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537642605] [2019-11-19 22:21:33,642 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:33,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 22:21:33,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:33,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:33,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:33,699 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 11 treesize of output 7 [2019-11-19 22:21:33,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:33,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:33,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:33,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:33,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:33,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:33,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2019-11-19 22:21:33,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869246084] [2019-11-19 22:21:33,825 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:33,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:21:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:21:33,826 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 19 states. [2019-11-19 22:21:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:34,097 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 22:21:34,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:21:34,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-11-19 22:21:34,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-19 22:21:34,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-11-19 22:21:34,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-19 22:21:34,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-19 22:21:34,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-11-19 22:21:34,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:34,101 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 22:21:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-11-19 22:21:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-19 22:21:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 22:21:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-19 22:21:34,103 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 22:21:34,103 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 22:21:34,103 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:21:34,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-19 22:21:34,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-19 22:21:34,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:34,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:34,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:34,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2019-11-19 22:21:34,105 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 457#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 458#L549-3 [2019-11-19 22:21:34,105 INFO L796 eck$LassoCheckResult]: Loop: 458#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 459#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 460#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 463#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 455#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 456#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 473#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 472#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 471#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 470#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 469#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 468#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 467#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 466#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 465#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 464#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 461#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 458#L549-3 [2019-11-19 22:21:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-11-19 22:21:34,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:34,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266142757] [2019-11-19 22:21:34,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:34,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1109814765, now seen corresponding path program 6 times [2019-11-19 22:21:34,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:34,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124723748] [2019-11-19 22:21:34,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:34,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124723748] [2019-11-19 22:21:34,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868747201] [2019-11-19 22:21:34,294 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:34,362 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 22:21:34,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:34,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:21:34,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:34,371 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 11 treesize of output 7 [2019-11-19 22:21:34,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:34,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:34,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:34,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:34,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:34,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:34,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:34,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:34,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:34,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:34,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:34,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:34,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:34,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:34,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:34,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:34,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:34,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:34,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2019-11-19 22:21:34,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110906636] [2019-11-19 22:21:34,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:34,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:21:34,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:21:34,498 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 22 states. [2019-11-19 22:21:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:34,741 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 22:21:34,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 22:21:34,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-19 22:21:34,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-19 22:21:34,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 22:21:34,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-19 22:21:34,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-19 22:21:34,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-11-19 22:21:34,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:34,746 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 22:21:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-11-19 22:21:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-19 22:21:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 22:21:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 22:21:34,748 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 22:21:34,748 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 22:21:34,749 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:21:34,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-19 22:21:34,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-19 22:21:34,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:34,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:34,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:34,750 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2019-11-19 22:21:34,751 INFO L794 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 582#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 583#L549-3 [2019-11-19 22:21:34,751 INFO L796 eck$LassoCheckResult]: Loop: 583#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 584#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 585#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 588#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 580#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 581#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 600#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 599#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 598#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 597#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 596#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 595#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 594#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 593#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 592#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 591#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 590#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 589#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 587#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 583#L549-3 [2019-11-19 22:21:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-11-19 22:21:34,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:34,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449997628] [2019-11-19 22:21:34,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:34,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:34,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1380048178, now seen corresponding path program 7 times [2019-11-19 22:21:34,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:34,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22509530] [2019-11-19 22:21:34,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:34,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22509530] [2019-11-19 22:21:34,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640335492] [2019-11-19 22:21:34,977 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:35,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:21:35,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:35,043 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 11 treesize of output 7 [2019-11-19 22:21:35,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:35,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:35,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:35,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:35,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2019-11-19 22:21:35,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272165852] [2019-11-19 22:21:35,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:35,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 22:21:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:21:35,202 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 25 states. [2019-11-19 22:21:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:35,502 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-19 22:21:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 22:21:35,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-11-19 22:21:35,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-19 22:21:35,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 22:21:35,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:21:35,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:21:35,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-11-19 22:21:35,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:35,505 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 22:21:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-11-19 22:21:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-19 22:21:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 22:21:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 22:21:35,508 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 22:21:35,508 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 22:21:35,509 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 22:21:35,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-19 22:21:35,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-19 22:21:35,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:35,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:35,510 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:35,510 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2019-11-19 22:21:35,511 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 722#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 723#L549-3 [2019-11-19 22:21:35,511 INFO L796 eck$LassoCheckResult]: Loop: 723#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 724#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 725#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 728#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 720#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 721#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 742#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 741#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 740#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 739#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 738#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 737#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 736#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 735#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 734#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 733#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 732#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 731#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 730#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 729#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 727#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 723#L549-3 [2019-11-19 22:21:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-11-19 22:21:35,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:35,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963760783] [2019-11-19 22:21:35,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:35,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash 918646985, now seen corresponding path program 8 times [2019-11-19 22:21:35,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:35,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802595907] [2019-11-19 22:21:35,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:35,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802595907] [2019-11-19 22:21:35,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879513015] [2019-11-19 22:21:35,729 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:35,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:21:35,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:35,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:21:35,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:35,785 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 11 treesize of output 7 [2019-11-19 22:21:35,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:35,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:35,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:35,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:35,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:35,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:35,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:35,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:35,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 28 [2019-11-19 22:21:35,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613749515] [2019-11-19 22:21:35,981 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:35,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:35,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 22:21:35,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-11-19 22:21:35,983 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 28 states. [2019-11-19 22:21:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:36,436 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-19 22:21:36,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 22:21:36,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-11-19 22:21:36,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-19 22:21:36,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-11-19 22:21:36,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-19 22:21:36,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-19 22:21:36,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-11-19 22:21:36,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:36,438 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 22:21:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-11-19 22:21:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 22:21:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:21:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-19 22:21:36,440 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 22:21:36,440 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 22:21:36,441 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 22:21:36,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-19 22:21:36,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-19 22:21:36,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:36,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:36,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:36,443 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2019-11-19 22:21:36,443 INFO L794 eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 875#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 876#L549-3 [2019-11-19 22:21:36,443 INFO L796 eck$LassoCheckResult]: Loop: 876#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 877#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 878#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 883#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 879#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 880#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 899#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 898#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 897#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 896#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 895#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 894#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 893#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 892#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 891#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 890#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 889#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 888#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 887#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 886#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 885#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 884#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 882#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 876#L549-3 [2019-11-19 22:21:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-11-19 22:21:36,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:36,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829509879] [2019-11-19 22:21:36,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:36,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:36,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 9 times [2019-11-19 22:21:36,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:36,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797307501] [2019-11-19 22:21:36,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:36,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2019-11-19 22:21:36,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:36,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756331363] [2019-11-19 22:21:36,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:36,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:38,499 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 138 DAG size of output: 127 [2019-11-19 22:21:38,668 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:38,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:38,669 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:38,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:38,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:38,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:38,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:38,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:38,669 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration11_Lasso [2019-11-19 22:21:38,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:38,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:38,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:38,866 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-19 22:21:38,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,221 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:39,225 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:39,230 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 [2019-11-19 22:21:39,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:39,246 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 [2019-11-19 22:21:39,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:21:39,264 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 [2019-11-19 22:21:39,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,307 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 [2019-11-19 22:21:39,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,331 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 [2019-11-19 22:21:39,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,355 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 [2019-11-19 22:21:39,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,384 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 [2019-11-19 22:21:39,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,409 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 [2019-11-19 22:21:39,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,434 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 [2019-11-19 22:21:39,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,470 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 [2019-11-19 22:21:39,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,492 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 [2019-11-19 22:21:39,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,516 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 [2019-11-19 22:21:39,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,543 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 [2019-11-19 22:21:39,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,584 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 [2019-11-19 22:21:39,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,605 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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:39,615 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:21:39,615 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:39,622 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:21:39,622 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:39,623 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,683 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-19 22:21:39,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:21:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:39,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:39,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:39,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:21:39,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:39,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-11-19 22:21:39,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:39,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-19 22:21:39,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:39,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:39,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:39,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:39,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:39,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:39,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:39,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:39,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:39,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:40,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:40,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:40,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:40,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:40,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-11-19 22:21:40,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:40,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:30 [2019-11-19 22:21:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:40,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2019-11-19 22:21:40,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 13 states. [2019-11-19 22:21:40,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 57 states and 62 transitions. Complement of second has 26 states. [2019-11-19 22:21:40,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 22:21:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2019-11-19 22:21:40,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 23 letters. [2019-11-19 22:21:40,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:40,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 25 letters. Loop has 23 letters. [2019-11-19 22:21:40,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:40,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 46 letters. [2019-11-19 22:21:40,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:40,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2019-11-19 22:21:40,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-19 22:21:40,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 61 transitions. [2019-11-19 22:21:40,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-19 22:21:40,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-19 22:21:40,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2019-11-19 22:21:40,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:40,694 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-19 22:21:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2019-11-19 22:21:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-11-19 22:21:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-19 22:21:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-11-19 22:21:40,698 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-11-19 22:21:40,698 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-11-19 22:21:40,698 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 22:21:40,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2019-11-19 22:21:40,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-19 22:21:40,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:40,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:40,700 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:21:40,700 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2019-11-19 22:21:40,701 INFO L794 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1144#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1145#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1146#L549-1 [2019-11-19 22:21:40,701 INFO L796 eck$LassoCheckResult]: Loop: 1146#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1147#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1150#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1159#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1178#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1174#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1173#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1172#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1169#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1168#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1167#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1166#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1165#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1164#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1163#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1162#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1161#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1154#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1155#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1146#L549-1 [2019-11-19 22:21:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-19 22:21:40,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817981114] [2019-11-19 22:21:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:40,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1726515181, now seen corresponding path program 10 times [2019-11-19 22:21:40,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065226892] [2019-11-19 22:21:40,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065226892] [2019-11-19 22:21:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710735273] [2019-11-19 22:21:41,087 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:41,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:21:41,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:41,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:41,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:41,165 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 11 treesize of output 7 [2019-11-19 22:21:41,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-19 22:21:41,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 22:21:41,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:21:41,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-19 22:21:41,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:41,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:41,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:41,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:21:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:41,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:41,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2019-11-19 22:21:41,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224683533] [2019-11-19 22:21:41,516 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:41,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:41,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-19 22:21:41,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2019-11-19 22:21:41,518 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand 31 states. [2019-11-19 22:21:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:41,895 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-11-19 22:21:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 22:21:41,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2019-11-19 22:21:41,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:41,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2019-11-19 22:21:41,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:21:41,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:21:41,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:21:41,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:41,898 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:41,898 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:41,898 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:41,898 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 22:21:41,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:21:41,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:41,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:21:41,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:21:41 BoogieIcfgContainer [2019-11-19 22:21:41,905 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:21:41,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:21:41,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:21:41,906 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:21:41,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:30" (3/4) ... [2019-11-19 22:21:41,910 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:21:41,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:21:41,912 INFO L168 Benchmark]: Toolchain (without parser) took 12168.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -279.7 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:41,912 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:41,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:41,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:41,913 INFO L168 Benchmark]: Boogie Preprocessor took 28.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:41,914 INFO L168 Benchmark]: RCFGBuilder took 361.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:41,914 INFO L168 Benchmark]: BuchiAutomizer took 11024.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:41,915 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:41,917 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 361.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11024.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 7.5s. Construction of modules took 1.4s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/90 HoareTripleCheckerStatistics: 73 SDtfs, 93 SDslu, 180 SDs, 0 SdLazy, 1647 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax111 hnf100 lsp85 ukn72 mio100 lsp44 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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! Received shutdown request...