./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.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_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/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 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:07:38,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:07:38,275 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:07:38,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:07:38,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:07:38,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:07:38,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:07:38,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:07:38,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:07:38,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:07:38,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:07:38,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:07:38,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:07:38,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:07:38,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:07:38,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:07:38,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:07:38,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:07:38,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:07:38,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:07:38,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:07:38,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:07:38,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:07:38,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:07:38,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:07:38,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:07:38,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:07:38,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:07:38,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:07:38,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:07:38,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:07:38,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:07:38,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:07:38,300 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:07:38,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:07:38,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:07:38,301 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:07:38,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:07:38,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:07:38,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:07:38,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:07:38,312 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:07:38,312 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:07:38,312 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:07:38,312 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:07:38,312 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:07:38,312 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:07:38,313 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:07:38,313 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:07:38,314 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:07:38,314 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:07:38,315 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:07:38,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:07:38,315 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:07:38,315 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:07:38,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:07:38,316 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_ba17f186-3657-4d44-bbfb-d7fde5b465a0/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 -> 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a [2018-11-10 06:07:38,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:07:38,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:07:38,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:07:38,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:07:38,350 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:07:38,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2018-11-10 06:07:38,385 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/data/21d71dd70/dc48857ef47e43a28b6ea27021f838d9/FLAG0b534a61e [2018-11-10 06:07:38,871 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:07:38,871 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2018-11-10 06:07:38,885 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/data/21d71dd70/dc48857ef47e43a28b6ea27021f838d9/FLAG0b534a61e [2018-11-10 06:07:38,896 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/data/21d71dd70/dc48857ef47e43a28b6ea27021f838d9 [2018-11-10 06:07:38,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:07:38,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:07:38,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:07:38,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:07:38,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:07:38,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:07:38" (1/1) ... [2018-11-10 06:07:38,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ceaa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:38, skipping insertion in model container [2018-11-10 06:07:38,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:07:38" (1/1) ... [2018-11-10 06:07:38,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:07:38,962 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:07:39,288 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:07:39,297 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:07:39,450 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:07:39,482 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:07:39,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39 WrapperNode [2018-11-10 06:07:39,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:07:39,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:07:39,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:07:39,483 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:07:39,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:07:39,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:07:39,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:07:39,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:07:39,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... [2018-11-10 06:07:39,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:07:39,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:07:39,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:07:39,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:07:39,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:07:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:07:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:07:47,651 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:07:47,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:07:47 BoogieIcfgContainer [2018-11-10 06:07:47,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:07:47,652 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:07:47,652 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:07:47,654 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:07:47,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:07:47,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:07:38" (1/3) ... [2018-11-10 06:07:47,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78464d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:07:47, skipping insertion in model container [2018-11-10 06:07:47,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:07:47,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:39" (2/3) ... [2018-11-10 06:07:47,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78464d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:07:47, skipping insertion in model container [2018-11-10 06:07:47,656 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:07:47,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:07:47" (3/3) ... [2018-11-10 06:07:47,657 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2018-11-10 06:07:47,687 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:07:47,688 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:07:47,688 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:07:47,688 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:07:47,688 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:07:47,688 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:07:47,688 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:07:47,688 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:07:47,688 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:07:47,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7318 states. [2018-11-10 06:07:47,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3643 [2018-11-10 06:07:47,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:47,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:47,846 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:47,846 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, 1, 1, 1, 1] [2018-11-10 06:07:47,846 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:07:47,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7318 states. [2018-11-10 06:07:47,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3643 [2018-11-10 06:07:47,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:47,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:47,891 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:47,891 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, 1, 1, 1, 1] [2018-11-10 06:07:47,897 INFO L793 eck$LassoCheckResult]: Stem: 1650#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 30;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string24.base, #t~string24.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string25.base, #t~string25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 21;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string26.base, #t~string26.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 30;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string27.base, #t~string27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string28.base, #t~string28.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 21;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string29.base, #t~string29.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 30;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string33.base, #t~string33.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string34.base, #t~string34.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 25;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string35.base, #t~string35.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 30;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string36.base, #t~string36.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string37.base, #t~string37.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 25;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string38.base, #t~string38.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string123.base, #t~string123.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string125.base, #t~string125.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string125.base,#t~string125.offset + 0 := 91];#memory_int := #memory_int[#t~string125.base,#t~string125.offset + 1 := 95];#memory_int := #memory_int[#t~string125.base,#t~string125.offset + 2 := 93];#memory_int := #memory_int[#t~string125.base,#t~string125.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string127.base, #t~string127.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string127.base,#t~string127.offset + 0 := 91];#memory_int := #memory_int[#t~string127.base,#t~string127.offset + 1 := 93];#memory_int := #memory_int[#t~string127.base,#t~string127.offset + 2 := 32];#memory_int := #memory_int[#t~string127.base,#t~string127.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string129.base, #t~string129.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string129.base,#t~string129.offset + 0 := 32];#memory_int := #memory_int[#t~string129.base,#t~string129.offset + 1 := 97];#memory_int := #memory_int[#t~string129.base,#t~string129.offset + 2 := 116];#memory_int := #memory_int[#t~string129.base,#t~string129.offset + 3 := 32];#memory_int := #memory_int[#t~string129.base,#t~string129.offset + 4 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 3;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string131.base, #t~string131.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string131.base,#t~string131.offset + 0 := 37];#memory_int := #memory_int[#t~string131.base,#t~string131.offset + 1 := 105];#memory_int := #memory_int[#t~string131.base,#t~string131.offset + 2 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string133.base, #t~string133.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 3;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string135.base, #t~string135.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string135.base,#t~string135.offset + 0 := 117];#memory_int := #memory_int[#t~string135.base,#t~string135.offset + 1 := 112];#memory_int := #memory_int[#t~string135.base,#t~string135.offset + 2 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string137.base, #t~string137.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string137.base,#t~string137.offset + 0 := 100];#memory_int := #memory_int[#t~string137.base,#t~string137.offset + 1 := 111];#memory_int := #memory_int[#t~string137.base,#t~string137.offset + 2 := 119];#memory_int := #memory_int[#t~string137.base,#t~string137.offset + 3 := 110];#memory_int := #memory_int[#t~string137.base,#t~string137.offset + 4 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 7;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string139.base, #t~string139.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 0 := 32];#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 1 := 73];#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 2 := 76];#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 3 := 95];#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 4 := 112];#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 5 := 58];#memory_int := #memory_int[#t~string139.base,#t~string139.offset + 6 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string141.base, #t~string141.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string141.base,#t~string141.offset + 0 := 32];#memory_int := #memory_int[#t~string141.base,#t~string141.offset + 1 := 37];#memory_int := #memory_int[#t~string141.base,#t~string141.offset + 2 := 105];#memory_int := #memory_int[#t~string141.base,#t~string141.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string143.base, #t~string143.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string143.base,#t~string143.offset + 0 := 32];#memory_int := #memory_int[#t~string143.base,#t~string143.offset + 1 := 37];#memory_int := #memory_int[#t~string143.base,#t~string143.offset + 2 := 105];#memory_int := #memory_int[#t~string143.base,#t~string143.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string145.base, #t~string145.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string145.base,#t~string145.offset + 0 := 32];#memory_int := #memory_int[#t~string145.base,#t~string145.offset + 1 := 37];#memory_int := #memory_int[#t~string145.base,#t~string145.offset + 2 := 105];#memory_int := #memory_int[#t~string145.base,#t~string145.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string147.base, #t~string147.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string147.base,#t~string147.offset + 0 := 32];#memory_int := #memory_int[#t~string147.base,#t~string147.offset + 1 := 37];#memory_int := #memory_int[#t~string147.base,#t~string147.offset + 2 := 105];#memory_int := #memory_int[#t~string147.base,#t~string147.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string149.base, #t~string149.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string149.base,#t~string149.offset + 0 := 32];#memory_int := #memory_int[#t~string149.base,#t~string149.offset + 1 := 37];#memory_int := #memory_int[#t~string149.base,#t~string149.offset + 2 := 105];#memory_int := #memory_int[#t~string149.base,#t~string149.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 6;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string151.base, #t~string151.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string151.base,#t~string151.offset + 0 := 32];#memory_int := #memory_int[#t~string151.base,#t~string151.offset + 1 := 70];#memory_int := #memory_int[#t~string151.base,#t~string151.offset + 2 := 95];#memory_int := #memory_int[#t~string151.base,#t~string151.offset + 3 := 112];#memory_int := #memory_int[#t~string151.base,#t~string151.offset + 4 := 58];#memory_int := #memory_int[#t~string151.base,#t~string151.offset + 5 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string154.base, #t~string154.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string154.base,#t~string154.offset + 0 := 32];#memory_int := #memory_int[#t~string154.base,#t~string154.offset + 1 := 37];#memory_int := #memory_int[#t~string154.base,#t~string154.offset + 2 := 105];#memory_int := #memory_int[#t~string154.base,#t~string154.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string157.base, #t~string157.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string157.base,#t~string157.offset + 0 := 32];#memory_int := #memory_int[#t~string157.base,#t~string157.offset + 1 := 37];#memory_int := #memory_int[#t~string157.base,#t~string157.offset + 2 := 105];#memory_int := #memory_int[#t~string157.base,#t~string157.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string160.base, #t~string160.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string160.base,#t~string160.offset + 0 := 32];#memory_int := #memory_int[#t~string160.base,#t~string160.offset + 1 := 37];#memory_int := #memory_int[#t~string160.base,#t~string160.offset + 2 := 105];#memory_int := #memory_int[#t~string160.base,#t~string160.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string163.base, #t~string163.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string163.base,#t~string163.offset + 0 := 32];#memory_int := #memory_int[#t~string163.base,#t~string163.offset + 1 := 37];#memory_int := #memory_int[#t~string163.base,#t~string163.offset + 2 := 105];#memory_int := #memory_int[#t~string163.base,#t~string163.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string166.base, #t~string166.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string166.base,#t~string166.offset + 0 := 32];#memory_int := #memory_int[#t~string166.base,#t~string166.offset + 1 := 37];#memory_int := #memory_int[#t~string166.base,#t~string166.offset + 2 := 105];#memory_int := #memory_int[#t~string166.base,#t~string166.offset + 3 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string168.base, #t~string168.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#memory_int := #memory_int[#t~string168.base,#t~string168.offset + 0 := 10];#memory_int := #memory_int[#t~string168.base,#t~string168.offset + 1 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~string171.base, #t~string171.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 6599#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret61, main_~retValue_acc~12, main_~tmp~14;havoc main_~retValue_acc~12;havoc main_~tmp~14;assume { :begin_inline_select_helpers } true; 1245#L1286true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 845#L1279true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 1073#L1294true main_#t~ret61 := valid_product_#res;assume { :end_inline_valid_product } true;main_~tmp~14 := main_#t~ret61;havoc main_#t~ret61; 1686#L1868true assume main_~tmp~14 != 0;assume { :begin_inline_setup } true; 421#L1843true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification2_spec__1 } true;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1100#L60true assume { :end_inline___utac_acc__Specification2_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret54, bigMacCall_~tmp~11;havoc bigMacCall_~tmp~11;assume { :begin_inline_getOrigin } true;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 899#L1456true assume getOrigin_~person == 0;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 73#L1481true bigMacCall_#t~ret54 := getOrigin_#res;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~11 := bigMacCall_#t~ret54;havoc bigMacCall_#t~ret54;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~11;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1056#L587true assume initPersonOnFloor_~floor == 0; 1035#L588true assume initPersonOnFloor_~person == 0;~personOnFloor_0_0~0 := 1; 4502#L695-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5907#L379true assume callOnFloor_~floorID == 0;~calls_0~0 := 1; 6194#L391-2true assume { :end_inline_callOnFloor } true; 5868#L731true assume { :end_inline_initPersonOnFloor } true; 394#L1647true assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret55, cleanup_#t~ret56, cleanup_~i~2, cleanup_~tmp~12, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~12;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~2;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6321#L2149true timeShift_#t~ret122 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4626#L3159true assume timeShift_~tmp~29 != 0; 4698#L3160true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4631#L3159-1true assume { :begin_inline___utac_acc__Specification2_spec__3 } true;havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5867#L2140-10true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1738#L105true assume __utac_acc__Specification2_spec__3_~floor~0 == 0; 1718#L106true assume ~floorButtons_spc2_0~0 != 0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6312#L2149-1true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1659#L110true assume __utac_acc__Specification2_spec__3_~tmp___4~0 != 0;~floorButtons_spc2_0~0 := 0; 4699#L165true assume { :end_inline___utac_acc__Specification2_spec__3 } true; 7242#L3177true assume { :end_inline_timeShift } true;cleanup_~i~2 := 0; 2296#L1675-3true [2018-11-10 06:07:47,898 INFO L795 eck$LassoCheckResult]: Loop: 2296#L1675-3true assume true; 2324#L1675-1true assume !false; 2409#L1676true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2242#L1679true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5937#L1963true cleanup_#t~ret55 := isBlocked_#res;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~3 := cleanup_#t~ret55;havoc cleanup_#t~ret55; 2883#L1683true assume cleanup_~tmp___0~3 != 1; 2885#L1683-1true assume { :begin_inline_isIdle } true;havoc isIdle_#res;havoc isIdle_#t~ret70, isIdle_~retValue_acc~20, isIdle_~tmp~19;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~19;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_#t~ret69, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~18, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~18;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 5372#L316-130true assume isFloorCalling_~floorID == 0;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 4416#L343-130true anyStopRequested_#t~ret65 := isFloorCalling_#res;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret65;havoc anyStopRequested_#t~ret65; 4895#L2248true assume anyStopRequested_~tmp___3~1 != 0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 6098#L2312true isIdle_#t~ret70 := anyStopRequested_#res;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~19 := isIdle_#t~ret70;havoc isIdle_#t~ret70;isIdle_~retValue_acc~20 := (if isIdle_~tmp~19 == 0 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6216#L2325true cleanup_#t~ret56 := isIdle_#res;assume { :end_inline_isIdle } true;cleanup_~tmp~12 := cleanup_#t~ret56;havoc cleanup_#t~ret56; 1674#L1695true assume !(cleanup_~tmp~12 != 0);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6317#L2149-6true timeShift_#t~ret122 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4629#L3159-2true assume timeShift_~tmp~29 != 0; 4700#L3160-3true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4710#L3159-3true assume { :begin_inline___utac_acc__Specification2_spec__3 } true;havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5905#L2140-21true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1736#L105-1true assume __utac_acc__Specification2_spec__3_~floor~0 == 0; 1692#L106-1true assume ~floorButtons_spc2_0~0 != 0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6303#L2149-7true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1653#L110-2true assume __utac_acc__Specification2_spec__3_~tmp___4~0 != 0;~floorButtons_spc2_0~0 := 0; 4701#L165-1true assume { :end_inline___utac_acc__Specification2_spec__3 } true; 7241#L3177-1true assume { :end_inline_timeShift } true;cleanup_~i~2 := cleanup_~i~2 + 1; 2296#L1675-3true [2018-11-10 06:07:47,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash -443081890, now seen corresponding path program 1 times [2018-11-10 06:07:47,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:47,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:07:48,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:07:48,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:07:48,119 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:07:48,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash -253016668, now seen corresponding path program 1 times [2018-11-10 06:07:48,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:48,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,313 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-11-10 06:07:48,501 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-10 06:07:48,509 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:07:48,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:07:48,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:07:48,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:07:48,510 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:07:48,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:07:48,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:07:48,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:07:48,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-10 06:07:48,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:07:48,512 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:07:48,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:48,888 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:07:48,889 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/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-11-10 06:07:48,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:07:48,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:07:48,901 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:07:48,901 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/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-11-10 06:07:49,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:07:49,025 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba17f186-3657-4d44-bbfb-d7fde5b465a0/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:07:49,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:07:49,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:07:57,704 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:07:57,706 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:07:57,706 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:07:57,706 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:07:57,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:07:57,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:07:57,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:07:57,707 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:07:57,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:07:57,707 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-10 06:07:57,707 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:07:57,707 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:07:57,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,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-11-10 06:07:57,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-11-10 06:07:57,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,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-11-10 06:07:57,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:57,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:58,038 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:07:58,043 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:07:58,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,056 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:07:58,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,057 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:07:58,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:58,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:07:58,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:58,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:58,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:58,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:58,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:58,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:58,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:58,087 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:07:58,093 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:07:58,093 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:07:58,094 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:07:58,095 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 06:07:58,095 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:07:58,095 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2018-11-10 06:07:58,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 06:07:58,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:58,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:58,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:07:58,291 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 06:07:58,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7318 states. Second operand 5 states. [2018-11-10 06:07:58,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7318 states.. Second operand 5 states. Result 11037 states and 20590 transitions. Complement of second has 9 states. [2018-11-10 06:07:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 06:07:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 06:07:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13734 transitions. [2018-11-10 06:07:58,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13734 transitions. Stem has 28 letters. Loop has 24 letters. [2018-11-10 06:07:58,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:58,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13734 transitions. Stem has 52 letters. Loop has 24 letters. [2018-11-10 06:07:58,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:58,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13734 transitions. Stem has 28 letters. Loop has 48 letters. [2018-11-10 06:07:58,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:58,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11037 states and 20590 transitions. [2018-11-10 06:07:58,949 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:07:58,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11037 states to 0 states and 0 transitions. [2018-11-10 06:07:58,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:07:58,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:07:58,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:07:58,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:07:58,953 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:58,954 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:07:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:07:58,959 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 06:07:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:07:58,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 06:07:58,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:07:58,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 06:07:58,962 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:07:58,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:07:58,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:07:58,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:07:58,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:07:58,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:07:58,963 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:58,963 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:58,963 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:58,963 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:07:58,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:07:58,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:07:58,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:07:58,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:07:58 BoogieIcfgContainer [2018-11-10 06:07:58,969 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:07:58,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:07:58,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:07:58,969 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:07:58,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:07:47" (3/4) ... [2018-11-10 06:07:58,973 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:07:58,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:07:58,973 INFO L168 Benchmark]: Toolchain (without parser) took 20074.93 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 618.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 484.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:58,974 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:07:58,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:58,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.40 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: 74.1 MB). Peak memory consumption was 74.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:58,976 INFO L168 Benchmark]: Boogie Preprocessor took 233.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 68.4 MB). Peak memory consumption was 68.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:58,976 INFO L168 Benchmark]: RCFGBuilder took 7743.97 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.5 MB). Free memory was 999.8 MB in the beginning and 1.1 GB in the end (delta: -103.1 MB). Peak memory consumption was 443.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:58,977 INFO L168 Benchmark]: BuchiAutomizer took 11317.45 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 1.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:58,977 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:07:58,980 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 583.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 190.40 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: 74.1 MB). Peak memory consumption was 74.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 233.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 68.4 MB). Peak memory consumption was 68.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7743.97 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.5 MB). Free memory was 999.8 MB in the beginning and 1.1 GB in the end (delta: -103.1 MB). Peak memory consumption was 443.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11317.45 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 1.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.6 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 10.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13691 SDtfs, 27340 SDslu, 6871 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...