./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/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_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/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-5842f4b [2018-11-18 08:59:40,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:59:40,949 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:59:40,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:59:40,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:59:40,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:59:40,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:59:40,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:59:40,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:59:40,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:59:40,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:59:40,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:59:40,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:59:40,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:59:40,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:59:40,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:59:40,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:59:40,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:59:40,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:59:40,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:59:40,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:59:40,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:59:40,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:59:40,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:59:40,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:59:40,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:59:40,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:59:40,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:59:40,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:59:40,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:59:40,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:59:40,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:59:40,975 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:59:40,975 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:59:40,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:59:40,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:59:40,976 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:59:40,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:59:40,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:59:40,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:59:40,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:59:40,988 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:59:40,988 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:59:40,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:59:40,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:59:40,990 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:59:40,991 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:59:40,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:59:40,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:59:40,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:59:40,991 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:59:40,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:59:40,991 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:59:40,991 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:59:40,992 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:59:40,992 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_ee5faf22-7034-48ae-a544-288a8e3abdd3/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-18 08:59:41,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:59:41,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:59:41,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:59:41,029 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:59:41,029 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:59:41,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:59:41,074 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/data/f56670218/81560b565c4e4036979bb8e5c9c7a7bd/FLAG3cf944f0a [2018-11-18 08:59:41,511 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:59:41,511 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:59:41,518 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/data/f56670218/81560b565c4e4036979bb8e5c9c7a7bd/FLAG3cf944f0a [2018-11-18 08:59:41,527 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/bin-2019/uautomizer/data/f56670218/81560b565c4e4036979bb8e5c9c7a7bd [2018-11-18 08:59:41,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:59:41,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:59:41,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:59:41,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:59:41,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:59:41,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709bd6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41, skipping insertion in model container [2018-11-18 08:59:41,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:59:41,573 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:59:41,754 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:59:41,762 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:59:41,790 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:59:41,862 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:59:41,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41 WrapperNode [2018-11-18 08:59:41,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:59:41,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:59:41,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:59:41,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:59:41,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:59:41,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:59:41,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:59:41,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:59:41,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... [2018-11-18 08:59:41,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:59:41,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:59:41,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:59:41,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:59:41,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5faf22-7034-48ae-a544-288a8e3abdd3/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-18 08:59:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:59:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:59:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:59:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:59:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:59:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:59:42,069 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:59:42,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:59:42 BoogieIcfgContainer [2018-11-18 08:59:42,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:59:42,070 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:59:42,070 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:59:42,072 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:59:42,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:59:42,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:59:41" (1/3) ... [2018-11-18 08:59:42,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c6ab775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:59:42, skipping insertion in model container [2018-11-18 08:59:42,074 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:59:42,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:41" (2/3) ... [2018-11-18 08:59:42,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c6ab775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:59:42, skipping insertion in model container [2018-11-18 08:59:42,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:59:42,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:59:42" (3/3) ... [2018-11-18 08:59:42,077 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:59:42,119 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:59:42,120 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:59:42,120 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:59:42,120 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:59:42,120 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:59:42,120 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:59:42,120 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:59:42,121 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:59:42,121 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:59:42,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 08:59:42,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 08:59:42,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:59:42,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:59:42,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:59:42,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:59:42,151 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:59:42,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 08:59:42,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 08:59:42,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:59:42,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:59:42,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:59:42,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:59:42,160 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_sumOfThirdBytes } true;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; 13#L545-4true [2018-11-18 08:59:42,160 INFO L796 eck$LassoCheckResult]: Loop: 13#L545-4true assume true; 7#L545-1true 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; 8#L548-4true assume !true; 11#L545-3true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 13#L545-4true [2018-11-18 08:59:42,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 08:59:42,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:42,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1329096, now seen corresponding path program 1 times [2018-11-18 08:59:42,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:42,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:42,260 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-18 08:59:42,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:59:42,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:59:42,264 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:59:42,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:59:42,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:59:42,275 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-18 08:59:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:59:42,280 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-18 08:59:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:59:42,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-18 08:59:42,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 08:59:42,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 12 transitions. [2018-11-18 08:59:42,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:59:42,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 08:59:42,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-18 08:59:42,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:59:42,288 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-18 08:59:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-18 08:59:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-18 08:59:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 08:59:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-18 08:59:42,309 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-18 08:59:42,309 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-18 08:59:42,310 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:59:42,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-18 08:59:42,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 08:59:42,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:59:42,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:59:42,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:59:42,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:59:42,311 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 39#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 45#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;assume { :begin_inline_sumOfThirdBytes } true;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; 41#L545-4 [2018-11-18 08:59:42,311 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-4 assume true; 46#L545-1 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; 47#L548-4 assume true; 42#L548-1 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 43#L548-2 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 40#L545-3 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 41#L545-4 [2018-11-18 08:59:42,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 08:59:42,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:42,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1276985358, now seen corresponding path program 1 times [2018-11-18 08:59:42,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:59:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042318, now seen corresponding path program 1 times [2018-11-18 08:59:42,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:42,533 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:59:42,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:59:42,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:59:42,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:59:42,534 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:59:42,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:59:42,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:59:42,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:59:42,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 08:59:42,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:59:42,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:59:42,551 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-18 08:59:42,555 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-18 08:59:42,557 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-18 08:59:42,561 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-18 08:59:42,565 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-18 08:59:42,628 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-18 08:59:42,631 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-18 08:59:42,634 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-18 08:59:42,657 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-18 08:59:42,660 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-18 08:59:42,662 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-18 08:59:42,664 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-18 08:59:42,673 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-18 08:59:42,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:59:42,872 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:59:42,874 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-18 08:59:42,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:42,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:42,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:42,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,882 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-18 08:59:42,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:42,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:42,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:42,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,884 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-18 08:59:42,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:42,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:42,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:42,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,887 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-18 08:59:42,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:42,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:42,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,893 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-18 08:59:42,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:42,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:42,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:42,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,896 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-18 08:59:42,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:42,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:42,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,902 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-18 08:59:42,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,903 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:59:42,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,908 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:59:42,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:42,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,925 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-18 08:59:42,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:42,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:42,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:42,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,930 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-18 08:59:42,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:42,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:42,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:42,935 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-18 08:59:42,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:42,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:42,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:42,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:42,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:42,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:42,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:59:43,008 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 08:59:43,008 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:59:43,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:59:43,012 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:59:43,012 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:59:43,012 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-18 08:59:43,017 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 08:59:43,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:43,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:43,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:43,079 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-18 08:59:43,081 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-18 08:59:43,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 08:59:43,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 20 transitions. Complement of second has 6 states. [2018-11-18 08:59:43,102 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-18 08:59:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:59:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-18 08:59:43,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 08:59:43,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:43,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-18 08:59:43,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:43,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-18 08:59:43,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:43,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-18 08:59:43,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:59:43,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-11-18 08:59:43,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:59:43,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:59:43,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-18 08:59:43,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:59:43,108 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 08:59:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-18 08:59:43,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 08:59:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 08:59:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-18 08:59:43,109 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 08:59:43,109 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 08:59:43,110 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:59:43,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-18 08:59:43,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:59:43,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:59:43,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:59:43,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:59:43,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:59:43,111 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 121#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 122#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 130#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;assume { :begin_inline_sumOfThirdBytes } true;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; 131#L545-4 assume true; 133#L545-1 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; 134#L548-4 [2018-11-18 08:59:43,111 INFO L796 eck$LassoCheckResult]: Loop: 134#L548-4 assume true; 125#L548-1 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 126#L548-2 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; 134#L548-4 [2018-11-18 08:59:43,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 08:59:43,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:43,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash 51706, now seen corresponding path program 1 times [2018-11-18 08:59:43,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:43,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924625, now seen corresponding path program 1 times [2018-11-18 08:59:43,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,304 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:59:43,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:59:43,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:59:43,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:59:43,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:59:43,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:59:43,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:59:43,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:59:43,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 08:59:43,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:59:43,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:59:43,307 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-18 08:59:43,395 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-18 08:59:43,396 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-18 08:59:43,397 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-18 08:59:43,398 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-18 08:59:43,399 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-18 08:59:43,401 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-18 08:59:43,402 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-18 08:59:43,404 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-18 08:59:43,406 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-18 08:59:43,407 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-18 08:59:43,410 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-18 08:59:43,411 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-18 08:59:43,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:59:43,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:59:43,560 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-18 08:59:43,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:43,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:43,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:43,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:43,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:43,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:43,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:43,578 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-18 08:59:43,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:43,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:43,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:43,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:43,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:43,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:43,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:43,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:59:43,583 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:59:43,583 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:59:43,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:59:43,583 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:59:43,584 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:59:43,584 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-18 08:59:43,589 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 08:59:43,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:59:43,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:43,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:43,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:43,656 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-18 08:59:43,656 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-18 08:59:43,656 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 08:59:43,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 36 states and 43 transitions. Complement of second has 7 states. [2018-11-18 08:59:43,674 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-18 08:59:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:59:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-18 08:59:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 08:59:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 08:59:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 08:59:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:43,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-11-18 08:59:43,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:59:43,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 25 states and 30 transitions. [2018-11-18 08:59:43,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:59:43,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 08:59:43,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-18 08:59:43,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:59:43,677 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 08:59:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-18 08:59:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-18 08:59:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 08:59:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 08:59:43,680 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 08:59:43,680 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 08:59:43,680 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:59:43,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-18 08:59:43,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:59:43,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:59:43,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:59:43,681 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:59:43,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:59:43,682 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 236#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 248#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;assume { :begin_inline_sumOfThirdBytes } true;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; 244#L545-4 assume true; 245#L545-1 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; 251#L548-4 assume true; 241#L548-1 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 242#L548-2 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 237#L545-3 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 238#L545-4 assume true; 247#L545-1 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; 249#L548-4 [2018-11-18 08:59:43,682 INFO L796 eck$LassoCheckResult]: Loop: 249#L548-4 assume true; 239#L548-1 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 240#L548-2 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; 249#L548-4 [2018-11-18 08:59:43,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 574583319, now seen corresponding path program 2 times [2018-11-18 08:59:43,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:43,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:59:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash 51706, now seen corresponding path program 2 times [2018-11-18 08:59:43,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:43,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:43,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:59:43,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1967003684, now seen corresponding path program 1 times [2018-11-18 08:59:43,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:59:43,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:59:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:59:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:59:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:59:43,875 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2018-11-18 08:59:43,921 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:59:43,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:59:43,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:59:43,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:59:43,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:59:43,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:59:43,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:59:43,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:59:43,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 08:59:43,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:59:43,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:59:43,924 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-18 08:59:43,926 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-18 08:59:43,927 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-18 08:59:43,928 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-18 08:59:43,930 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-18 08:59:43,931 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-18 08:59:43,932 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-18 08:59:44,012 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-18 08:59:44,013 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-18 08:59:44,014 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-18 08:59:44,016 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-18 08:59:44,018 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-18 08:59:44,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:59:44,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:59:44,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:59:44,198 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-18 08:59:44,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:44,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:44,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:44,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,200 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-18 08:59:44,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:44,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:44,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,204 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-18 08:59:44,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:44,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:44,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:44,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,206 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-18 08:59:44,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:44,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:44,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,212 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-18 08:59:44,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:44,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:44,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:44,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,213 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-18 08:59:44,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:44,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:44,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:44,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,215 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-18 08:59:44,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:44,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:44,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,220 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-18 08:59:44,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:59:44,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:59:44,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:59:44,234 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-18 08:59:44,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:59:44,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:59:44,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:59:44,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:59:44,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:59:44,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:59:44,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:59:44,236 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:59:44,237 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:59:44,238 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:59:44,238 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:59:44,238 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:59:44,238 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:59:44,238 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-18 08:59:44,258 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-18 08:59:44,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:59:44,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:44,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:44,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:44,285 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-18 08:59:44,285 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-18 08:59:44,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 08:59:44,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 33 states and 38 transitions. Complement of second has 7 states. [2018-11-18 08:59:44,300 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-18 08:59:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:59:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-18 08:59:44,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 08:59:44,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:44,300 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:59:44,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:44,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:44,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:44,338 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-18 08:59:44,339 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-18 08:59:44,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 08:59:44,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 33 states and 38 transitions. Complement of second has 7 states. [2018-11-18 08:59:44,349 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-18 08:59:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:59:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-18 08:59:44,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 08:59:44,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:44,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:59:44,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:59:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:44,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:59:44,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:59:44,379 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-18 08:59:44,379 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-18 08:59:44,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 08:59:44,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 40 transitions. Complement of second has 6 states. [2018-11-18 08:59:44,391 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-18 08:59:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:59:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 08:59:44,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 08:59:44,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:44,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 08:59:44,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:44,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 08:59:44,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:59:44,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-18 08:59:44,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:59:44,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-18 08:59:44,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:59:44,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:59:44,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:59:44,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:59:44,394 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:59:44,394 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:59:44,394 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:59:44,394 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:59:44,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:59:44,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:59:44,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:59:44,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:59:44 BoogieIcfgContainer [2018-11-18 08:59:44,399 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:59:44,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:59:44,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:59:44,399 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:59:44,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:59:42" (3/4) ... [2018-11-18 08:59:44,401 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:59:44,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:59:44,402 INFO L168 Benchmark]: Toolchain (without parser) took 2872.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -69.7 MB). Peak memory consumption was 162.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:59:44,403 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:59:44,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -196.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:59:44,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:59:44,404 INFO L168 Benchmark]: Boogie Preprocessor took 17.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:59:44,404 INFO L168 Benchmark]: RCFGBuilder took 160.03 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.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:59:44,405 INFO L168 Benchmark]: BuchiAutomizer took 2328.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.2 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. [2018-11-18 08:59:44,405 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:59:44,408 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -196.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 160.03 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.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2328.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.2 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. 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 4 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.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 53 SDslu, 27 SDs, 0 SdLazy, 34 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: 21ms 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...