./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b0415ceba0811795bdd9d25bfbda379c533d6bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:22:17,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:22:17,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:22:17,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:22:17,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:22:17,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:22:17,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:22:17,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:22:17,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:22:17,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:22:17,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:22:17,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:22:17,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:22:17,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:22:17,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:22:17,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:22:17,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:22:17,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:22:17,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:22:17,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:22:17,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:22:17,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:22:17,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:22:17,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:22:17,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:22:17,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:22:17,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:22:17,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:22:17,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:22:17,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:22:17,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:22:17,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:22:17,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:22:17,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:22:17,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:22:17,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:22:17,338 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:22:17,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:22:17,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:22:17,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:22:17,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:22:17,350 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:22:17,350 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:22:17,350 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:22:17,350 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:22:17,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:22:17,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:22:17,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:22:17,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:22:17,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:22:17,352 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:22:17,352 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:22:17,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:22:17,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:22:17,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:22:17,353 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:22:17,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:22:17,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:22:17,353 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:22:17,354 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:22:17,354 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b0415ceba0811795bdd9d25bfbda379c533d6bc [2018-11-23 13:22:17,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:22:17,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:22:17,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:22:17,389 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:22:17,389 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:22:17,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2018-11-23 13:22:17,424 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/data/a5576532d/d55c2f20a59c4716b67274658588065e/FLAG4ade5d162 [2018-11-23 13:22:17,861 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:22:17,862 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2018-11-23 13:22:17,871 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/data/a5576532d/d55c2f20a59c4716b67274658588065e/FLAG4ade5d162 [2018-11-23 13:22:17,879 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/data/a5576532d/d55c2f20a59c4716b67274658588065e [2018-11-23 13:22:17,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:22:17,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:22:17,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:22:17,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:22:17,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:22:17,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:22:17" (1/1) ... [2018-11-23 13:22:17,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206f05bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:17, skipping insertion in model container [2018-11-23 13:22:17,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:22:17" (1/1) ... [2018-11-23 13:22:17,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:22:17,927 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:22:18,107 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:22:18,115 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:22:18,182 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:22:18,204 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:22:18,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18 WrapperNode [2018-11-23 13:22:18,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:22:18,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:22:18,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:22:18,205 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:22:18,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:22:18,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:22:18,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:22:18,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:22:18,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... [2018-11-23 13:22:18,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:22:18,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:22:18,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:22:18,247 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:22:18,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b382b447-d2e4-47c4-9779-522fe659455d/bin-2019/uautomizer/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 [2018-11-23 13:22:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:22:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:22:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:22:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:22:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:22:18,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:22:18,400 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:22:18,401 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 13:22:18,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:22:18 BoogieIcfgContainer [2018-11-23 13:22:18,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:22:18,401 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:22:18,401 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:22:18,404 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:22:18,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:22:18,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:22:17" (1/3) ... [2018-11-23 13:22:18,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd0e368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:22:18, skipping insertion in model container [2018-11-23 13:22:18,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:22:18,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:22:18" (2/3) ... [2018-11-23 13:22:18,407 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd0e368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:22:18, skipping insertion in model container [2018-11-23 13:22:18,407 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:22:18,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:22:18" (3/3) ... [2018-11-23 13:22:18,408 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-termination.c.i [2018-11-23 13:22:18,440 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:22:18,440 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:22:18,440 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:22:18,441 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:22:18,441 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:22:18,441 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:22:18,441 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:22:18,441 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:22:18,441 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:22:18,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 13:22:18,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:22:18,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:22:18,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:22:18,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:22:18,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:22:18,472 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:22:18,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 13:22:18,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:22:18,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:22:18,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:22:18,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:22:18,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:22:18,478 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L564true assume !(main_~array_size~0 < 1); 10#L564-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 15#L552-3true [2018-11-23 13:22:18,478 INFO L796 eck$LassoCheckResult]: Loop: 15#L552-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 9#L555-3true assume !true; 12#L552-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 15#L552-3true [2018-11-23 13:22:18,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 13:22:18,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:18,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:18,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:18,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-11-23 13:22:18,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:18,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:22:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:22:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:22:18,585 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:22:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:22:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:22:18,596 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-23 13:22:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:22:18,601 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-23 13:22:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:22:18,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-23 13:22:18,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:22:18,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-11-23 13:22:18,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 13:22:18,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 13:22:18,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-23 13:22:18,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:22:18,609 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 13:22:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-23 13:22:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-23 13:22:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:22:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-23 13:22:18,627 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 13:22:18,627 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 13:22:18,627 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:22:18,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-23 13:22:18,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:22:18,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:22:18,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:22:18,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:22:18,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:22:18,628 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L564 assume !(main_~array_size~0 < 1); 36#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 40#L552-3 [2018-11-23 13:22:18,628 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 38#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 41#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 40#L552-3 [2018-11-23 13:22:18,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 13:22:18,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-11-23 13:22:18,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:18,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:18,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:22:18,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-11-23 13:22:18,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:18,854 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:22:18,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:22:18,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:22:18,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:22:18,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:22:18,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:22:18,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:22:18,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:22:18,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 13:22:18,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:22:18,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:22:18,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:18,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:18,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:18,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:18,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:18,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,228 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:22:19,231 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:22:19,232 INFO L122 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 [2018-11-23 13:22:19,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:19,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:19,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:19,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,238 INFO L122 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 [2018-11-23 13:22:19,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:19,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:19,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:19,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,240 INFO L122 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 [2018-11-23 13:22:19,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:19,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:19,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:19,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,243 INFO L122 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 [2018-11-23 13:22:19,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:19,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:19,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,249 INFO L122 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 [2018-11-23 13:22:19,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:19,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:19,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:19,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,251 INFO L122 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 [2018-11-23 13:22:19,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:19,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:19,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,259 INFO L122 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 [2018-11-23 13:22:19,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,259 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:22:19,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:22:19,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:19,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,280 INFO L122 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 [2018-11-23 13:22:19,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:19,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:19,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:19,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,284 INFO L122 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 [2018-11-23 13:22:19,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:19,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:19,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,289 INFO L122 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 [2018-11-23 13:22:19,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:19,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:19,323 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:22:19,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:22:19,348 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:22:19,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:22:19,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:22:19,352 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:22:19,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2018-11-23 13:22:19,356 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 13:22:19,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:19,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:19,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:22:19,423 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 [2018-11-23 13:22:19,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 13:22:19,443 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2018-11-23 13:22:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:22:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:22:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-23 13:22:19,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-23 13:22:19,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:19,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 13:22:19,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:19,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-23 13:22:19,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:19,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-23 13:22:19,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:22:19,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-23 13:22:19,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 13:22:19,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 13:22:19,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-23 13:22:19,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:22:19,449 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 13:22:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-23 13:22:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 13:22:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:22:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-23 13:22:19,450 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 13:22:19,450 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 13:22:19,451 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:22:19,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-23 13:22:19,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:22:19,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:22:19,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:22:19,452 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:22:19,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:22:19,452 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 104#L564 assume !(main_~array_size~0 < 1); 105#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 111#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 107#L555-3 [2018-11-23 13:22:19,452 INFO L796 eck$LassoCheckResult]: Loop: 107#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 108#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 107#L555-3 [2018-11-23 13:22:19,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 13:22:19,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:19,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:19,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-23 13:22:19,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:19,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:19,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-23 13:22:19,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:19,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:19,623 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:22:19,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:22:19,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:22:19,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:22:19,623 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:22:19,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:22:19,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:22:19,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:22:19,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 13:22:19,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:22:19,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:22:19,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:19,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:22:19,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:22:19,889 INFO L122 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 [2018-11-23 13:22:19,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:19,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:19,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:19,905 INFO L122 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 [2018-11-23 13:22:19,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:19,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:19,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:19,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:19,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:19,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:19,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:19,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:22:19,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:22:19,909 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:22:19,909 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:22:19,909 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:22:19,909 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:22:19,910 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2018-11-23 13:22:19,945 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 13:22:19,946 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:22:19,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:19,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:19,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:22:19,977 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 [2018-11-23 13:22:19,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 13:22:19,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2018-11-23 13:22:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:22:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:22:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 13:22:19,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 13:22:19,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:19,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 13:22:19,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:19,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 13:22:19,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:19,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-11-23 13:22:19,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:22:19,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2018-11-23 13:22:19,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 13:22:19,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 13:22:19,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-23 13:22:19,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:22:19,994 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-23 13:22:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-23 13:22:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 13:22:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:22:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-23 13:22:19,996 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 13:22:19,996 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 13:22:19,996 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:22:19,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-23 13:22:19,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:22:19,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:22:19,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:22:19,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:22:19,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:22:19,997 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 194#L564 assume !(main_~array_size~0 < 1); 195#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 201#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 204#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 205#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 202#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 203#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 197#L555-3 [2018-11-23 13:22:19,997 INFO L796 eck$LassoCheckResult]: Loop: 197#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 198#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 197#L555-3 [2018-11-23 13:22:19,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-11-23 13:22:19,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:19,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:19,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:22:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:20,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-23 13:22:20,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:20,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:22:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:20,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-11-23 13:22:20,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:22:20,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:22:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:20,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:22:20,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:22:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:22:20,184 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-23 13:22:20,226 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:22:20,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:22:20,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:22:20,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:22:20,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:22:20,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:22:20,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:22:20,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:22:20,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 13:22:20,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:22:20,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:22:20,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:22:20,510 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:22:20,510 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:22:20,511 INFO L122 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 [2018-11-23 13:22:20,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:20,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:20,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:20,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,513 INFO L122 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 [2018-11-23 13:22:20,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:20,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:20,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,515 INFO L122 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 [2018-11-23 13:22:20,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:20,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:20,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:20,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,516 INFO L122 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 [2018-11-23 13:22:20,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:20,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:20,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,522 INFO L122 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 [2018-11-23 13:22:20,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:20,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:20,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:20,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,524 INFO L122 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 [2018-11-23 13:22:20,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:20,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:20,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:20,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,525 INFO L122 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 [2018-11-23 13:22:20,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:20,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:20,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,531 INFO L122 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 [2018-11-23 13:22:20,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:22:20,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:22:20,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:22:20,545 INFO L122 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 [2018-11-23 13:22:20,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:22:20,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:22:20,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:22:20,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:22:20,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:22:20,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:22:20,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:22:20,550 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:22:20,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:22:20,551 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:22:20,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:22:20,552 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:22:20,552 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:22:20,552 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2018-11-23 13:22:20,566 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 13:22:20,567 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:22:20,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:20,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:20,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:22:20,610 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 [2018-11-23 13:22:20,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:22:20,629 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2018-11-23 13:22:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:22:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:22:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 13:22:20,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 13:22:20,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:20,630 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:22:20,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:20,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:20,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:22:20,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:22:20,679 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:22:20,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2018-11-23 13:22:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:22:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:22:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 13:22:20,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 13:22:20,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:20,695 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:22:20,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:22:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:20,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:22:20,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:22:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:22:20,721 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:22:20,721 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:22:20,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2018-11-23 13:22:20,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:22:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:22:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 13:22:20,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 13:22:20,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:20,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 13:22:20,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:20,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 13:22:20,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:22:20,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-23 13:22:20,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:22:20,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-11-23 13:22:20,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:22:20,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:22:20,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:22:20,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:22:20,736 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:22:20,736 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:22:20,736 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:22:20,736 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:22:20,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:22:20,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:22:20,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:22:20,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:22:20 BoogieIcfgContainer [2018-11-23 13:22:20,740 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:22:20,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:22:20,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:22:20,741 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:22:20,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:22:18" (3/4) ... [2018-11-23 13:22:20,743 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:22:20,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:22:20,744 INFO L168 Benchmark]: Toolchain (without parser) took 2861.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 951.1 MB in the beginning and 1.0 GB in the end (delta: -77.7 MB). Peak memory consumption was 160.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:22:20,744 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:22:20,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -204.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:22:20,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:22:20,746 INFO L168 Benchmark]: Boogie Preprocessor took 14.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:22:20,746 INFO L168 Benchmark]: RCFGBuilder took 153.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:22:20,746 INFO L168 Benchmark]: BuchiAutomizer took 2338.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.4 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:22:20,746 INFO L168 Benchmark]: Witness Printer took 2.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:22:20,749 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -204.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2338.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.4 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax114 hnf99 lsp78 ukn82 mio100 lsp57 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...