./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex4.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex4.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 531407ed3b7c40d8a6107454133dd490b91ef528 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:18,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:18,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:18,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:18,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:18,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:18,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:18,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:18,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:18,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:18,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:18,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:18,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:18,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:18,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:18,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:18,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:18,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:18,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:18,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:18,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:18,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:18,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:18,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:18,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:18,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:18,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:18,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:18,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:18,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:18,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:18,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:18,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:18,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:18,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:18,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:18,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:18,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:18,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:18,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:18,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:18,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:18,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:18,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:18,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:18,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:18,400 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:18,400 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:18,400 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:18,400 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:18,400 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:18,401 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:18,401 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:18,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:18,402 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:18,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:18,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:18,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:18,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:18,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:18,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:18,403 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:18,404 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:18,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:18,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:18,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:18,405 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:18,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:18,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:18,405 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:18,406 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:18,408 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 531407ed3b7c40d8a6107454133dd490b91ef528 [2019-10-22 08:58:18,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:18,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:18,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:18,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:18,456 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:18,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex4.i [2019-10-22 08:58:18,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/data/23d057f65/a6ae68cf249a43a58a9352b59e88b0fe/FLAG45fada0cd [2019-10-22 08:58:18,923 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:18,923 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex4.i [2019-10-22 08:58:18,929 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/data/23d057f65/a6ae68cf249a43a58a9352b59e88b0fe/FLAG45fada0cd [2019-10-22 08:58:18,945 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/uautomizer/data/23d057f65/a6ae68cf249a43a58a9352b59e88b0fe [2019-10-22 08:58:18,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:18,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:18,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:18,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:18,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:18,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33592c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18, skipping insertion in model container [2019-10-22 08:58:18,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:18,987 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:19,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:19,173 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:19,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:19,293 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:19,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19 WrapperNode [2019-10-22 08:58:19,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:19,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:19,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:19,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:19,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:19,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:19,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:19,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:19,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... [2019-10-22 08:58:19,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:19,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:19,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:19,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:19,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ff53584-7625-41ae-8d9e-f11b8d0f91e5/bin/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 [2019-10-22 08:58:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-10-22 08:58:19,443 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-10-22 08:58:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-10-22 08:58:19,444 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-10-22 08:58:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:19,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:19,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:19,839 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:58:19,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:19 BoogieIcfgContainer [2019-10-22 08:58:19,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:19,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:19,842 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:19,846 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:19,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:19,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:18" (1/3) ... [2019-10-22 08:58:19,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@271af919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:19, skipping insertion in model container [2019-10-22 08:58:19,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:19,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:19" (2/3) ... [2019-10-22 08:58:19,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@271af919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:19, skipping insertion in model container [2019-10-22 08:58:19,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:19,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:19" (3/3) ... [2019-10-22 08:58:19,851 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex4.i [2019-10-22 08:58:19,908 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:19,909 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:19,909 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:19,909 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:19,910 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:19,910 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:19,910 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:19,910 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:19,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:58:19,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:58:19,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:19,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:19,973 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:58:19,974 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,974 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:19,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:58:19,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:58:19,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:19,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:19,976 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:58:19,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,985 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(main_#t~nondet11, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet12; 6#L50true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 13#fENTRYtrue [2019-10-22 08:58:19,986 INFO L793 eck$LassoCheckResult]: Loop: 13#fENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);call #t~mem2 := read~int(~q.base, ~q.offset, 4); 15#L13true assume !(#t~mem1 + #t~mem2 < 0);havoc #t~mem2;havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~np~0.base, ~np~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);call write~int(#t~mem4 - 1, ~np~0.base, ~np~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~p.base, ~p.offset); 18#L23true call g(~q.base, ~q.offset, ~np~0.base, ~np~0.offset);< 12#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);call #t~mem6 := read~int(~q.base, ~q.offset, 4); 7#L31true assume !(#t~mem5 + #t~mem6 < 0);havoc #t~mem6;havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 16#L36true call f(~p.base, ~p.offset, ~q.base, ~q.offset);< 13#fENTRYtrue [2019-10-22 08:58:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash 43766, now seen corresponding path program 1 times [2019-10-22 08:58:20,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812037431] [2019-10-22 08:58:20,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash 891830467, now seen corresponding path program 1 times [2019-10-22 08:58:20,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753426057] [2019-10-22 08:58:20,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,284 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1193795592, now seen corresponding path program 1 times [2019-10-22 08:58:20,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622610499] [2019-10-22 08:58:20,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,429 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:21,008 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-10-22 08:58:21,638 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-10-22 08:58:21,941 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-10-22 08:58:22,200 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:22,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:22,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:22,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:22,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:22,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:22,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:22,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:22,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex4.i_Iteration1_Lasso [2019-10-22 08:58:22,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:22,203 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:22,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,491 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-22 08:58:22,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:23,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:23,040 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:23,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,054 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,062 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,062 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,067 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,089 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,090 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,090 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,095 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,102 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,111 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,124 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,142 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,143 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,180 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:23,205 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:23,206 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:23,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:23,215 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:23,215 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:23,216 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1, v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1 + 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2019-10-22 08:58:23,235 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 08:58:23,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:23,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:23,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-22 08:58:23,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:23,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:23,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 08:58:23,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:23,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:23,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:23,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2019-10-22 08:58:23,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:23,495 INFO L567 ElimStorePlain]: treesize reduction 42, result has 56.3 percent of original size [2019-10-22 08:58:23,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:23,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2019-10-22 08:58:23,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2019-10-22 08:58:23,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:23,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:23,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:23,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2019-10-22 08:58:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:23,630 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-10-22 08:58:23,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 7 states. [2019-10-22 08:58:23,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 7 states. Result 46 states and 52 transitions. Complement of second has 22 states. [2019-10-22 08:58:23,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:58:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-10-22 08:58:23,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 08:58:23,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:23,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:58:23,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:23,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-10-22 08:58:23,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:23,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2019-10-22 08:58:23,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:23,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-10-22 08:58:23,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:23,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:23,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:23,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:23,841 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:23,841 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:23,842 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:23,842 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:23,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:23,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:23,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:23,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:23 BoogieIcfgContainer [2019-10-22 08:58:23,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:23,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:23,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:23,849 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:23,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:19" (3/4) ... [2019-10-22 08:58:23,853 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:23,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:23,854 INFO L168 Benchmark]: Toolchain (without parser) took 4905.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 949.9 MB in the beginning and 1.0 GB in the end (delta: -53.9 MB). Peak memory consumption was 183.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,854 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:23,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -215.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.66 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. [2019-10-22 08:58:23,856 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,856 INFO L168 Benchmark]: RCFGBuilder took 471.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,857 INFO L168 Benchmark]: BuchiAutomizer took 4006.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 135.4 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,857 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:23,860 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -215.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.66 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 31.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 471.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4006.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 135.4 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] + unknown-#memory_int-unknown[q][q] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 10 SDslu, 22 SDs, 0 SdLazy, 76 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital296 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp38 div100 bol100 ite100 ukn100 eq161 hnf90 smp96 dnf108 smp93 tf100 neg98 sie132 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...