./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec14_product28_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec14_product28_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7db86f0efa9db5760dadd3c68f190d4381c75 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 10:38:23,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:38:23,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:38:23,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:38:23,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:38:23,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:38:23,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:38:23,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:38:23,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:38:23,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:38:23,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:38:23,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:38:23,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:38:23,295 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:38:23,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:38:23,296 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:38:23,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:38:23,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:38:23,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:38:23,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:38:23,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:38:23,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:38:23,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:38:23,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:38:23,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:38:23,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:38:23,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:38:23,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:38:23,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:38:23,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:38:23,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:38:23,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:38:23,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:38:23,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:38:23,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:38:23,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:38:23,306 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 10:38:23,313 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:38:23,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:38:23,314 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 10:38:23,314 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 10:38:23,315 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 10:38:23,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 10:38:23,315 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 10:38:23,316 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:38:23,316 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:38:23,317 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 10:38:23,317 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:38:23,317 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 10:38:23,317 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 10:38:23,317 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 10:38:23,317 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7db86f0efa9db5760dadd3c68f190d4381c75 [2018-12-02 10:38:23,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:38:23,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:38:23,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:38:23,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:38:23,344 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:38:23,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec14_product28_false-unreach-call_true-termination.cil.c [2018-12-02 10:38:23,380 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/data/3062bb49a/a966891b99a745b78ed9a39455be929e/FLAGd6a4abb5c [2018-12-02 10:38:23,846 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:38:23,846 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/sv-benchmarks/c/product-lines/elevator_spec14_product28_false-unreach-call_true-termination.cil.c [2018-12-02 10:38:23,855 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/data/3062bb49a/a966891b99a745b78ed9a39455be929e/FLAGd6a4abb5c [2018-12-02 10:38:23,863 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/data/3062bb49a/a966891b99a745b78ed9a39455be929e [2018-12-02 10:38:23,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:38:23,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:38:23,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:38:23,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:38:23,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:38:23,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:38:23" (1/1) ... [2018-12-02 10:38:23,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b02c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:23, skipping insertion in model container [2018-12-02 10:38:23,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:38:23" (1/1) ... [2018-12-02 10:38:23,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:38:23,904 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:38:24,200 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:38:24,209 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:38:24,278 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:38:24,305 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:38:24,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24 WrapperNode [2018-12-02 10:38:24,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:38:24,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:38:24,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:38:24,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:38:24,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:38:24,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:38:24,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:38:24,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:38:24,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... [2018-12-02 10:38:24,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:38:24,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:38:24,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:38:24,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:38:24,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 10:38:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 10:38:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:38:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:38:33,625 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:38:33,625 INFO L280 CfgBuilder]: Removed 2903 assue(true) statements. [2018-12-02 10:38:33,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:38:33 BoogieIcfgContainer [2018-12-02 10:38:33,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:38:33,626 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 10:38:33,626 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 10:38:33,628 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 10:38:33,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 10:38:33,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 10:38:23" (1/3) ... [2018-12-02 10:38:33,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@564f3142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:38:33, skipping insertion in model container [2018-12-02 10:38:33,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 10:38:33,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:38:24" (2/3) ... [2018-12-02 10:38:33,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@564f3142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:38:33, skipping insertion in model container [2018-12-02 10:38:33,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 10:38:33,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:38:33" (3/3) ... [2018-12-02 10:38:33,631 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec14_product28_false-unreach-call_true-termination.cil.c [2018-12-02 10:38:33,660 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 10:38:33,661 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 10:38:33,661 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 10:38:33,661 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 10:38:33,661 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:38:33,661 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:38:33,661 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 10:38:33,661 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:38:33,661 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 10:38:33,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12122 states. [2018-12-02 10:38:33,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2442 [2018-12-02 10:38:33,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:38:33,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:38:33,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:38:33,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:38:33,850 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 10:38:33,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12122 states. [2018-12-02 10:38:33,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2442 [2018-12-02 10:38:33,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:38:33,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:38:33,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:38:33,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:38:33,913 INFO L794 eck$LassoCheckResult]: Stem: 3627#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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~string59.base, #t~string59.offset := #Ultimate.alloc(10);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string61.base, #t~string61.offset, 1);call write~init~int(95, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(93, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string65.base, #t~string65.offset, 1);call write~init~int(97, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(105, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(10);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string71.base, #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string73.base, #t~string73.offset, 1);call write~init~int(111, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(119, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(110, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 4 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(76, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(95, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(112, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(37, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 3 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(70, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(112, #t~string87.base, 3 + #t~string87.offset, 1);call write~init~int(58, #t~string87.base, 4 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 5 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string99.base, #t~string99.offset, 1);call write~init~int(37, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(105, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 3 + #t~string99.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(37, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(105, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string104.base, #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 1 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(9);~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0;call #t~string148.base, #t~string148.offset := #Ultimate.alloc(30);call #t~string149.base, #t~string149.offset := #Ultimate.alloc(9);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(21);call #t~string151.base, #t~string151.offset := #Ultimate.alloc(30);call #t~string152.base, #t~string152.offset := #Ultimate.alloc(9);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(21);call #t~string157.base, #t~string157.offset := #Ultimate.alloc(30);call #t~string158.base, #t~string158.offset := #Ultimate.alloc(9);call #t~string159.base, #t~string159.offset := #Ultimate.alloc(25);call #t~string160.base, #t~string160.offset := #Ultimate.alloc(30);call #t~string161.base, #t~string161.offset := #Ultimate.alloc(9);call #t~string162.base, #t~string162.offset := #Ultimate.alloc(25); 11317#L-1true havoc main_#res;havoc main_#t~ret123, main_~retValue_acc~23, main_~tmp~24;havoc main_~retValue_acc~23;havoc main_~tmp~24; 340#L64true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 955#L72true main_#t~ret123 := valid_product_#res;main_~tmp~24 := main_#t~ret123;havoc main_#t~ret123; 685#L2197true assume 0 != main_~tmp~24; 2003#L2174true havoc bigMacCall_#t~ret116, bigMacCall_~tmp~21;havoc bigMacCall_~tmp~21;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 7508#L168true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 11763#L193true bigMacCall_#t~ret116 := getOrigin_#res;bigMacCall_~tmp~21 := bigMacCall_#t~ret116;havoc bigMacCall_#t~ret116;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 9915#L2664true assume 0 == initPersonOnFloor_~floor; 9725#L2665true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 8584#L2772-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 7494#L2456true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 11133#L2468-2true havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 6763#L507true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 1608#L1449true assume 0 != timeShift_~tmp~13; 1822#L1450true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 352#L1123-11true havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 5959#L2393-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 8488#L2420-50true isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 140#L1829-6true __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 6475#L96true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 6473#L96-1true havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 6733#L507-2true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 1615#L1449-1true assume 0 != timeShift_~tmp~13; 1794#L1450-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 164#L1123-23true havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 3741#L2393-101true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 8097#L2420-101true isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 116#L1829-13true __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 6457#L96-2true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 6455#L96-3true havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 6742#L507-4true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 1617#L1449-2true assume 0 != timeShift_~tmp~13; 1801#L1450-4true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 147#L1123-35true havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 3911#L2393-152true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 8182#L2420-152true isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 251#L1829-20true __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 6454#L96-4true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 6452#L96-5true havoc bobCall_#t~ret111, bobCall_~tmp~16;havoc bobCall_~tmp~16;getOrigin_#in~person := 0;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 7505#L168-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 11762#L193-1true bobCall_#t~ret111 := getOrigin_#res;bobCall_~tmp~16 := bobCall_#t~ret111;havoc bobCall_#t~ret111;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 0, bobCall_~tmp~16;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 9914#L2664-1true assume 0 == initPersonOnFloor_~floor; 9727#L2665-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 8594#L2772-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 7496#L2456-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 11139#L2468-5true havoc cleanup_#t~ret117, cleanup_#t~ret118, cleanup_~i~1, cleanup_~tmp~22, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~0;havoc cleanup_~i~1;havoc cleanup_~tmp~22;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 6750#L507-6true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 1626#L1449-3true assume 0 != timeShift_~tmp~13; 1780#L1450-6true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 125#L1123-47true havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 3683#L2393-203true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 7829#L2420-203true isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 241#L1829-27true __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 6451#L96-6true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 6465#L96-7true cleanup_~i~1 := 0; 219#L2006-2true [2018-12-02 10:38:33,913 INFO L796 eck$LassoCheckResult]: Loop: 219#L2006-2true assume !false; 181#L2007true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 963#L2010true assume cleanup_~i~1 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~5; 8762#L325true cleanup_#t~ret117 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret117;havoc cleanup_#t~ret117; 889#L2014true assume 1 != cleanup_~tmp___0~9; 891#L2014-1true havoc isIdle_#res;havoc isIdle_#t~ret13, isIdle_~retValue_acc~12, isIdle_~tmp~5;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_#t~ret11, anyStopRequested_#t~ret12, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 3688#L2393-204true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 7835#L2420-204true anyStopRequested_#t~ret8 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret8;havoc anyStopRequested_#t~ret8; 807#L606true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 9078#L670true isIdle_#t~ret13 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret13;havoc isIdle_#t~ret13;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 6978#L683true cleanup_#t~ret118 := isIdle_#res;cleanup_~tmp~22 := cleanup_#t~ret118;havoc cleanup_#t~ret118; 5604#L2026true assume !(0 != cleanup_~tmp~22);havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 6718#L507-8true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 1628#L1449-4true assume 0 != timeShift_~tmp~13; 1784#L1450-8true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 247#L1123-59true havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 3254#L2393-259true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 9365#L2420-259true isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 211#L1829-34true __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 6464#L96-8true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 6461#L96-9true cleanup_~i~1 := 1 + cleanup_~i~1; 219#L2006-2true [2018-12-02 10:38:33,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:38:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1369606475, now seen corresponding path program 1 times [2018-12-02 10:38:33,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:38:33,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:38:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:38:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:38:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:38:34,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:38:34,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:38:34,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:38:34,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:38:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1992718083, now seen corresponding path program 1 times [2018-12-02 10:38:34,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:38:34,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:38:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:34,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:38:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:38:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:38:34,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:38:34,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 10:38:34,132 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 10:38:34,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 10:38:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:38:34,143 INFO L87 Difference]: Start difference. First operand 12122 states. Second operand 8 states. [2018-12-02 10:38:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:38:44,589 INFO L93 Difference]: Finished difference Result 179654 states and 338660 transitions. [2018-12-02 10:38:44,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 10:38:44,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179654 states and 338660 transitions. [2018-12-02 10:38:45,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61026 [2018-12-02 10:38:45,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179654 states to 179554 states and 338533 transitions. [2018-12-02 10:38:45,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179554 [2018-12-02 10:38:45,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179554 [2018-12-02 10:38:45,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179554 states and 338533 transitions. [2018-12-02 10:38:45,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 10:38:45,860 INFO L705 BuchiCegarLoop]: Abstraction has 179554 states and 338533 transitions. [2018-12-02 10:38:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179554 states and 338533 transitions. [2018-12-02 10:38:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179554 to 24191. [2018-12-02 10:38:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24191 states. [2018-12-02 10:38:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24191 states to 24191 states and 45550 transitions. [2018-12-02 10:38:46,573 INFO L728 BuchiCegarLoop]: Abstraction has 24191 states and 45550 transitions. [2018-12-02 10:38:46,573 INFO L608 BuchiCegarLoop]: Abstraction has 24191 states and 45550 transitions. [2018-12-02 10:38:46,574 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 10:38:46,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24191 states and 45550 transitions. [2018-12-02 10:38:46,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4889 [2018-12-02 10:38:46,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 10:38:46,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 10:38:46,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:38:46,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:38:46,618 INFO L794 eck$LassoCheckResult]: Stem: 197071#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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~string59.base, #t~string59.offset := #Ultimate.alloc(10);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string61.base, #t~string61.offset, 1);call write~init~int(95, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(93, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string65.base, #t~string65.offset, 1);call write~init~int(97, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(105, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(10);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string71.base, #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string73.base, #t~string73.offset, 1);call write~init~int(111, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(119, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(110, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 4 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(76, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(95, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(112, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(37, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 3 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(70, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(112, #t~string87.base, 3 + #t~string87.offset, 1);call write~init~int(58, #t~string87.base, 4 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 5 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string99.base, #t~string99.offset, 1);call write~init~int(37, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(105, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 3 + #t~string99.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(37, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(105, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string104.base, #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 1 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(9);~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0;call #t~string148.base, #t~string148.offset := #Ultimate.alloc(30);call #t~string149.base, #t~string149.offset := #Ultimate.alloc(9);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(21);call #t~string151.base, #t~string151.offset := #Ultimate.alloc(30);call #t~string152.base, #t~string152.offset := #Ultimate.alloc(9);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(21);call #t~string157.base, #t~string157.offset := #Ultimate.alloc(30);call #t~string158.base, #t~string158.offset := #Ultimate.alloc(9);call #t~string159.base, #t~string159.offset := #Ultimate.alloc(25);call #t~string160.base, #t~string160.offset := #Ultimate.alloc(30);call #t~string161.base, #t~string161.offset := #Ultimate.alloc(9);call #t~string162.base, #t~string162.offset := #Ultimate.alloc(25); 197072#L-1 havoc main_#res;havoc main_#t~ret123, main_~retValue_acc~23, main_~tmp~24;havoc main_~retValue_acc~23;havoc main_~tmp~24; 192507#L64 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 192508#L72 main_#t~ret123 := valid_product_#res;main_~tmp~24 := main_#t~ret123;havoc main_#t~ret123; 193028#L2197 assume 0 != main_~tmp~24; 193029#L2174 havoc bigMacCall_#t~ret116, bigMacCall_~tmp~21;havoc bigMacCall_~tmp~21;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 194873#L168 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 200772#L193 bigMacCall_#t~ret116 := getOrigin_#res;bigMacCall_~tmp~21 := bigMacCall_#t~ret116;havoc bigMacCall_#t~ret116;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 202863#L2664 assume 0 == initPersonOnFloor_~floor; 202691#L2665 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 192454#L2772-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 200748#L2456 assume !(0 == callOnFloor_~floorID); 200528#L2459 assume 1 == callOnFloor_~floorID;~calls_1~0 := 1; 200529#L2468-2 havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 203718#L507 timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 194432#L1449 assume 0 != timeShift_~tmp~13; 194433#L1450 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 204285#L1123-11 havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 199212#L2393-50 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 196832#L2420-50 isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 192159#L1829-6 __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 192160#L96 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 197413#L96-1 havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 199525#L507-2 timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 194442#L1449-1 assume 0 != timeShift_~tmp~13; 194443#L1450-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 204276#L1123-23 havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 197183#L2393-101 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 195831#L2420-101 isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 192116#L1829-13 __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 192117#L96-2 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 197383#L96-3 havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 199519#L507-4 timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 194446#L1449-2 assume 0 != timeShift_~tmp~13; 194447#L1450-4 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 192660#L1123-35 havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 197347#L2393-152 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 196108#L2420-152 isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 192405#L1829-20 __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 192406#L96-4 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 197372#L96-5 havoc bobCall_#t~ret111, bobCall_~tmp~16;havoc bobCall_~tmp~16;getOrigin_#in~person := 0;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 199516#L168-1 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 200765#L193-1 bobCall_#t~ret111 := getOrigin_#res;bobCall_~tmp~16 := bobCall_#t~ret111;havoc bobCall_#t~ret111;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 0, bobCall_~tmp~16;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 202862#L2664-1 assume 0 == initPersonOnFloor_~floor; 202694#L2665-2 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 192471#L2772-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 200751#L2456-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 200516#L2468-5 havoc cleanup_#t~ret117, cleanup_#t~ret118, cleanup_~i~1, cleanup_~tmp~22, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~0;havoc cleanup_~i~1;havoc cleanup_~tmp~22;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 199889#L507-6 timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 199890#L1449-3 assume 0 != timeShift_~tmp~13; 194635#L1450-6 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 192131#L1123-47 havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 192132#L2393-203 assume !(0 == isFloorCalling_~floorID); 204280#L2397-203 assume 1 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_1~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 213514#L2420-203 isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 213513#L1829-27 __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 213511#L96-6 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 199524#L96-7 cleanup_~i~1 := 0; 192335#L2006-2 [2018-12-02 10:38:46,618 INFO L796 eck$LassoCheckResult]: Loop: 192335#L2006-2 assume !false; 192236#L2007 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 192237#L2010 assume cleanup_~i~1 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~5; 193409#L325 cleanup_#t~ret117 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret117;havoc cleanup_#t~ret117; 193354#L2014 assume 1 != cleanup_~tmp___0~9; 193355#L2014-1 havoc isIdle_#res;havoc isIdle_#t~ret13, isIdle_~retValue_acc~12, isIdle_~tmp~5;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_#t~ret11, anyStopRequested_#t~ret12, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 193357#L2393-204 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 197130#L2420-204 anyStopRequested_#t~ret8 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret8;havoc anyStopRequested_#t~ret8; 193258#L606 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 192925#L670 isIdle_#t~ret13 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret13;havoc isIdle_#t~ret13;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 200141#L683 cleanup_#t~ret118 := isIdle_#res;cleanup_~tmp~22 := cleanup_#t~ret118;havoc cleanup_#t~ret118; 198998#L2026 assume !(0 != cleanup_~tmp~22);havoc timeShift_#t~ret58, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 198999#L507-8 timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 194461#L1449-4 assume 0 != timeShift_~tmp~13; 194462#L1450-8 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 192399#L1123-59 havoc __utac_acc__Specification14_spec__1_#t~ret1, __utac_acc__Specification14_spec__1_#t~ret2, __utac_acc__Specification14_spec__1_#t~ret3, __utac_acc__Specification14_spec__1_#t~ret4, __utac_acc__Specification14_spec__1_~tmp~0, __utac_acc__Specification14_spec__1_~tmp___0~0, __utac_acc__Specification14_spec__1_~tmp___1~0, __utac_acc__Specification14_spec__1_~tmp___2~0;havoc __utac_acc__Specification14_spec__1_~tmp~0;havoc __utac_acc__Specification14_spec__1_~tmp___0~0;havoc __utac_acc__Specification14_spec__1_~tmp___1~0;havoc __utac_acc__Specification14_spec__1_~tmp___2~0;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret109, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~24;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~24; 192400#L2393-259 assume !(0 == isFloorCalling_~floorID); 213565#L2397-259 assume 1 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~24 := ~calls_1~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~24; 202251#L2420-259 isExecutiveFloorCalling_#t~ret109 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret109;havoc isExecutiveFloorCalling_#t~ret109;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 202252#L1829-34 __utac_acc__Specification14_spec__1_#t~ret1 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~0 := __utac_acc__Specification14_spec__1_#t~ret1;havoc __utac_acc__Specification14_spec__1_#t~ret1; 213523#L96-8 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~0); 197394#L96-9 cleanup_~i~1 := 1 + cleanup_~i~1; 192335#L2006-2 [2018-12-02 10:38:46,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:38:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash 486409426, now seen corresponding path program 1 times [2018-12-02 10:38:46,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:38:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:38:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:46,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:38:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:38:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:38:46,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:38:46,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:38:46,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 10:38:46,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:38:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1605032911, now seen corresponding path program 1 times [2018-12-02 10:38:46,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:38:46,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:38:46,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:46,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:38:46,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:38:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:38:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:38:46,846 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-12-02 10:38:46,905 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:38:46,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:38:46,906 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:38:46,906 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:38:46,907 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 10:38:46,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:46,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:38:46,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:38:46,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product28_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2018-12-02 10:38:46,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:38:46,907 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:38:46,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:47,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:47,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:47,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:47,208 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:38:47,209 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,222 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_~retValue_acc~24=0, ULTIMATE.start_isFloorCalling_#res=0, ~calls_1~0=0, ULTIMATE.start_isExecutiveFloorCalling_#res=0, ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___2~0=0, ULTIMATE.start_isExecutiveFloorCalling_~retValue_acc~20=0} Honda state: {ULTIMATE.start_isFloorCalling_~retValue_acc~24=0, ULTIMATE.start_isFloorCalling_#res=0, ~calls_1~0=0, ULTIMATE.start_isExecutiveFloorCalling_#res=0, ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___2~0=0, ULTIMATE.start_isExecutiveFloorCalling_~retValue_acc~20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,254 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,254 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret117=0} Honda state: {ULTIMATE.start_cleanup_#t~ret117=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,281 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,281 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret118=0} Honda state: {ULTIMATE.start_cleanup_#t~ret118=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,296 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,298 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret4=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,318 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,318 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret2=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,342 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 /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,360 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~22=0} Honda state: {ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,376 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,376 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,394 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~executiveFloor~0=1, ULTIMATE.start_isFloorCalling_#in~floorID=1, ULTIMATE.start_isFloorCalling_~floorID=1} Honda state: {~executiveFloor~0=1, ULTIMATE.start_isFloorCalling_#in~floorID=1, ULTIMATE.start_isFloorCalling_~floorID=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,411 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,411 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___0~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,428 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___2~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___2~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,446 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,446 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~calls_0~0=-8, ULTIMATE.start_anyStopRequested_~tmp___3~0=-8} Honda state: {~calls_0~0=-8, ULTIMATE.start_anyStopRequested_~tmp___3~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/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 [2018-12-02 10:38:47,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,463 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,463 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret13=0} Honda state: {ULTIMATE.start_isIdle_#t~ret13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,478 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:47,492 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 10:38:47,492 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 /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 10:38:47,495 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36ac02cc-66eb-4e1d-ab02-0c6ca711302e/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:47,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 10:38:47,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 10:38:59,535 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 10:38:59,538 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 10:38:59,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 10:38:59,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 10:38:59,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 10:38:59,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 10:38:59,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 10:38:59,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 10:38:59,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 10:38:59,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product28_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2018-12-02 10:38:59,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 10:38:59,538 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 10:38:59,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:38:59,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 10:39:00,353 WARN L180 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 10:39:00,439 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 10:39:00,443 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 10:39:00,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,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 [2018-12-02 10:39:00,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 10:39:00,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,469 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 10:39:00,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,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 [2018-12-02 10:39:00,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,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 [2018-12-02 10:39:00,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,498 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 10:39:00,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 10:39:00,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,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 [2018-12-02 10:39:00,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,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 [2018-12-02 10:39:00,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 10:39:00,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 10:39:00,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 [2018-12-02 10:39:00,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 10:39:00,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 10:39:00,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 10:39:00,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 10:39:00,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 10:39:00,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 10:39:00,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 10:39:00,529 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 10:39:00,531 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 10:39:00,531 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 10:39:00,532 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 10:39:00,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 10:39:00,533 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 10:39:00,533 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 [] [2018-12-02 10:39:00,534 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 10:39:00,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:39:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:39:00,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:39:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:39:00,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:39:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:39:00,681 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 10:39:00,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24191 states and 45550 transitions. cyclomatic complexity: 21360 Second operand 5 states. [2018-12-02 10:39:01,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24191 states and 45550 transitions. cyclomatic complexity: 21360. Second operand 5 states. Result 29080 states and 54742 transitions. Complement of second has 8 states. [2018-12-02 10:39:01,137 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 [2018-12-02 10:39:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 10:39:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22815 transitions. [2018-12-02 10:39:01,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22815 transitions. Stem has 58 letters. Loop has 22 letters. [2018-12-02 10:39:01,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:39:01,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22815 transitions. Stem has 80 letters. Loop has 22 letters. [2018-12-02 10:39:01,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:39:01,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22815 transitions. Stem has 58 letters. Loop has 44 letters. [2018-12-02 10:39:01,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 10:39:01,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29080 states and 54742 transitions. [2018-12-02 10:39:01,233 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 10:39:01,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29080 states to 0 states and 0 transitions. [2018-12-02 10:39:01,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 10:39:01,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 10:39:01,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 10:39:01,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 10:39:01,234 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:39:01,234 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:39:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:39:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:39:01,234 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-02 10:39:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:39:01,234 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 10:39:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 10:39:01,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 10:39:01,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 10:39:01,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 10:39:01,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 10:39:01,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 10:39:01,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 10:39:01,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 10:39:01,234 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:39:01,235 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:39:01,235 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 10:39:01,235 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 10:39:01,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 10:39:01,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 10:39:01,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 10:39:01,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 10:39:01 BoogieIcfgContainer [2018-12-02 10:39:01,239 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 10:39:01,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 10:39:01,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 10:39:01,239 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 10:39:01,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:38:33" (3/4) ... [2018-12-02 10:39:01,242 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 10:39:01,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 10:39:01,243 INFO L168 Benchmark]: Toolchain (without parser) took 37377.36 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 956.0 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 645.8 MB. Max. memory is 11.5 GB. [2018-12-02 10:39:01,243 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:39:01,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -99.7 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-02 10:39:01,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 239.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 928.0 MB in the end (delta: 127.7 MB). Peak memory consumption was 127.7 MB. Max. memory is 11.5 GB. [2018-12-02 10:39:01,244 INFO L168 Benchmark]: Boogie Preprocessor took 355.60 ms. Allocated memory is still 1.1 GB. Free memory was 928.0 MB in the beginning and 981.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. [2018-12-02 10:39:01,244 INFO L168 Benchmark]: RCFGBuilder took 8724.17 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 827.9 MB). Free memory was 981.9 MB in the beginning and 1.0 GB in the end (delta: -59.8 MB). Peak memory consumption was 797.4 MB. Max. memory is 11.5 GB. [2018-12-02 10:39:01,245 INFO L168 Benchmark]: BuchiAutomizer took 27612.81 ms. Allocated memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:39:01,245 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 3.4 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:39:01,247 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -99.7 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 239.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 928.0 MB in the end (delta: 127.7 MB). Peak memory consumption was 127.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 355.60 ms. Allocated memory is still 1.1 GB. Free memory was 928.0 MB in the beginning and 981.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8724.17 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 827.9 MB). Free memory was 981.9 MB in the beginning and 1.0 GB in the end (delta: -59.8 MB). Peak memory consumption was 797.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27612.81 ms. Allocated memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 3.4 GB. Free memory is still 2.7 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 14.1s. Construction of modules took 5.7s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 1 MinimizatonAttempts, 155363 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had 24191 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 73958 SDtfs, 356984 SDslu, 478602 SDs, 0 SdLazy, 13791 SolverSat, 1351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq220 hnf86 smp100 dnf157 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...