./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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/array-memsafety/add_last-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash c8e64c1324249ca9b9e3c019cfc2046542af7b26 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:25:02,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:25:02,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:25:02,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:25:02,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:25:02,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:25:02,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:25:02,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:25:02,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:25:02,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:25:02,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:25:02,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:25:02,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:25:02,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:25:02,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:25:02,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:25:02,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:25:02,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:25:02,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:25:02,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:25:02,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:25:02,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:25:02,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:25:02,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:25:02,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:25:02,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:25:02,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:25:02,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:25:02,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:25:02,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:25:02,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:25:02,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:25:02,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:25:02,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:25:02,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:25:02,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:25:02,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:25:02,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:25:02,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:25:02,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:25:02,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:25:02,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:25:02,526 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:25:02,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:25:02,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:25:02,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:25:02,529 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:25:02,529 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:25:02,529 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:25:02,530 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:25:02,530 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:25:02,530 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:25:02,530 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:25:02,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:25:02,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:25:02,531 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:25:02,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:25:02,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:25:02,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:25:02,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:25:02,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:25:02,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:25:02,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:25:02,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:25:02,534 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:25:02,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:25:02,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:25:02,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:25:02,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:25:02,535 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:25:02,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:25:02,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:25:02,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:25:02,536 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:25:02,537 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:25:02,537 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8e64c1324249ca9b9e3c019cfc2046542af7b26 [2019-11-28 21:25:02,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:25:02,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:25:02,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:25:02,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:25:02,879 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:25:02,880 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-11-28 21:25:02,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44bedb21/b279b33064d543a38fd13d012ceb13c3/FLAG72ce4a3b1 [2019-11-28 21:25:03,482 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:25:03,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-11-28 21:25:03,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44bedb21/b279b33064d543a38fd13d012ceb13c3/FLAG72ce4a3b1 [2019-11-28 21:25:03,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44bedb21/b279b33064d543a38fd13d012ceb13c3 [2019-11-28 21:25:03,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:25:03,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:25:03,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:03,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:25:03,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:25:03,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:03" (1/1) ... [2019-11-28 21:25:03,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2903b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:03, skipping insertion in model container [2019-11-28 21:25:03,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:03" (1/1) ... [2019-11-28 21:25:03,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:25:03,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:25:04,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:04,318 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:25:04,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:04,435 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:25:04,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04 WrapperNode [2019-11-28 21:25:04,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:04,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:04,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:25:04,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:25:04,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:04,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:25:04,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:25:04,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:25:04,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (1/1) ... [2019-11-28 21:25:04,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:25:04,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:25:04,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:25:04,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:25:04,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (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-28 21:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:25:04,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:25:04,887 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:25:04,887 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 21:25:04,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:04 BoogieIcfgContainer [2019-11-28 21:25:04,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:25:04,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:25:04,890 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:25:04,893 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:25:04,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:04,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:25:03" (1/3) ... [2019-11-28 21:25:04,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72591ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:04, skipping insertion in model container [2019-11-28 21:25:04,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:04,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:04" (2/3) ... [2019-11-28 21:25:04,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72591ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:04, skipping insertion in model container [2019-11-28 21:25:04,897 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:04,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:04" (3/3) ... [2019-11-28 21:25:04,899 INFO L371 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2019-11-28 21:25:04,939 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:25:04,939 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:25:04,940 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:25:04,940 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:25:04,940 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:25:04,940 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:25:04,940 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:25:04,941 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:25:04,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 21:25:04,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:04,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:04,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:04,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:04,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:04,983 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:25:04,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 21:25:04,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:04,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:04,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:04,986 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:04,986 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:04,994 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L515true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 5#L515-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 14#L517true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 15#L520-3true [2019-11-28 21:25:04,995 INFO L796 eck$LassoCheckResult]: Loop: 15#L520-3true assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 12#L520-2true main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 15#L520-3true [2019-11-28 21:25:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 21:25:05,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:05,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891081126] [2019-11-28 21:25:05,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:05,132 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-28 21:25:05,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:05,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800584005] [2019-11-28 21:25:05,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:05,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-28 21:25:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:05,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150778619] [2019-11-28 21:25:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:05,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:05,433 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-11-28 21:25:05,507 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:05,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:05,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:05,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:05,509 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:05,510 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:05,510 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:05,510 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:05,510 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2019-11-28 21:25:05,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:05,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:05,547 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-28 21:25:05,555 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-28 21:25:05,559 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-28 21:25:05,562 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-28 21:25:05,570 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-28 21:25:05,576 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-28 21:25:05,580 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-28 21:25:05,584 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-28 21:25:05,589 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-28 21:25:05,750 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-28 21:25:05,753 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-28 21:25:05,758 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-28 21:25:05,760 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-28 21:25:05,764 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-28 21:25:05,770 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-28 21:25:05,773 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-28 21:25:05,775 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-28 21:25:06,107 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:06,112 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,131 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-28 21:25:06,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,144 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,164 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-28 21:25:06,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,177 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 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,208 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-28 21:25:06,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,216 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,233 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-28 21:25:06,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,242 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,258 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-28 21:25:06,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,273 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:06,283 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-28 21:25:06,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,302 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,320 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-28 21:25:06,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,328 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,339 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-28 21:25:06,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,353 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 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-28 21:25:06,369 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-28 21:25:06,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:06,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:06,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:06,378 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-28 21:25:06,387 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-28 21:25:06,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,410 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-28 21:25:06,418 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-28 21:25:06,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:06,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:06,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:06,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:06,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:06,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:06,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:06,614 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 21:25:06,614 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:06,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:06,630 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:06,630 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:06,631 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-28 21:25:06,650 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 21:25:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:06,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:06,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:06,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:06,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:06,752 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-28 21:25:06,773 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:25:06,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-28 21:25:06,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 31 states and 41 transitions. Complement of second has 7 states. [2019-11-28 21:25:06,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 21:25:06,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:25:06,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:06,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:25:06,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:06,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 21:25:06,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:06,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2019-11-28 21:25:06,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:06,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2019-11-28 21:25:06,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 21:25:06,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 21:25:06,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 21:25:06,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:06,891 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 21:25:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 21:25:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 21:25:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 21:25:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 21:25:06,923 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 21:25:06,924 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 21:25:06,924 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:25:06,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-28 21:25:06,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:06,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:06,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:06,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:25:06,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:06,928 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 105#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 106#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 110#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 113#L520-3 assume !(main_~k~0 < main_~length~0); 109#L525-2 [2019-11-28 21:25:06,929 INFO L796 eck$LassoCheckResult]: Loop: 109#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 108#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;havoc main_#t~mem8;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 109#L525-2 [2019-11-28 21:25:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2019-11-28 21:25:06,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:06,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900588623] [2019-11-28 21:25:06,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,048 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-28 21:25:07,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900588623] [2019-11-28 21:25:07,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:07,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:25:07,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607781856] [2019-11-28 21:25:07,055 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2019-11-28 21:25:07,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821422288] [2019-11-28 21:25:07,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:07,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:07,168 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 21:25:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:07,197 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-28 21:25:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:07,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-28 21:25:07,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:07,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-28 21:25:07,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 21:25:07,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 21:25:07,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-28 21:25:07,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:07,201 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-28 21:25:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-28 21:25:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 21:25:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 21:25:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-28 21:25:07,203 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 21:25:07,203 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 21:25:07,203 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:25:07,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-28 21:25:07,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:07,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:07,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:07,205 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:07,205 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:07,205 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 135#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 138#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 141#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 139#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 140#L520-3 assume !(main_~k~0 < main_~length~0); 137#L525-2 [2019-11-28 21:25:07,206 INFO L796 eck$LassoCheckResult]: Loop: 137#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 136#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;havoc main_#t~mem8;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 137#L525-2 [2019-11-28 21:25:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2019-11-28 21:25:07,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471093792] [2019-11-28 21:25:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2019-11-28 21:25:07,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974715061] [2019-11-28 21:25:07,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:07,250 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2019-11-28 21:25:07,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:07,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211300449] [2019-11-28 21:25:07,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:07,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211300449] [2019-11-28 21:25:07,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519219340] [2019-11-28 21:25:07,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:07,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 21:25:07,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:07,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-28 21:25:07,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:07,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:07,792 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:07,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-11-28 21:25:07,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:07,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-28 21:25:07,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 21:25:07,863 INFO L614 ElimStorePlain]: treesize reduction 10, result has 50.0 percent of original size [2019-11-28 21:25:07,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:07,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-28 21:25:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:07,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:07,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-28 21:25:07,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366388498] [2019-11-28 21:25:07,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 21:25:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 21:25:07,943 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-28 21:25:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:08,145 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-28 21:25:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 21:25:08,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-28 21:25:08,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:08,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2019-11-28 21:25:08,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 21:25:08,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 21:25:08,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-28 21:25:08,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:08,148 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-28 21:25:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-28 21:25:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 21:25:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 21:25:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-28 21:25:08,150 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 21:25:08,150 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 21:25:08,150 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:25:08,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-28 21:25:08,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:08,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:08,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:08,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:08,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:08,152 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 210#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 212#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 215#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 218#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 216#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 217#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 219#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 220#L520-3 assume !(main_~k~0 < main_~length~0); 214#L525-2 [2019-11-28 21:25:08,152 INFO L796 eck$LassoCheckResult]: Loop: 214#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 213#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;havoc main_#t~mem8;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 214#L525-2 [2019-11-28 21:25:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2019-11-28 21:25:08,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:08,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913934452] [2019-11-28 21:25:08,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2019-11-28 21:25:08,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:08,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116338332] [2019-11-28 21:25:08,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2019-11-28 21:25:08,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:08,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318273821] [2019-11-28 21:25:08,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:08,242 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:08,477 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-11-28 21:25:08,524 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:08,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:08,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:08,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:08,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:08,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:08,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:08,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:08,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2019-11-28 21:25:08,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:08,525 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:08,530 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-28 21:25:08,533 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-28 21:25:08,534 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-28 21:25:08,537 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-28 21:25:08,674 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-28 21:25:08,767 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-28 21:25:08,769 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-28 21:25:08,772 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-28 21:25:08,774 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-28 21:25:08,776 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-28 21:25:08,779 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-28 21:25:08,781 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-28 21:25:08,783 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-28 21:25:08,785 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-28 21:25:08,788 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-28 21:25:08,790 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-28 21:25:08,792 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-28 21:25:08,795 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-28 21:25:08,796 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-28 21:25:09,174 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:09,175 INFO L489 LassoAnalysis]: Using template 'affine'. 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-28 21:25:09,189 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-28 21:25:09,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:09,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:09,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:09,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:09,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:09,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:09,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:09,194 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:09,205 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-28 21:25:09,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:09,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:09,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:09,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:09,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:09,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:09,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:09,209 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-28 21:25:09,215 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-28 21:25:09,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:09,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:09,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:09,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:09,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:09,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:09,222 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-28 21:25:09,228 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-28 21:25:09,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:09,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:09,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:09,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:09,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:09,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:09,251 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:09,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-28 21:25:09,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:09,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:09,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:09,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:09,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:09,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:09,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:09,333 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-28 21:25:09,334 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 12 variables to zero. 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-28 21:25:09,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:09,341 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:09,341 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:09,341 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_2, ULTIMATE.start_main_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_2 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2019-11-28 21:25:09,357 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:25:09,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:09,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:25:09,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:09,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:25:09,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:09,443 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-28 21:25:09,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 21:25:09,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-28 21:25:09,490 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 14 states and 17 transitions. Complement of second has 6 states. [2019-11-28 21:25:09,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:25:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 21:25:09,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 21:25:09,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 21:25:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 21:25:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:09,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-28 21:25:09,494 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:09,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-11-28 21:25:09,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:25:09,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:25:09,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:25:09,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:09,495 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:09,495 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:09,495 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:09,495 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:25:09,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:25:09,495 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:09,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:25:09,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:25:09 BoogieIcfgContainer [2019-11-28 21:25:09,501 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:25:09,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:25:09,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:25:09,502 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:25:09,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:04" (3/4) ... [2019-11-28 21:25:09,506 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:25:09,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:25:09,508 INFO L168 Benchmark]: Toolchain (without parser) took 5650.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 955.0 MB in the beginning and 911.9 MB in the end (delta: 43.1 MB). Peak memory consumption was 261.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:09,508 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:09,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:09,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.72 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:09,510 INFO L168 Benchmark]: Boogie Preprocessor took 26.91 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-28 21:25:09,510 INFO L168 Benchmark]: RCFGBuilder took 379.52 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:09,511 INFO L168 Benchmark]: BuchiAutomizer took 4611.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 911.9 MB in the end (delta: 183.8 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:09,512 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 911.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:09,516 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.72 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.91 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. * RCFGBuilder took 379.52 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4611.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 911.9 MB in the end (delta: 183.8 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 911.9 MB. 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * k + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] + -1 * a and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 60 SDslu, 20 SDs, 0 SdLazy, 87 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax113 hnf98 lsp83 ukn79 mio100 lsp61 div100 bol100 ite100 ukn100 eq170 hnf91 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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...