./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6918e197f4f4b34e9e598cdd0f1a12bdba0c59a1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:05:58,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:05:58,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:05:58,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:05:58,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:05:58,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:05:58,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:05:58,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:05:58,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:05:58,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:05:58,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:05:58,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:05:58,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:05:58,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:05:58,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:05:58,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:05:58,441 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:05:58,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:05:58,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:05:58,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:05:58,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:05:58,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:05:58,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:05:58,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:05:58,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:05:58,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:05:58,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:05:58,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:05:58,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:05:58,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:05:58,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:05:58,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:05:58,462 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:05:58,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:05:58,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:05:58,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:05:58,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:05:58,481 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:05:58,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:05:58,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:05:58,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:05:58,484 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:05:58,484 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:05:58,484 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:05:58,484 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:05:58,485 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:05:58,485 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:05:58,485 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:05:58,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:05:58,485 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:05:58,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:05:58,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:05:58,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:05:58,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:05:58,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:05:58,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:05:58,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:05:58,488 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:05:58,489 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:05:58,489 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:05:58,489 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:05:58,489 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:05:58,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:05:58,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:05:58,490 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:05:58,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:05:58,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:05:58,490 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:05:58,493 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:05:58,493 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6918e197f4f4b34e9e598cdd0f1a12bdba0c59a1 [2019-01-14 04:05:58,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:05:58,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:05:58,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:05:58,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:05:58,552 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:05:58,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c [2019-01-14 04:05:58,613 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d388351d4/315a2a98a76343b999c80a65dfb51497/FLAG1decf4720 [2019-01-14 04:05:59,243 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:05:59,244 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c [2019-01-14 04:05:59,263 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d388351d4/315a2a98a76343b999c80a65dfb51497/FLAG1decf4720 [2019-01-14 04:05:59,453 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d388351d4/315a2a98a76343b999c80a65dfb51497 [2019-01-14 04:05:59,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:05:59,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:05:59,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:05:59,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:05:59,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:05:59,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:05:59" (1/1) ... [2019-01-14 04:05:59,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7129d1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:05:59, skipping insertion in model container [2019-01-14 04:05:59,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:05:59" (1/1) ... [2019-01-14 04:05:59,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:05:59,589 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:06:00,259 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:06:00,378 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:06:00,501 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:06:00,574 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:06:00,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00 WrapperNode [2019-01-14 04:06:00,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:06:00,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:06:00,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:06:00,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:06:00,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:00,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:00,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:06:00,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:06:00,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:06:00,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:06:00,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:00,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:00,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:00,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:01,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:01,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:01,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... [2019-01-14 04:06:01,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:06:01,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:06:01,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:06:01,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:06:01,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:06:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:06:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:06:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:06:14,928 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:06:14,928 INFO L286 CfgBuilder]: Removed 1113 assue(true) statements. [2019-01-14 04:06:14,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:14 BoogieIcfgContainer [2019-01-14 04:06:14,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:06:14,933 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:06:14,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:06:14,936 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:06:14,937 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:14,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:05:59" (1/3) ... [2019-01-14 04:06:14,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39268156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:06:14, skipping insertion in model container [2019-01-14 04:06:14,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:14,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:00" (2/3) ... [2019-01-14 04:06:14,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39268156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:06:14, skipping insertion in model container [2019-01-14 04:06:14,940 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:14,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:14" (3/3) ... [2019-01-14 04:06:14,941 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product26_false-unreach-call_true-termination.cil.c [2019-01-14 04:06:14,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:06:15,000 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:06:15,000 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:06:15,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:06:15,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:06:15,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:06:15,001 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:06:15,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:06:15,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:06:15,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2019-01-14 04:06:15,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2019-01-14 04:06:15,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:15,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:15,305 INFO L867 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] [2019-01-14 04:06:15,305 INFO L868 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] [2019-01-14 04:06:15,305 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:06:15,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2019-01-14 04:06:15,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2019-01-14 04:06:15,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:15,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:15,372 INFO L867 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] [2019-01-14 04:06:15,372 INFO L868 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] [2019-01-14 04:06:15,380 INFO L794 eck$LassoCheckResult]: Stem: 2215#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(10);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);~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; 3589#L-1true havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 554#L3249true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 3647#L3257true main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 1314#L3122true assume 0 != main_~tmp~25; 4520#L3094true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3699#L440true havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 1216#L3305true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 132#L3330true bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 4631#L2473true assume 0 == initPersonOnFloor_~floor; 4841#L2474true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1822#L2581-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 402#L2265true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 670#L2277-2true havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 363#L854true timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 436#L1736true assume 0 != timeShift_~tmp~14; 380#L1737true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2813#L1441-11true havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1633#L845true __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 1996#L905-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 1467#L937-12true __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 1229#L483true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1613#L493-1true cleanup_~i~1 := 0; 2417#L2926-2true [2019-01-14 04:06:15,380 INFO L796 eck$LassoCheckResult]: Loop: 2417#L2926-2true assume !false; 2131#L2927true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1881#L2930true assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 1664#L668true cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 1785#L2934true assume 1 != cleanup_~tmp___0~7; 1791#L2934-1true havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 3384#L2202-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 3056#L2229-42true anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 788#L953true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 879#L1017true isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 369#L1030true cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 1310#L2946true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 358#L854-2true timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 435#L1736-1true assume 0 != timeShift_~tmp~14; 382#L1737-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2954#L1441-23true havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1635#L845-1true __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 1979#L905-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 1536#L937-25true __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 1232#L483-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1619#L493-3true cleanup_~i~1 := 1 + cleanup_~i~1; 2417#L2926-2true [2019-01-14 04:06:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2120884841, now seen corresponding path program 1 times [2019-01-14 04:06:15,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:15,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:15,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:15,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:15,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:15,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash 467648044, now seen corresponding path program 1 times [2019-01-14 04:06:15,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:15,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:15,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:15,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:15,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:06:15,936 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:06:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:06:15,957 INFO L87 Difference]: Start difference. First operand 4855 states. Second operand 4 states. [2019-01-14 04:06:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:19,074 INFO L93 Difference]: Finished difference Result 12925 states and 24453 transitions. [2019-01-14 04:06:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:06:19,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12925 states and 24453 transitions. [2019-01-14 04:06:19,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8797 [2019-01-14 04:06:19,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12925 states to 12883 states and 24404 transitions. [2019-01-14 04:06:19,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12883 [2019-01-14 04:06:19,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12883 [2019-01-14 04:06:19,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12883 states and 24404 transitions. [2019-01-14 04:06:19,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:19,458 INFO L706 BuchiCegarLoop]: Abstraction has 12883 states and 24404 transitions. [2019-01-14 04:06:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12883 states and 24404 transitions. [2019-01-14 04:06:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12883 to 4845. [2019-01-14 04:06:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2019-01-14 04:06:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 9174 transitions. [2019-01-14 04:06:19,690 INFO L729 BuchiCegarLoop]: Abstraction has 4845 states and 9174 transitions. [2019-01-14 04:06:19,690 INFO L609 BuchiCegarLoop]: Abstraction has 4845 states and 9174 transitions. [2019-01-14 04:06:19,690 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:06:19,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4845 states and 9174 transitions. [2019-01-14 04:06:19,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2419 [2019-01-14 04:06:19,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:19,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:19,717 INFO L867 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] [2019-01-14 04:06:19,717 INFO L868 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] [2019-01-14 04:06:19,718 INFO L794 eck$LassoCheckResult]: Stem: 20658#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(10);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);~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; 20659#L-1 havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 18782#L3249 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 18783#L3257 main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 19590#L3122 assume 0 != main_~tmp~25; 19591#L3094 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 22013#L440 havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 19481#L3305 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 18131#L3330 bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 18132#L2473 assume 0 == initPersonOnFloor_~floor; 22631#L2474 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 18148#L2581-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 18532#L2265 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 18082#L2277-2 havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18473#L854 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 18474#L1736 assume 0 != timeShift_~tmp~14; 18498#L1737 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 18499#L1441-11 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 19861#L845 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 19862#L905-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 19432#L937-12 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 19497#L483 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18475#L854-1 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 18476#L493 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 17819#L493-1 cleanup_~i~1 := 0; 19842#L2926-2 [2019-01-14 04:06:19,718 INFO L796 eck$LassoCheckResult]: Loop: 19842#L2926-2 assume !false; 20547#L2927 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 20213#L2930 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 19867#L668 cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 19868#L2934 assume 1 != cleanup_~tmp___0~7; 20084#L2934-1 havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 20094#L2202-42 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 20844#L2229-42 anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 18991#L953 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 18984#L1017 isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 18485#L1030 cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 18486#L2946 assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18463#L854-2 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 18464#L1736-1 assume 0 != timeShift_~tmp~14; 18504#L1737-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 18505#L1441-23 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 19863#L845-1 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 19864#L905-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 19366#L937-25 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 19500#L483-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18465#L854-3 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 18466#L493-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 18155#L493-3 cleanup_~i~1 := 1 + cleanup_~i~1; 19842#L2926-2 [2019-01-14 04:06:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1939500596, now seen corresponding path program 1 times [2019-01-14 04:06:19,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:19,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:19,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:19,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:19,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1561055767, now seen corresponding path program 1 times [2019-01-14 04:06:19,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:19,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:19,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:19,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:06:19,981 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:06:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:06:19,982 INFO L87 Difference]: Start difference. First operand 4845 states and 9174 transitions. cyclomatic complexity: 4330 Second operand 7 states. [2019-01-14 04:06:20,369 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-14 04:06:20,661 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 04:06:21,440 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 04:06:22,116 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:06:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:23,763 INFO L93 Difference]: Finished difference Result 7976 states and 14976 transitions. [2019-01-14 04:06:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 04:06:23,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7976 states and 14976 transitions. [2019-01-14 04:06:23,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6395 [2019-01-14 04:06:23,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7976 states to 7976 states and 14976 transitions. [2019-01-14 04:06:23,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7976 [2019-01-14 04:06:23,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7976 [2019-01-14 04:06:23,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7976 states and 14976 transitions. [2019-01-14 04:06:23,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:23,894 INFO L706 BuchiCegarLoop]: Abstraction has 7976 states and 14976 transitions. [2019-01-14 04:06:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states and 14976 transitions. [2019-01-14 04:06:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 4319. [2019-01-14 04:06:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2019-01-14 04:06:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 8148 transitions. [2019-01-14 04:06:24,014 INFO L729 BuchiCegarLoop]: Abstraction has 4319 states and 8148 transitions. [2019-01-14 04:06:24,014 INFO L609 BuchiCegarLoop]: Abstraction has 4319 states and 8148 transitions. [2019-01-14 04:06:24,014 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:06:24,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4319 states and 8148 transitions. [2019-01-14 04:06:24,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2767 [2019-01-14 04:06:24,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:24,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:24,039 INFO L867 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] [2019-01-14 04:06:24,040 INFO L868 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, 1] [2019-01-14 04:06:24,040 INFO L794 eck$LassoCheckResult]: Stem: 32891#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(10);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);~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; 32892#L-1 havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 31420#L3249 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 31421#L3257 main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 32037#L3122 assume 0 != main_~tmp~25; 32038#L3094 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 33955#L440 havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 31950#L3305 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 30911#L3330 bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 30912#L2473 assume 0 == initPersonOnFloor_~floor; 34450#L2474 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 30927#L2581-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 31225#L2265 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 30873#L2277-2 havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31173#L854 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 31174#L1736 assume 0 != timeShift_~tmp~14; 31194#L1737 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 31195#L1441-11 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 32250#L845 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 32251#L905-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 31908#L937-12 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 31960#L483 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31175#L854-1 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 31176#L493 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 32196#L494 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 32197#L495 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 30680#L493-1 cleanup_~i~1 := 0; 34706#L2926-2 [2019-01-14 04:06:24,040 INFO L796 eck$LassoCheckResult]: Loop: 34706#L2926-2 assume !false; 34705#L2927 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 34704#L2930 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 34703#L668 cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 34702#L2934 assume 1 != cleanup_~tmp___0~7; 32422#L2934-1 havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 32423#L2202-42 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 33040#L2229-42 anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 31575#L953 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 31565#L1017 isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 34466#L1030 cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 32033#L2946 assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31163#L854-2 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 31164#L1736-1 assume 0 != timeShift_~tmp~14; 31200#L1737-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 31201#L1441-23 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 32252#L845-1 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 32253#L905-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 34725#L937-25 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 31963#L483-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31165#L854-3 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 31166#L493-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 32198#L494-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 32199#L495-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 34707#L493-3 cleanup_~i~1 := 1 + cleanup_~i~1; 34706#L2926-2 [2019-01-14 04:06:24,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -157269105, now seen corresponding path program 1 times [2019-01-14 04:06:24,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:24,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:24,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:24,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:24,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1232168348, now seen corresponding path program 1 times [2019-01-14 04:06:24,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:24,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:24,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:06:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:06:24,575 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-01-14 04:06:24,969 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-01-14 04:06:24,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:06:24,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:06:24,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:06:24,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:06:24,987 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:06:24,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:24,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:06:24,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:06:24,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:06:24,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:06:24,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:06:25,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:25,529 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 04:06:25,758 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:06:26,306 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:06:26,436 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:06:26,437 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:06:26,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,448 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,460 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,461 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:06:26,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,496 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,497 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:06:26,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,536 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,537 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:06:26,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,587 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:06:26,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,664 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,684 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,684 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:06:26,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,716 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,729 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,729 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret42=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret42=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,765 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret41=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret41=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,792 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,792 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~8=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,838 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret45=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret45=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,897 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:26,897 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret44=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret44=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:26,917 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:06:26,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:26,987 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:06:26,989 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:06:26,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:06:26,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:06:26,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:06:26,989 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:06:26,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:26,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:06:26,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:06:26,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:06:26,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:06:26,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:06:26,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,195 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:06:27,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,482 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:06:27,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,900 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:06:27,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:27,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:28,302 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 04:06:28,582 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:06:28,772 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:06:29,356 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:06:29,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:06:29,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:06:29,460 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 [2019-01-14 04:06:29,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:29,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,474 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 [2019-01-14 04:06:29,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,475 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:06:29,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:06:29,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,484 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 [2019-01-14 04:06:29,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,489 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 [2019-01-14 04:06:29,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,495 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 [2019-01-14 04:06:29,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,502 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 [2019-01-14 04:06:29,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,507 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 [2019-01-14 04:06:29,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,513 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 [2019-01-14 04:06:29,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,518 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 [2019-01-14 04:06:29,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,523 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 [2019-01-14 04:06:29,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,526 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 [2019-01-14 04:06:29,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,531 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 [2019-01-14 04:06:29,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,542 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 [2019-01-14 04:06:29,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,544 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:06:29,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,545 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:06:29,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,549 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 [2019-01-14 04:06:29,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,553 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 [2019-01-14 04:06:29,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,556 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 [2019-01-14 04:06:29,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,563 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 [2019-01-14 04:06:29,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,567 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 [2019-01-14 04:06:29,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:06:29,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,572 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:06:29,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,587 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 [2019-01-14 04:06:29,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,593 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 [2019-01-14 04:06:29,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,599 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 [2019-01-14 04:06:29,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,609 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 [2019-01-14 04:06:29,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,616 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 [2019-01-14 04:06:29,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,619 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 [2019-01-14 04:06:29,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,620 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:06:29,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,622 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:06:29,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,634 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 [2019-01-14 04:06:29,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,638 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 [2019-01-14 04:06:29,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,642 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 [2019-01-14 04:06:29,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:29,646 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 [2019-01-14 04:06:29,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:29,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:29,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:29,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:29,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:29,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:29,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:29,651 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:06:29,661 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:06:29,661 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:06:29,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:06:29,668 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:06:29,668 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:06:29,669 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-01-14 04:06:29,670 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:06:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:30,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:06:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:30,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:06:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:30,455 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 [2019-01-14 04:06:30,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4319 states and 8148 transitions. cyclomatic complexity: 3830 Second operand 5 states. [2019-01-14 04:06:31,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4319 states and 8148 transitions. cyclomatic complexity: 3830. Second operand 5 states. Result 7086 states and 13370 transitions. Complement of second has 8 states. [2019-01-14 04:06:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:06:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:06:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6946 transitions. [2019-01-14 04:06:31,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 27 letters. Loop has 25 letters. [2019-01-14 04:06:31,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:06:31,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 52 letters. Loop has 25 letters. [2019-01-14 04:06:31,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:06:31,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 27 letters. Loop has 50 letters. [2019-01-14 04:06:31,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:06:31,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7086 states and 13370 transitions. [2019-01-14 04:06:31,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:06:31,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7086 states to 0 states and 0 transitions. [2019-01-14 04:06:31,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:06:31,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:06:31,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:06:31,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:31,344 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:06:31,344 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:06:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:06:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:06:31,345 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:06:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:31,345 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:06:31,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:06:31,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:06:31,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:06:31,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:06:31,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:06:31,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:06:31,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:06:31,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:31,351 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:06:31,351 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:06:31,351 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:06:31,351 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:06:31,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:06:31,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:06:31,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:06:31,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:06:31 BoogieIcfgContainer [2019-01-14 04:06:31,362 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:06:31,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:06:31,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:06:31,363 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:06:31,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:14" (3/4) ... [2019-01-14 04:06:31,370 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:06:31,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:06:31,371 INFO L168 Benchmark]: Toolchain (without parser) took 31913.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 562.0 MB). Free memory was 944.5 MB in the beginning and 1.3 GB in the end (delta: -352.7 MB). Peak memory consumption was 209.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:06:31,373 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:06:31,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1115.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:06:31,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.01 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: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:06:31,376 INFO L168 Benchmark]: Boogie Preprocessor took 355.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:06:31,378 INFO L168 Benchmark]: RCFGBuilder took 13689.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 449.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:06:31,380 INFO L168 Benchmark]: BuchiAutomizer took 16430.03 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -149.8 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:06:31,381 INFO L168 Benchmark]: Witness Printer took 6.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:06:31,387 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1115.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 310.01 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: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 355.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 13689.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 449.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16430.03 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -149.8 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.4s. Construction of modules took 4.0s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 11695 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 4845 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30400 SDtfs, 58233 SDslu, 68802 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...