./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/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 f2969d4725852fd68e7759cdb7f1d1929ca0124c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:16,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:16,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:16,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:16,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:16,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:16,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:16,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:16,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:16,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:16,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:16,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:16,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:16,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:16,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:16,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:16,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:16,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:16,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:16,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:16,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:16,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:16,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:16,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:16,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:16,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:16,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:16,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:16,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:16,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:16,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:16,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:16,715 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:16,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:16,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:16,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:16,717 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:12:16,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:16,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:16,734 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:16,735 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:16,735 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:16,735 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:16,735 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:16,735 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:16,735 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:16,735 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:16,736 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:16,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:16,737 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:16,737 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:16,737 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:12:16,737 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:16,737 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:16,737 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:16,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:16,738 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:16,738 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:16,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:16,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:16,738 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:16,739 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:16,739 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_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/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 -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2018-10-27 06:12:16,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:16,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:16,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:16,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:16,793 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:16,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-10-27 06:12:16,838 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/data/b3293788d/fafea3f361424ceeb96fdb2498e6515c/FLAG032f8fd26 [2018-10-27 06:12:17,199 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:17,200 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-10-27 06:12:17,208 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/data/b3293788d/fafea3f361424ceeb96fdb2498e6515c/FLAG032f8fd26 [2018-10-27 06:12:17,220 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/data/b3293788d/fafea3f361424ceeb96fdb2498e6515c [2018-10-27 06:12:17,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:17,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:17,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:17,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:17,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:17,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1699ef1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17, skipping insertion in model container [2018-10-27 06:12:17,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:17,262 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:17,415 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:17,422 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:17,459 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:17,474 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:17,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17 WrapperNode [2018-10-27 06:12:17,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:17,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:17,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:17,476 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:17,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:17,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:17,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:17,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:17,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... [2018-10-27 06:12:17,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:17,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:17,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:17,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:17,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/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-10-27 06:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:18,368 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:18,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:18 BoogieIcfgContainer [2018-10-27 06:12:18,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:18,369 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:18,369 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:18,372 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:18,373 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:18,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:17" (1/3) ... [2018-10-27 06:12:18,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72306e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:18, skipping insertion in model container [2018-10-27 06:12:18,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:18,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:17" (2/3) ... [2018-10-27 06:12:18,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72306e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:18, skipping insertion in model container [2018-10-27 06:12:18,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:18,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:18" (3/3) ... [2018-10-27 06:12:18,377 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-10-27 06:12:18,426 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:18,426 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:18,427 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:18,427 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:18,427 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:18,427 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:18,427 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:18,427 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:18,427 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:18,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-10-27 06:12:18,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-10-27 06:12:18,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:18,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:18,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:18,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:18,474 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:18,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-10-27 06:12:18,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-10-27 06:12:18,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:18,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:18,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:18,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:18,486 INFO L793 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 51#L202true assume !(~r1~0 == 0);init_~tmp~0 := 0; 30#L202-1true init_#res := init_~tmp~0; 24#L271true main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 26#L326-3true [2018-10-27 06:12:18,487 INFO L795 eck$LassoCheckResult]: Loop: 26#L326-3true assume true; 39#L326-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 5#L102true assume !(~mode1~0 % 256 != 0); 19#L120true assume !(~alive1~0 % 256 != 0); 15#L120-2true ~mode1~0 := 1; 23#L102-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 64#L134true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 50#L137true assume !(node2_~m2~0 != ~nomsg~0); 48#L137-1true ~mode2~0 := 0; 76#L134-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 8#L168true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 14#L171true assume !(node3_~m3~0 != ~nomsg~0); 13#L171-1true ~mode3~0 := 0; 6#L168-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 56#L279true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 54#L279-1true check_#res := check_~tmp~1; 74#L291true main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 67#L350true assume !(assert_~arg % 256 == 0); 43#L345true assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 26#L326-3true [2018-10-27 06:12:18,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2018-10-27 06:12:18,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:18,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:18,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:18,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:18,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:18,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:18,773 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:18,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1943322965, now seen corresponding path program 1 times [2018-10-27 06:12:18,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:18,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:18,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:18,904 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:18,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:12:18,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:12:18,921 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2018-10-27 06:12:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:19,047 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-10-27 06:12:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:19,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 120 transitions. [2018-10-27 06:12:19,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-10-27 06:12:19,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 69 states and 97 transitions. [2018-10-27 06:12:19,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-10-27 06:12:19,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-10-27 06:12:19,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 97 transitions. [2018-10-27 06:12:19,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:19,060 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 97 transitions. [2018-10-27 06:12:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 97 transitions. [2018-10-27 06:12:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-27 06:12:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 06:12:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2018-10-27 06:12:19,089 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 97 transitions. [2018-10-27 06:12:19,090 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 97 transitions. [2018-10-27 06:12:19,090 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:19,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 97 transitions. [2018-10-27 06:12:19,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-10-27 06:12:19,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:19,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:19,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:19,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:19,093 INFO L793 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 182#L202 assume ~r1~0 == 0; 222#L203 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 189#L204 assume ~id1~0 >= 0; 190#L205 assume ~st1~0 == 0; 210#L206 assume ~send1~0 == ~id1~0; 229#L207 assume ~mode1~0 % 256 == 0; 167#L208 assume ~id2~0 >= 0; 168#L209 assume ~st2~0 == 0; 204#L210 assume ~send2~0 == ~id2~0; 220#L211 assume ~mode2~0 % 256 == 0; 179#L212 assume ~id3~0 >= 0; 180#L213 assume ~st3~0 == 0; 223#L214 assume ~send3~0 == ~id3~0; 191#L215 assume ~mode3~0 % 256 == 0; 192#L216 assume ~id1~0 != ~id2~0; 212#L217 assume ~id1~0 != ~id3~0; 230#L218 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 205#L202-1 init_#res := init_~tmp~0; 197#L271 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 198#L326-3 [2018-10-27 06:12:19,093 INFO L795 eck$LassoCheckResult]: Loop: 198#L326-3 assume true; 203#L326-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 171#L102 assume !(~mode1~0 % 256 != 0); 172#L120 assume !(~alive1~0 % 256 != 0); 188#L120-2 ~mode1~0 := 1; 178#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 196#L134 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 221#L137 assume !(node2_~m2~0 != ~nomsg~0); 184#L137-1 ~mode2~0 := 0; 211#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 174#L168 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 175#L171 assume !(node3_~m3~0 != ~nomsg~0); 186#L171-1 ~mode3~0 := 0; 169#L168-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 170#L279 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 217#L279-1 check_#res := check_~tmp~1; 225#L291 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 232#L350 assume !(assert_~arg % 256 == 0); 214#L345 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 198#L326-3 [2018-10-27 06:12:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2018-10-27 06:12:19,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:19,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1943322965, now seen corresponding path program 2 times [2018-10-27 06:12:19,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:19,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:19,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:19,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:19,276 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:12:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:19,276 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. cyclomatic complexity: 29 Second operand 5 states. [2018-10-27 06:12:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:19,438 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2018-10-27 06:12:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:12:19,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 99 transitions. [2018-10-27 06:12:19,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-10-27 06:12:19,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 69 states and 95 transitions. [2018-10-27 06:12:19,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-10-27 06:12:19,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-10-27 06:12:19,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 95 transitions. [2018-10-27 06:12:19,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:19,443 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-10-27 06:12:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 95 transitions. [2018-10-27 06:12:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-27 06:12:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 06:12:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2018-10-27 06:12:19,448 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-10-27 06:12:19,448 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-10-27 06:12:19,448 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:19,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 95 transitions. [2018-10-27 06:12:19,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-10-27 06:12:19,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:19,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:19,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:19,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:19,451 INFO L793 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 335#L202 assume ~r1~0 == 0; 375#L203 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 342#L204 assume ~id1~0 >= 0; 343#L205 assume ~st1~0 == 0; 363#L206 assume ~send1~0 == ~id1~0; 382#L207 assume ~mode1~0 % 256 == 0; 320#L208 assume ~id2~0 >= 0; 321#L209 assume ~st2~0 == 0; 357#L210 assume ~send2~0 == ~id2~0; 373#L211 assume ~mode2~0 % 256 == 0; 332#L212 assume ~id3~0 >= 0; 333#L213 assume ~st3~0 == 0; 376#L214 assume ~send3~0 == ~id3~0; 344#L215 assume ~mode3~0 % 256 == 0; 345#L216 assume ~id1~0 != ~id2~0; 364#L217 assume ~id1~0 != ~id3~0; 383#L218 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 358#L202-1 init_#res := init_~tmp~0; 350#L271 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 351#L326-3 [2018-10-27 06:12:19,451 INFO L795 eck$LassoCheckResult]: Loop: 351#L326-3 assume true; 355#L326-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 322#L102 assume !(~mode1~0 % 256 != 0); 323#L120 assume !(~alive1~0 % 256 != 0); 341#L120-2 ~mode1~0 := 1; 331#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 349#L134 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 374#L137 assume !(node2_~m2~0 != ~nomsg~0); 337#L137-1 ~mode2~0 := 0; 365#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 327#L168 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 328#L171 assume !(node3_~m3~0 != ~nomsg~0); 339#L171-1 ~mode3~0 := 0; 325#L168-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 326#L279 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 381#L280 assume ~r1~0 < 3;check_~tmp~1 := 1; 370#L279-1 check_#res := check_~tmp~1; 378#L291 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 385#L350 assume !(assert_~arg % 256 == 0); 367#L345 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 351#L326-3 [2018-10-27 06:12:19,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2018-10-27 06:12:19,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:19,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:19,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,508 INFO L82 PathProgramCache]: Analyzing trace with hash -496797049, now seen corresponding path program 1 times [2018-10-27 06:12:19,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:19,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:19,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:19,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:19,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,530 INFO L82 PathProgramCache]: Analyzing trace with hash 391073378, now seen corresponding path program 1 times [2018-10-27 06:12:19,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:19,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:19,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:20,378 WARN L179 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-10-27 06:12:20,744 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2018-10-27 06:12:20,753 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:20,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:20,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:20,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:20,755 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:12:20,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:20,755 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:20,755 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:20,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:12:20,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:20,755 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:20,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:20,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-10-27 06:12:21,238 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:21,239 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:21,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:12:21,245 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_397f31dd-a7b3-4f50-8c22-d9b2e2375a24/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:21,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:12:21,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:12:21,452 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:12:21,453 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:21,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:21,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:21,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:21,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:21,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:21,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:21,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:21,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:12:21,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:21,454 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:21,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,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-10-27 06:12:21,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:21,668 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 06:12:22,113 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:22,118 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:22,119 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-10-27 06:12:22,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,131 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-10-27 06:12:22,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,139 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-10-27 06:12:22,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:22,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:22,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,147 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-10-27 06:12:22,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,152 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-10-27 06:12:22,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,155 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-10-27 06:12:22,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:22,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:22,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,167 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-10-27 06:12:22,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,172 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-10-27 06:12:22,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,175 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-10-27 06:12:22,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:22,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:22,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,186 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-10-27 06:12:22,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,191 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-10-27 06:12:22,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,195 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-10-27 06:12:22,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,205 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-10-27 06:12:22,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:22,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:22,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,218 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-10-27 06:12:22,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,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-10-27 06:12:22,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,223 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-10-27 06:12:22,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,233 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-10-27 06:12:22,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:22,241 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-10-27 06:12:22,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:22,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:22,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:22,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:22,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:22,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:22,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:22,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:22,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:12:22,250 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:12:22,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:22,253 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:12:22,253 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:22,254 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-10-27 06:12:22,255 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:12:22,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:22,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:22,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:22,403 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-10-27 06:12:22,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 95 transitions. cyclomatic complexity: 27 Second operand 4 states. [2018-10-27 06:12:22,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 95 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 117 states and 170 transitions. Complement of second has 6 states. [2018-10-27 06:12:22,454 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-10-27 06:12:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-10-27 06:12:22,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 21 letters. Loop has 20 letters. [2018-10-27 06:12:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:22,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 41 letters. Loop has 20 letters. [2018-10-27 06:12:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:22,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 21 letters. Loop has 40 letters. [2018-10-27 06:12:22,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:22,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 170 transitions. [2018-10-27 06:12:22,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:22,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2018-10-27 06:12:22,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:22,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:22,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:22,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:22,462 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:22,463 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:22,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:22,463 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-10-27 06:12:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:22,463 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-10-27 06:12:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:12:22,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-10-27 06:12:22,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:22,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:12:22,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:22,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:22,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:22,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:22,464 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:22,468 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:22,468 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:22,468 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:22,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:22,469 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:22,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:22,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:22 BoogieIcfgContainer [2018-10-27 06:12:22,474 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:22,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:22,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:22,475 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:22,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:18" (3/4) ... [2018-10-27 06:12:22,478 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:22,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:22,479 INFO L168 Benchmark]: Toolchain (without parser) took 5256.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 958.5 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:22,480 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:22,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.25 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 942.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:22,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.28 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:22,483 INFO L168 Benchmark]: Boogie Preprocessor took 110.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:22,483 INFO L168 Benchmark]: RCFGBuilder took 727.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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:22,484 INFO L168 Benchmark]: BuchiAutomizer took 4105.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:22,484 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:22,487 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.25 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 942.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.28 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 727.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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4105.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 306 SDtfs, 96 SDslu, 567 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax136 hnf108 lsp23 ukn100 mio100 lsp100 div142 bol100 ite100 ukn100 eq158 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...