./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/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 32bit --witnessprinter.graph.data.programhash 653582a7b000e4f324410c98077c6ee21baa5247 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:58:37,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:58:37,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:58:37,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:58:37,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:58:37,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:58:37,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:58:37,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:58:37,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:58:37,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:58:37,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:58:37,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:58:37,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:58:37,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:58:37,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:58:37,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:58:37,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:58:37,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:58:37,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:58:37,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:58:37,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:58:37,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:58:37,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:58:37,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:58:37,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:58:37,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:58:37,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:58:37,192 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:58:37,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:58:37,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:58:37,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:58:37,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:58:37,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:58:37,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:58:37,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:58:37,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:58:37,195 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:58:37,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:58:37,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:58:37,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:58:37,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:58:37,208 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:58:37,208 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:58:37,208 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:58:37,209 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:58:37,209 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:58:37,209 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:58:37,209 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:58:37,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:58:37,209 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:58:37,209 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:58:37,210 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:58:37,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:58:37,211 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:58:37,211 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:58:37,211 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:58:37,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:58:37,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:58:37,211 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:58:37,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:58:37,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:58:37,212 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:58:37,213 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:58:37,213 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_bd83dc55-5174-4ef0-b3c1-da93520df5a8/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 653582a7b000e4f324410c98077c6ee21baa5247 [2018-11-28 12:58:37,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:58:37,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:58:37,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:58:37,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:58:37,251 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:58:37,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:58:37,295 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/data/7d00ea2ef/b69b3f43d01a43238c72e0a5e043d8b4/FLAG96c002bc7 [2018-11-28 12:58:37,659 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:58:37,660 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:58:37,666 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/data/7d00ea2ef/b69b3f43d01a43238c72e0a5e043d8b4/FLAG96c002bc7 [2018-11-28 12:58:38,064 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/bin-2019/uautomizer/data/7d00ea2ef/b69b3f43d01a43238c72e0a5e043d8b4 [2018-11-28 12:58:38,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:58:38,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:58:38,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:58:38,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:58:38,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:58:38,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be58337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38, skipping insertion in model container [2018-11-28 12:58:38,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:58:38,101 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:58:38,284 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:58:38,292 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:58:38,355 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:58:38,386 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:58:38,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38 WrapperNode [2018-11-28 12:58:38,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:58:38,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:58:38,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:58:38,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:58:38,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:58:38,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:58:38,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:58:38,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:58:38,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... [2018-11-28 12:58:38,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:58:38,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:58:38,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:58:38,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:58:38,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd83dc55-5174-4ef0-b3c1-da93520df5a8/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-28 12:58:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:58:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:58:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:58:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:58:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:58:38,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:58:38,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:58:38,603 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:58:38,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:58:38 BoogieIcfgContainer [2018-11-28 12:58:38,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:58:38,604 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:58:38,604 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:58:38,607 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:58:38,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:58:38,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:58:38" (1/3) ... [2018-11-28 12:58:38,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b81b626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:58:38, skipping insertion in model container [2018-11-28 12:58:38,609 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:58:38,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:38" (2/3) ... [2018-11-28 12:58:38,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b81b626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:58:38, skipping insertion in model container [2018-11-28 12:58:38,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:58:38,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:58:38" (3/3) ... [2018-11-28 12:58:38,611 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:58:38,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:58:38,647 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:58:38,647 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:58:38,647 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:58:38,647 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:58:38,647 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:58:38,647 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:58:38,648 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:58:38,648 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:58:38,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 12:58:38,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:58:38,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:38,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:38,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:58:38,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:58:38,682 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:58:38,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 12:58:38,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:58:38,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:38,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:38,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:58:38,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:58:38,688 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#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; 4#L557true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L557-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; 10#L545-3true [2018-11-28 12:58:38,689 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-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; 5#L548-3true assume !true; 7#L545-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 10#L545-3true [2018-11-28 12:58:38,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 12:58:38,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:38,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-11-28 12:58:38,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:38,797 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-28 12:58:38,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:38,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:58:38,800 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:58:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:58:38,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:58:38,811 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-28 12:58:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:38,815 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-28 12:58:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:58:38,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-28 12:58:38,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:58:38,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-11-28 12:58:38,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 12:58:38,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 12:58:38,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-28 12:58:38,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:58:38,822 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 12:58:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-28 12:58:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-28 12:58:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:58:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-28 12:58:38,839 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 12:58:38,839 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 12:58:38,839 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:58:38,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-28 12:58:38,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:58:38,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:38,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:38,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:58:38,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:58:38,841 INFO L794 eck$LassoCheckResult]: Stem: 38#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#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L557-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; 36#L545-3 [2018-11-28 12:58:38,841 INFO L796 eck$LassoCheckResult]: Loop: 36#L545-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; 37#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 40#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 36#L545-3 [2018-11-28 12:58:38,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 12:58:38,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:38,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:38,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:38,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:38,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-11-28 12:58:38,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:38,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:38,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-11-28 12:58:38,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:38,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:38,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,079 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:58:39,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:58:39,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:58:39,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:58:39,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:58:39,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:39,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:58:39,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:58:39,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 12:58:39,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:58:39,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:58:39,103 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-28 12:58:39,109 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-28 12:58:39,112 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-28 12:58:39,115 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-28 12:58:39,120 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-28 12:58:39,223 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-28 12:58:39,226 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-28 12:58:39,228 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-28 12:58:39,231 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-28 12:58:39,234 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-28 12:58:39,236 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-28 12:58:39,238 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-28 12:58:39,239 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-28 12:58:39,462 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:58:39,467 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:58:39,469 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-28 12:58:39,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:39,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:39,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:39,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,477 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-28 12:58:39,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:39,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:39,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:39,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,480 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-28 12:58:39,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:39,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:39,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:39,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,486 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-28 12:58:39,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:39,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:39,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,494 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-28 12:58:39,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:39,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:39,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:39,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,498 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-28 12:58:39,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:39,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:39,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,510 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-28 12:58:39,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,512 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:39,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:39,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:39,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,540 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-28 12:58:39,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:39,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:39,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,551 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-28 12:58:39,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:39,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:39,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:39,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:39,558 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-28 12:58:39,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:39,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:39,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:39,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:39,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:39,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:39,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:58:39,641 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 12:58:39,641 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 12:58:39,643 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:58:39,644 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:58:39,645 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:58:39,645 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-28 12:58:39,654 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 12:58:39,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:39,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:39,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:39,705 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-28 12:58:39,707 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-28 12:58:39,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 12:58:39,729 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-28 12:58:39,730 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-28 12:58:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 12:58:39,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 12:58:39,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:39,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 12:58:39,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:39,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 12:58:39,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:39,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-28 12:58:39,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:39,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-28 12:58:39,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 12:58:39,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 12:58:39,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 12:58:39,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:58:39,737 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 12:58:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 12:58:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 12:58:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:58:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 12:58:39,739 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:58:39,739 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:58:39,739 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:58:39,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 12:58:39,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:39,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:39,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:39,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:58:39,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:58:39,741 INFO L794 eck$LassoCheckResult]: Stem: 112#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#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 113#L557-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; 105#L545-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#L548-3 [2018-11-28 12:58:39,741 INFO L796 eck$LassoCheckResult]: Loop: 107#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 109#L548-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~mem5;havoc sumOfThirdBytes_#t~post6; 107#L548-3 [2018-11-28 12:58:39,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 12:58:39,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:39,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:39,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-28 12:58:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 12:58:39,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:39,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:39,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:39,929 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-11-28 12:58:39,975 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:58:39,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:58:39,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:58:39,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:58:39,976 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:58:39,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:39,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:58:39,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:58:39,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-28 12:58:39,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:58:39,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:58:39,980 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-28 12:58:39,982 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-28 12:58:39,984 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-28 12:58:39,985 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-28 12:58:39,987 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-28 12:58:39,989 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-28 12:58:39,990 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-28 12:58:39,991 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-28 12:58:39,993 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-28 12:58:39,995 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-28 12:58:40,098 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-28 12:58:40,101 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-28 12:58:40,103 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-28 12:58:40,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:58:40,312 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:58:40,312 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-28 12:58:40,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,315 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-28 12:58:40,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,317 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-28 12:58:40,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,319 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-28 12:58:40,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:40,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:40,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,324 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-28 12:58:40,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,326 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-28 12:58:40,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,328 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-28 12:58:40,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,331 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-28 12:58:40,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:40,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:40,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,335 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-28 12:58:40,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:40,337 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-28 12:58:40,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:40,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:40,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:40,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:40,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:40,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:40,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:40,340 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:58:40,341 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:58:40,341 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:58:40,342 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:58:40,342 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:58:40,342 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:58:40,342 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-28 12:58:40,367 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 12:58:40,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:58:40,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:40,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:40,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:40,404 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-28 12:58:40,404 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-28 12:58:40,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:58:40,419 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-28 12:58:40,420 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-28 12:58:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 12:58:40,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:58:40,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:40,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 12:58:40,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:40,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 12:58:40,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:40,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-11-28 12:58:40,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:40,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2018-11-28 12:58:40,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 12:58:40,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:58:40,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-28 12:58:40,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:58:40,424 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 12:58:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-28 12:58:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-28 12:58:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 12:58:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-28 12:58:40,425 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 12:58:40,425 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 12:58:40,425 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:58:40,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-28 12:58:40,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:40,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:40,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:40,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:40,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:58:40,427 INFO L794 eck$LassoCheckResult]: Stem: 200#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#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L557-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; 195#L545-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; 196#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 206#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 205#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 197#L545-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; 199#L548-3 [2018-11-28 12:58:40,427 INFO L796 eck$LassoCheckResult]: Loop: 199#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 201#L548-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~mem5;havoc sumOfThirdBytes_#t~post6; 199#L548-3 [2018-11-28 12:58:40,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-11-28 12:58:40,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:40,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:40,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:40,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-28 12:58:40,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:40,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:40,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:40,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:40,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:40,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-11-28 12:58:40,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:40,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:40,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:40,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:40,657 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-28 12:58:40,695 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:58:40,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:58:40,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:58:40,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:58:40,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:58:40,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:40,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:58:40,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:58:40,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 12:58:40,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:58:40,696 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:58:40,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-28 12:58:40,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-28 12:58:40,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-28 12:58:40,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-28 12:58:40,704 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-28 12:58:40,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-28 12:58:40,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-28 12:58:40,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-28 12:58:40,790 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-28 12:58:40,800 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-28 12:58:40,802 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-28 12:58:40,804 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-28 12:58:40,806 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-28 12:58:41,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:58:41,026 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:58:41,027 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-28 12:58:41,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:41,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:41,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:41,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,028 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-28 12:58:41,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:41,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:41,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,031 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-28 12:58:41,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:41,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:41,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:41,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,034 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-28 12:58:41,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:41,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:41,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,041 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-28 12:58:41,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:41,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:41,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:41,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,043 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-28 12:58:41,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:41,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:41,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:41,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,045 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-28 12:58:41,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:41,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:41,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:41,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,048 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-28 12:58:41,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:41,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:41,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,054 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-28 12:58:41,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:41,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:41,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:41,071 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-28 12:58:41,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:41,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:41,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:41,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:41,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:41,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:41,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:41,074 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:58:41,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:58:41,075 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:58:41,076 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:58:41,076 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:58:41,076 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:58:41,076 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-28 12:58:41,101 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 12:58:41,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:58:41,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:41,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:41,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:41,137 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-28 12:58:41,138 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-28 12:58:41,138 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:58:41,155 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-28 12:58:41,156 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-28 12:58:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 12:58:41,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 12:58:41,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:41,157 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:58:41,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:41,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:41,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:41,195 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-28 12:58:41,195 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-28 12:58:41,195 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:58:41,205 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-28 12:58:41,205 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-28 12:58:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 12:58:41,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 12:58:41,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:41,206 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:58:41,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:41,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:41,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:41,237 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-28 12:58:41,237 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-28 12:58:41,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:58:41,252 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-28 12:58:41,252 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-28 12:58:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 12:58:41,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 12:58:41,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:41,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 12:58:41,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:41,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 12:58:41,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:41,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-28 12:58:41,255 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:58:41,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-11-28 12:58:41,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:58:41,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:58:41,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:58:41,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:58:41,256 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:58:41,256 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:58:41,256 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:58:41,256 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:58:41,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:58:41,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:58:41,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:58:41,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:58:41 BoogieIcfgContainer [2018-11-28 12:58:41,261 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:58:41,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:58:41,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:58:41,262 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:58:41,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:58:38" (3/4) ... [2018-11-28 12:58:41,264 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:58:41,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:58:41,265 INFO L168 Benchmark]: Toolchain (without parser) took 3197.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.5 MB in the beginning and 879.0 MB in the end (delta: 70.5 MB). Peak memory consumption was 212.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:41,266 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:58:41,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:41,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:41,267 INFO L168 Benchmark]: Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:58:41,267 INFO L168 Benchmark]: RCFGBuilder took 170.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:41,267 INFO L168 Benchmark]: BuchiAutomizer took 2657.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 232.8 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:41,267 INFO L168 Benchmark]: Witness Printer took 3.01 ms. Allocated memory is still 1.2 GB. Free memory is still 879.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:58:41,269 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2657.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 232.8 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.01 ms. Allocated memory is still 1.2 GB. Free memory is still 879.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. 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: inital131 mio100 ax100 hnf98 lsp90 ukn83 mio100 lsp59 div100 bol100 ite100 ukn100 eq188 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms 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...