./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 669200e45e1afee8a0f15d0fcb8e259472bfb6db ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:23:20,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:23:20,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:23:20,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:23:20,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:23:20,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:23:20,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:23:20,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:23:20,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:23:20,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:23:20,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:23:20,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:23:20,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:23:20,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:23:20,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:23:20,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:23:20,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:23:20,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:23:20,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:23:20,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:23:20,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:23:20,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:23:20,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:23:20,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:23:20,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:23:20,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:23:20,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:23:20,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:23:20,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:23:20,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:23:20,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:23:20,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:23:20,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:23:20,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:23:20,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:23:20,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:23:20,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:23:20,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:23:20,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:23:20,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:23:20,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:23:20,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:23:20,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:23:20,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:23:20,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:23:20,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:23:20,714 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:23:20,714 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:23:20,714 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:23:20,715 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:23:20,715 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:23:20,715 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:23:20,715 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:23:20,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:23:20,716 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:23:20,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:23:20,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:23:20,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:23:20,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:23:20,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:23:20,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:23:20,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:23:20,717 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:23:20,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:23:20,718 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:23:20,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:23:20,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:23:20,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:23:20,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:23:20,719 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:23:20,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:23:20,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:23:20,729 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:23:20,730 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:23:20,730 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 669200e45e1afee8a0f15d0fcb8e259472bfb6db [2019-11-15 23:23:20,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:23:20,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:23:20,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:23:20,787 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:23:20,788 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:23:20,788 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2019-11-15 23:23:20,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/data/d85122ea3/e9a49d6b45d44fe2a658f02870305d4d/FLAG5d3119a3b [2019-11-15 23:23:21,401 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:23:21,402 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2019-11-15 23:23:21,438 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/data/d85122ea3/e9a49d6b45d44fe2a658f02870305d4d/FLAG5d3119a3b [2019-11-15 23:23:21,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/data/d85122ea3/e9a49d6b45d44fe2a658f02870305d4d [2019-11-15 23:23:21,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:23:21,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:23:21,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:23:21,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:23:21,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:23:21,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:23:21" (1/1) ... [2019-11-15 23:23:21,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cab1254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:21, skipping insertion in model container [2019-11-15 23:23:21,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:23:21" (1/1) ... [2019-11-15 23:23:21,668 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:23:21,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:23:22,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:23:22,329 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:23:22,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:23:22,565 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:23:22,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22 WrapperNode [2019-11-15 23:23:22,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:23:22,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:23:22,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:23:22,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:23:22,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:22,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:22,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:23:22,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:23:22,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:23:22,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:23:22,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:22,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:22,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:22,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:23,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:23,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:23,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... [2019-11-15 23:23:23,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:23:23,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:23:23,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:23:23,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:23:23,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:23:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:23:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:23:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:23:23,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:23:32,571 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:23:32,571 INFO L284 CfgBuilder]: Removed 1233 assume(true) statements. [2019-11-15 23:23:32,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:23:32 BoogieIcfgContainer [2019-11-15 23:23:32,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:23:32,576 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:23:32,576 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:23:32,579 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:23:32,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:23:32,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:23:21" (1/3) ... [2019-11-15 23:23:32,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c9bf17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:23:32, skipping insertion in model container [2019-11-15 23:23:32,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:23:32,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:22" (2/3) ... [2019-11-15 23:23:32,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c9bf17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:23:32, skipping insertion in model container [2019-11-15 23:23:32,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:23:32,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:23:32" (3/3) ... [2019-11-15 23:23:32,584 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2019-11-15 23:23:32,629 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:23:32,630 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:23:32,630 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:23:32,630 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:23:32,630 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:23:32,631 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:23:32,631 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:23:32,631 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:23:32,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5039 states. [2019-11-15 23:23:32,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2509 [2019-11-15 23:23:32,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:32,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:32,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:32,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:32,853 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:23:32,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5039 states. [2019-11-15 23:23:32,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2509 [2019-11-15 23:23:32,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:32,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:32,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:32,917 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:32,923 INFO L791 eck$LassoCheckResult]: Stem: 3172#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~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~string55.base, #t~string55.offset := #Ultimate.allocOnStack(10);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(95, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(93, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string59.base, #t~string59.offset, 1);call write~init~int(93, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string61.base, #t~string61.offset, 1);call write~init~int(97, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(32, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string63.base, #t~string63.offset, 1);call write~init~int(105, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(10);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string67.base, #t~string67.offset, 1);call write~init~int(112, #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.allocOnStack(5);call write~init~int(100, #t~string69.base, #t~string69.offset, 1);call write~init~int(111, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(119, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(73, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(76, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 3 + #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 4 + #t~string71.offset, 1);call write~init~int(58, #t~string71.base, 5 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 6 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(37, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(105, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 3 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(6);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(70, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(112, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(58, #t~string83.base, 4 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 5 + #t~string83.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string100.base, #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 1 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(30);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(21);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(30);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(9);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(21);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(25);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(25);~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 4153#L-1true havoc main_#res;havoc main_#t~ret157, main_~retValue_acc~29, main_~tmp~27;havoc main_~retValue_acc~29;havoc main_~tmp~27; 1895#L853true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 249#L861true main_#t~ret157 := valid_product_#res;main_~tmp~27 := main_#t~ret157;havoc main_#t~ret157; 597#L3338true assume 0 != main_~tmp~27; 2247#L3312true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3413#L2855true havoc bigMacCall_#t~ret150, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 938#L753true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 869#L778true bigMacCall_#t~ret150 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret150;havoc bigMacCall_#t~ret150;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1292#L399true assume 0 == initPersonOnFloor_~floor; 986#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 193#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 4535#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 2801#L203-2true havoc cleanup_#t~ret151, cleanup_#t~ret152, cleanup_~i~1, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 664#L1137true timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 2146#L2080true assume 0 != timeShift_~tmp~12; 2314#L2081true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 668#L1753-11true havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 72#L1128-6true __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 1597#L1188-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 749#L1220-12true __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 688#L2898true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~5;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 4052#L2908-1true cleanup_~i~1 := 0; 379#L3144-2true [2019-11-15 23:23:32,924 INFO L793 eck$LassoCheckResult]: Loop: 379#L3144-2true assume !false; 360#L3145true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 277#L3148true assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 201#L950true cleanup_#t~ret151 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret151;havoc cleanup_#t~ret151; 207#L3152true assume 1 != cleanup_~tmp___0~9; 209#L3152-1true havoc isIdle_#res;havoc isIdle_#t~ret9, isIdle_~retValue_acc~15, isIdle_~tmp~4;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1718#L128-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 219#L155-50true anyStopRequested_#t~ret4 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret4;havoc anyStopRequested_#t~ret4; 4127#L1236true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 153#L1300true isIdle_#t~ret9 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret9;havoc isIdle_#t~ret9;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 674#L1313true cleanup_#t~ret152 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 505#L3164true assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 667#L1137-2true timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 2145#L2080-1true assume 0 != timeShift_~tmp~12; 2317#L2081-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 654#L1753-23true havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 64#L1128-13true __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 1566#L1188-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 728#L1220-25true __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 691#L2898-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~5;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 4029#L2908-3true cleanup_~i~1 := 1 + cleanup_~i~1; 379#L3144-2true [2019-11-15 23:23:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 235059287, now seen corresponding path program 1 times [2019-11-15 23:23:32,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:32,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646984671] [2019-11-15 23:23:32,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:32,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:32,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:33,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646984671] [2019-11-15 23:23:33,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:23:33,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:23:33,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469696363] [2019-11-15 23:23:33,226 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:23:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2025712606, now seen corresponding path program 1 times [2019-11-15 23:23:33,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:33,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720087802] [2019-11-15 23:23:33,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:33,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:33,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:33,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720087802] [2019-11-15 23:23:33,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:23:33,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:23:33,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432603676] [2019-11-15 23:23:33,266 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:23:33,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:23:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:23:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:23:33,283 INFO L87 Difference]: Start difference. First operand 5039 states. Second operand 4 states. [2019-11-15 23:23:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:23:34,488 INFO L93 Difference]: Finished difference Result 13293 states and 25069 transitions. [2019-11-15 23:23:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:23:34,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13293 states and 25069 transitions. [2019-11-15 23:23:34,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9073 [2019-11-15 23:23:34,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13293 states to 13251 states and 25020 transitions. [2019-11-15 23:23:34,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13251 [2019-11-15 23:23:34,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13251 [2019-11-15 23:23:34,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13251 states and 25020 transitions. [2019-11-15 23:23:34,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:23:34,818 INFO L688 BuchiCegarLoop]: Abstraction has 13251 states and 25020 transitions. [2019-11-15 23:23:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states and 25020 transitions. [2019-11-15 23:23:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 5029. [2019-11-15 23:23:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2019-11-15 23:23:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 9482 transitions. [2019-11-15 23:23:35,060 INFO L711 BuchiCegarLoop]: Abstraction has 5029 states and 9482 transitions. [2019-11-15 23:23:35,061 INFO L591 BuchiCegarLoop]: Abstraction has 5029 states and 9482 transitions. [2019-11-15 23:23:35,061 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:23:35,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5029 states and 9482 transitions. [2019-11-15 23:23:35,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2511 [2019-11-15 23:23:35,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:35,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:35,092 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:35,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:35,092 INFO L791 eck$LassoCheckResult]: Stem: 22189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~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~string55.base, #t~string55.offset := #Ultimate.allocOnStack(10);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(95, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(93, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string59.base, #t~string59.offset, 1);call write~init~int(93, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string61.base, #t~string61.offset, 1);call write~init~int(97, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(32, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string63.base, #t~string63.offset, 1);call write~init~int(105, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(10);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string67.base, #t~string67.offset, 1);call write~init~int(112, #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.allocOnStack(5);call write~init~int(100, #t~string69.base, #t~string69.offset, 1);call write~init~int(111, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(119, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(73, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(76, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 3 + #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 4 + #t~string71.offset, 1);call write~init~int(58, #t~string71.base, 5 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 6 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(37, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(105, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 3 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(6);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(70, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(112, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(58, #t~string83.base, 4 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 5 + #t~string83.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string100.base, #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 1 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(30);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(21);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(30);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(9);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(21);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(25);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(25);~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 22190#L-1 havoc main_#res;havoc main_#t~ret157, main_~retValue_acc~29, main_~tmp~27;havoc main_~retValue_acc~29;havoc main_~tmp~27; 20972#L853 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 18822#L861 main_#t~ret157 := valid_product_#res;main_~tmp~27 := main_#t~ret157;havoc main_#t~ret157; 18823#L3338 assume 0 != main_~tmp~27; 19458#L3312 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 21296#L2855 havoc bigMacCall_#t~ret150, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 19813#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 18829#L778 bigMacCall_#t~ret150 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret150;havoc bigMacCall_#t~ret150;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 19747#L399 assume 0 == initPersonOnFloor_~floor; 19909#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 18361#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 18733#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 21799#L203-2 havoc cleanup_#t~ret151, cleanup_#t~ret152, cleanup_~i~1, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19540#L1137 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 19541#L2080 assume 0 != timeShift_~tmp~12; 21244#L2081 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 19547#L1753-11 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 18496#L1128-6 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 18497#L1188-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 19097#L1220-12 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 19566#L2898 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19544#L1137-1 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 19545#L2908 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~8); 21795#L2908-1 cleanup_~i~1 := 0; 19028#L3144-2 [2019-11-15 23:23:35,093 INFO L793 eck$LassoCheckResult]: Loop: 19028#L3144-2 assume !false; 19009#L3145 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 18866#L3148 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 18751#L950 cleanup_#t~ret151 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret151;havoc cleanup_#t~ret151; 18752#L3152 assume 1 != cleanup_~tmp___0~9; 18764#L3152-1 havoc isIdle_#res;havoc isIdle_#t~ret9, isIdle_~retValue_acc~15, isIdle_~tmp~4;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 18767#L128-50 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 18783#L155-50 anyStopRequested_#t~ret4 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret4;havoc anyStopRequested_#t~ret4; 18784#L1236 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 18657#L1300 isIdle_#t~ret9 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret9;havoc isIdle_#t~ret9;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 18658#L1313 cleanup_#t~ret152 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 19263#L3164 assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19264#L1137-2 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 19546#L2080-1 assume 0 != timeShift_~tmp~12; 21243#L2081-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 19524#L1753-23 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 18475#L1128-13 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 18476#L1188-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 19056#L1220-25 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 19569#L2898-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19522#L1137-3 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 19523#L2908-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~8); 21788#L2908-3 cleanup_~i~1 := 1 + cleanup_~i~1; 19028#L3144-2 [2019-11-15 23:23:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1740912844, now seen corresponding path program 1 times [2019-11-15 23:23:35,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:35,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044814532] [2019-11-15 23:23:35,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:35,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:35,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:35,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044814532] [2019-11-15 23:23:35,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:23:35,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:23:35,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901917094] [2019-11-15 23:23:35,233 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:23:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:35,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1090392987, now seen corresponding path program 1 times [2019-11-15 23:23:35,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:35,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480597252] [2019-11-15 23:23:35,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:35,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:35,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:35,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480597252] [2019-11-15 23:23:35,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:23:35,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:23:35,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737578448] [2019-11-15 23:23:35,286 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:23:35,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:23:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:23:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:23:35,286 INFO L87 Difference]: Start difference. First operand 5029 states and 9482 transitions. cyclomatic complexity: 4454 Second operand 7 states. [2019-11-15 23:23:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:23:36,045 INFO L93 Difference]: Finished difference Result 8306 states and 15521 transitions. [2019-11-15 23:23:36,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:23:36,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8306 states and 15521 transitions. [2019-11-15 23:23:36,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6659 [2019-11-15 23:23:36,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8306 states to 8306 states and 15521 transitions. [2019-11-15 23:23:36,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8306 [2019-11-15 23:23:36,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8306 [2019-11-15 23:23:36,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8306 states and 15521 transitions. [2019-11-15 23:23:36,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:23:36,182 INFO L688 BuchiCegarLoop]: Abstraction has 8306 states and 15521 transitions. [2019-11-15 23:23:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8306 states and 15521 transitions. [2019-11-15 23:23:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8306 to 4497. [2019-11-15 23:23:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4497 states. [2019-11-15 23:23:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 8443 transitions. [2019-11-15 23:23:36,312 INFO L711 BuchiCegarLoop]: Abstraction has 4497 states and 8443 transitions. [2019-11-15 23:23:36,312 INFO L591 BuchiCegarLoop]: Abstraction has 4497 states and 8443 transitions. [2019-11-15 23:23:36,313 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:23:36,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4497 states and 8443 transitions. [2019-11-15 23:23:36,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2879 [2019-11-15 23:23:36,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:36,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:36,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:36,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:23:36,341 INFO L791 eck$LassoCheckResult]: Stem: 34745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~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~string55.base, #t~string55.offset := #Ultimate.allocOnStack(10);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(95, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(93, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string59.base, #t~string59.offset, 1);call write~init~int(93, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string61.base, #t~string61.offset, 1);call write~init~int(97, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(32, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string63.base, #t~string63.offset, 1);call write~init~int(105, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(10);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string67.base, #t~string67.offset, 1);call write~init~int(112, #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.allocOnStack(5);call write~init~int(100, #t~string69.base, #t~string69.offset, 1);call write~init~int(111, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(119, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(73, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(76, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 3 + #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 4 + #t~string71.offset, 1);call write~init~int(58, #t~string71.base, 5 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 6 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(37, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(105, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 3 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(6);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(70, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(112, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(58, #t~string83.base, 4 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 5 + #t~string83.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string100.base, #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 1 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(30);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(21);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(30);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(9);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(21);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(25);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(25);~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 34746#L-1 havoc main_#res;havoc main_#t~ret157, main_~retValue_acc~29, main_~tmp~27;havoc main_~retValue_acc~29;havoc main_~tmp~27; 33772#L853 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 32110#L861 main_#t~ret157 := valid_product_#res;main_~tmp~27 := main_#t~ret157;havoc main_#t~ret157; 32111#L3338 assume 0 != main_~tmp~27; 32577#L3312 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 34031#L2855 havoc bigMacCall_#t~ret150, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 32878#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 32113#L778 bigMacCall_#t~ret150 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret150;havoc bigMacCall_#t~ret150;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 32794#L399 assume 0 == initPersonOnFloor_~floor; 32965#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 31734#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 32043#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 34435#L203-2 havoc cleanup_#t~ret151, cleanup_#t~ret152, cleanup_~i~1, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 32636#L1137 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 32637#L2080 assume 0 != timeShift_~tmp~12; 33984#L2081 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 32641#L1753-11 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 31852#L1128-6 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 31853#L1188-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 32302#L1220-12 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 32658#L2898 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 32638#L1137-1 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 32639#L2908 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~8; 35300#L2909 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 35170#L2910 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 34432#L2908-1 cleanup_~i~1 := 0; 35280#L3144-2 [2019-11-15 23:23:36,342 INFO L793 eck$LassoCheckResult]: Loop: 35280#L3144-2 assume !false; 35757#L3145 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 35756#L3148 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 35755#L950 cleanup_#t~ret151 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret151;havoc cleanup_#t~ret151; 35754#L3152 assume 1 != cleanup_~tmp___0~9; 35753#L3152-1 havoc isIdle_#res;havoc isIdle_#t~ret9, isIdle_~retValue_acc~15, isIdle_~tmp~4;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 35747#L128-50 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 35742#L155-50 anyStopRequested_#t~ret4 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret4;havoc anyStopRequested_#t~ret4; 35732#L1236 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 35727#L1300 isIdle_#t~ret9 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret9;havoc isIdle_#t~ret9;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 35726#L1313 cleanup_#t~ret152 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 35725#L3164 assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 35724#L1137-2 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 33982#L2080-1 assume 0 != timeShift_~tmp~12; 33983#L2081-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 32626#L1753-23 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 31838#L1128-13 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 31839#L1188-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 32973#L1220-25 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 32661#L2898-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 32624#L1137-3 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 32625#L2908-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~8; 35302#L2909-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 35353#L2910-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 35279#L2908-3 cleanup_~i~1 := 1 + cleanup_~i~1; 35280#L3144-2 [2019-11-15 23:23:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2018478799, now seen corresponding path program 1 times [2019-11-15 23:23:36,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:36,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116203983] [2019-11-15 23:23:36,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:36,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:36,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:36,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116203983] [2019-11-15 23:23:36,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:23:36,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:23:36,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192595232] [2019-11-15 23:23:36,420 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:23:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash -105498602, now seen corresponding path program 1 times [2019-11-15 23:23:36,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:36,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762932323] [2019-11-15 23:23:36,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:36,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:36,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:36,481 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:36,801 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-11-15 23:23:37,218 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-11-15 23:23:37,229 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:23:37,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:23:37,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:23:37,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:23:37,230 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:23:37,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:23:37,230 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:23:37,230 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:23:37,230 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product28.cil.c_Iteration3_Loop [2019-11-15 23:23:37,230 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:23:37,232 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:23:37,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:37,928 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:23:37,934 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/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 [2019-11-15 23:23:37,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:23:37,943 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00a37263-cc7b-4366-a202-2ad04ffa9ca6/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:23:37,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:23:37,977 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:23:50,006 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-15 23:23:50,009 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:23:50,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:23:50,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:23:50,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:23:50,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:23:50,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:23:50,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:23:50,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:23:50,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product28.cil.c_Iteration3_Loop [2019-11-15 23:23:50,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:23:50,010 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:23:50,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:50,469 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 23:23:50,756 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:23:50,761 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:23:50,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,765 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:23:50,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,768 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:23:50,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,797 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:23:50,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,798 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:23:50,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,824 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,832 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:23:50,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,833 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:23:50,833 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,845 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,845 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,856 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,856 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:50,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:50,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:50,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:50,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:50,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:50,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:50,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:50,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:50,865 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:23:50,869 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:23:50,869 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:23:50,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:23:50,871 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:23:50,871 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:23:50,872 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-11-15 23:23:50,873 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:23:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:51,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:23:51,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:23:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:51,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:23:51,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:23:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:51,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:23:51,108 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4497 states and 8443 transitions. cyclomatic complexity: 3947 Second operand 5 states. [2019-11-15 23:23:51,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4497 states and 8443 transitions. cyclomatic complexity: 3947. Second operand 5 states. Result 7376 states and 13851 transitions. Complement of second has 8 states. [2019-11-15 23:23:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:23:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:23:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7177 transitions. [2019-11-15 23:23:51,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7177 transitions. Stem has 27 letters. Loop has 25 letters. [2019-11-15 23:23:51,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:51,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7177 transitions. Stem has 52 letters. Loop has 25 letters. [2019-11-15 23:23:51,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:51,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7177 transitions. Stem has 27 letters. Loop has 50 letters. [2019-11-15 23:23:51,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:51,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7376 states and 13851 transitions. [2019-11-15 23:23:51,651 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:23:51,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7376 states to 0 states and 0 transitions. [2019-11-15 23:23:51,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:23:51,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:23:51,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:23:51,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:23:51,652 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:51,652 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:51,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:23:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:23:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:23:51,654 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 23:23:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:23:51,654 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 23:23:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:23:51,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 23:23:51,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:23:51,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:23:51,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:23:51,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:23:51,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:23:51,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:23:51,655 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:51,655 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:51,655 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:51,656 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:23:51,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:23:51,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:23:51,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:23:51,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:23:51 BoogieIcfgContainer [2019-11-15 23:23:51,662 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:23:51,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:23:51,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:23:51,663 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:23:51,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:23:32" (3/4) ... [2019-11-15 23:23:51,666 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:23:51,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:23:51,669 INFO L168 Benchmark]: Toolchain (without parser) took 30016.59 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 615.5 MB). Free memory was 946.1 MB in the beginning and 1.3 GB in the end (delta: -307.3 MB). Peak memory consumption was 308.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:51,669 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:23:51,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 913.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:51,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 379.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:51,672 INFO L168 Benchmark]: Boogie Preprocessor took 334.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:51,677 INFO L168 Benchmark]: RCFGBuilder took 9294.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 425.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:51,678 INFO L168 Benchmark]: BuchiAutomizer took 19085.82 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 217.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -231.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:23:51,678 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:23:51,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 913.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 379.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 334.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9294.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 425.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19085.82 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 217.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -231.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 15.0s. Construction of modules took 0.6s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 12031 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 5029 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31375 SDtfs, 60377 SDslu, 70745 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...