./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product26.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/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/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 6918e197f4f4b34e9e598cdd0f1a12bdba0c59a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:14,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:14,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:14,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:14,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:14,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:14,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:14,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:14,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:14,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:14,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:14,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:14,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:14,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:14,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:14,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:14,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:14,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:14,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:14,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:14,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:14,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:14,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:14,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:14,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:14,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:14,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:14,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:14,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:14,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:14,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:14,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:14,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:14,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:14,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:14,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:14,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:14,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:14,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:14,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:14,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:14,163 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:14,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:14,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:14,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:14,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:14,180 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:14,180 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:14,181 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:14,181 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:14,182 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:14,182 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:14,183 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:14,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:14,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:14,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:14,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:14,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:14,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:14,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:14,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:14,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:14,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:14,185 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:14,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:14,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:14,186 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:14,186 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:14,186 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/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/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 -> 6918e197f4f4b34e9e598cdd0f1a12bdba0c59a1 [2019-10-22 08:57:14,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:14,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:14,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:14,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:14,232 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:14,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2019-10-22 08:57:14,294 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/data/3db51ecb6/a6a34208a8d34922ad4f55db7d42acb3/FLAG33b86b9bf [2019-10-22 08:57:14,769 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:14,769 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2019-10-22 08:57:14,793 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/data/3db51ecb6/a6a34208a8d34922ad4f55db7d42acb3/FLAG33b86b9bf [2019-10-22 08:57:15,071 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/data/3db51ecb6/a6a34208a8d34922ad4f55db7d42acb3 [2019-10-22 08:57:15,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:15,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:15,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:15,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:15,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:15,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:15,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75fa68a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15, skipping insertion in model container [2019-10-22 08:57:15,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:15,089 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:15,162 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:15,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:15,685 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:15,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:15,861 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:15,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15 WrapperNode [2019-10-22 08:57:15,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:15,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:15,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:15,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:15,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:15,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:16,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:16,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:16,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:16,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... [2019-10-22 08:57:16,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:16,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:16,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:16,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:16,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/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-10-22 08:57:16,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:16,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 08:57:16,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:16,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:24,559 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:24,559 INFO L284 CfgBuilder]: Removed 1113 assume(true) statements. [2019-10-22 08:57:24,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:24 BoogieIcfgContainer [2019-10-22 08:57:24,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:24,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:24,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:24,565 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:24,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:24,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:15" (1/3) ... [2019-10-22 08:57:24,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a66de86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:24, skipping insertion in model container [2019-10-22 08:57:24,568 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:24,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:15" (2/3) ... [2019-10-22 08:57:24,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a66de86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:24, skipping insertion in model container [2019-10-22 08:57:24,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:24,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:24" (3/3) ... [2019-10-22 08:57:24,571 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2019-10-22 08:57:24,615 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:24,616 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:24,616 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:24,616 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:24,616 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:24,616 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:24,616 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:24,616 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:24,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2019-10-22 08:57:24,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2019-10-22 08:57:24,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:24,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:24,845 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-10-22 08:57:24,846 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-10-22 08:57:24,846 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:24,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2019-10-22 08:57:24,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2019-10-22 08:57:24,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:24,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:24,894 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-10-22 08:57:24,894 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-10-22 08:57:24,899 INFO L791 eck$LassoCheckResult]: Stem: 2215#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(10);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 3589#L-1true havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 554#L3249true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 3647#L3257true main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 1314#L3122true assume 0 != main_~tmp~25; 4520#L3094true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3699#L440true havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 1216#L3305true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 132#L3330true bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 4631#L2473true assume 0 == initPersonOnFloor_~floor; 4841#L2474true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1822#L2581-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 402#L2265true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 670#L2277-2true havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 363#L854true timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 436#L1736true assume 0 != timeShift_~tmp~14; 380#L1737true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2813#L1441-11true havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1633#L845true __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 1996#L905-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 1467#L937-12true __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 1229#L483true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1613#L493-1true cleanup_~i~1 := 0; 2417#L2926-2true [2019-10-22 08:57:24,900 INFO L793 eck$LassoCheckResult]: Loop: 2417#L2926-2true assume !false; 2131#L2927true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1881#L2930true assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 1664#L668true cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 1785#L2934true assume 1 != cleanup_~tmp___0~7; 1791#L2934-1true havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 3384#L2202-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 3056#L2229-42true anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 788#L953true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 879#L1017true isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 369#L1030true cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 1310#L2946true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 358#L854-2true timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 435#L1736-1true assume 0 != timeShift_~tmp~14; 382#L1737-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2954#L1441-23true havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1635#L845-1true __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 1979#L905-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 1536#L937-25true __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 1232#L483-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1619#L493-3true cleanup_~i~1 := 1 + cleanup_~i~1; 2417#L2926-2true [2019-10-22 08:57:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2120884841, now seen corresponding path program 1 times [2019-10-22 08:57:24,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580840308] [2019-10-22 08:57:24,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:25,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580840308] [2019-10-22 08:57:25,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:25,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865934422] [2019-10-22 08:57:25,209 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 467648044, now seen corresponding path program 1 times [2019-10-22 08:57:25,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999014373] [2019-10-22 08:57:25,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:25,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999014373] [2019-10-22 08:57:25,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:25,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035582068] [2019-10-22 08:57:25,245 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:25,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:25,262 INFO L87 Difference]: Start difference. First operand 4855 states. Second operand 4 states. [2019-10-22 08:57:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,042 INFO L93 Difference]: Finished difference Result 12925 states and 24453 transitions. [2019-10-22 08:57:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:26,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12925 states and 24453 transitions. [2019-10-22 08:57:26,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8797 [2019-10-22 08:57:26,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12925 states to 12883 states and 24404 transitions. [2019-10-22 08:57:26,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12883 [2019-10-22 08:57:26,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12883 [2019-10-22 08:57:26,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12883 states and 24404 transitions. [2019-10-22 08:57:26,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:26,272 INFO L688 BuchiCegarLoop]: Abstraction has 12883 states and 24404 transitions. [2019-10-22 08:57:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12883 states and 24404 transitions. [2019-10-22 08:57:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12883 to 4845. [2019-10-22 08:57:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2019-10-22 08:57:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 9174 transitions. [2019-10-22 08:57:26,477 INFO L711 BuchiCegarLoop]: Abstraction has 4845 states and 9174 transitions. [2019-10-22 08:57:26,477 INFO L591 BuchiCegarLoop]: Abstraction has 4845 states and 9174 transitions. [2019-10-22 08:57:26,478 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:26,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4845 states and 9174 transitions. [2019-10-22 08:57:26,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2419 [2019-10-22 08:57:26,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:26,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:26,505 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-10-22 08:57:26,505 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-10-22 08:57:26,505 INFO L791 eck$LassoCheckResult]: Stem: 20658#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(10);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 20659#L-1 havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 18782#L3249 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 18783#L3257 main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 19590#L3122 assume 0 != main_~tmp~25; 19591#L3094 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 22013#L440 havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 19481#L3305 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 18131#L3330 bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 18132#L2473 assume 0 == initPersonOnFloor_~floor; 22631#L2474 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 18148#L2581-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 18532#L2265 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 18082#L2277-2 havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18473#L854 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 18474#L1736 assume 0 != timeShift_~tmp~14; 18498#L1737 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 18499#L1441-11 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 19861#L845 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 19862#L905-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 19432#L937-12 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 19497#L483 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18475#L854-1 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 18476#L493 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 17819#L493-1 cleanup_~i~1 := 0; 19842#L2926-2 [2019-10-22 08:57:26,506 INFO L793 eck$LassoCheckResult]: Loop: 19842#L2926-2 assume !false; 20547#L2927 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 20213#L2930 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 19867#L668 cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 19868#L2934 assume 1 != cleanup_~tmp___0~7; 20084#L2934-1 havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 20094#L2202-42 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 20844#L2229-42 anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 18991#L953 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 18984#L1017 isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 18485#L1030 cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 18486#L2946 assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18463#L854-2 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 18464#L1736-1 assume 0 != timeShift_~tmp~14; 18504#L1737-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 18505#L1441-23 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 19863#L845-1 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 19864#L905-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 19366#L937-25 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 19500#L483-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18465#L854-3 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 18466#L493-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 18155#L493-3 cleanup_~i~1 := 1 + cleanup_~i~1; 19842#L2926-2 [2019-10-22 08:57:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1939500596, now seen corresponding path program 1 times [2019-10-22 08:57:26,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761003400] [2019-10-22 08:57:26,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761003400] [2019-10-22 08:57:26,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:26,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842179725] [2019-10-22 08:57:26,583 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1561055767, now seen corresponding path program 1 times [2019-10-22 08:57:26,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053045407] [2019-10-22 08:57:26,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053045407] [2019-10-22 08:57:26,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:26,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646919703] [2019-10-22 08:57:26,649 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:26,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:26,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:26,650 INFO L87 Difference]: Start difference. First operand 4845 states and 9174 transitions. cyclomatic complexity: 4330 Second operand 7 states. [2019-10-22 08:57:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,510 INFO L93 Difference]: Finished difference Result 7976 states and 14976 transitions. [2019-10-22 08:57:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 08:57:27,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7976 states and 14976 transitions. [2019-10-22 08:57:27,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6395 [2019-10-22 08:57:27,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7976 states to 7976 states and 14976 transitions. [2019-10-22 08:57:27,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7976 [2019-10-22 08:57:27,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7976 [2019-10-22 08:57:27,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7976 states and 14976 transitions. [2019-10-22 08:57:27,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:27,612 INFO L688 BuchiCegarLoop]: Abstraction has 7976 states and 14976 transitions. [2019-10-22 08:57:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states and 14976 transitions. [2019-10-22 08:57:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 4319. [2019-10-22 08:57:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2019-10-22 08:57:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 8148 transitions. [2019-10-22 08:57:27,710 INFO L711 BuchiCegarLoop]: Abstraction has 4319 states and 8148 transitions. [2019-10-22 08:57:27,710 INFO L591 BuchiCegarLoop]: Abstraction has 4319 states and 8148 transitions. [2019-10-22 08:57:27,710 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:27,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4319 states and 8148 transitions. [2019-10-22 08:57:27,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2767 [2019-10-22 08:57:27,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:27,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:27,728 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-10-22 08:57:27,728 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-10-22 08:57:27,728 INFO L791 eck$LassoCheckResult]: Stem: 32891#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(10);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 32892#L-1 havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 31420#L3249 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 31421#L3257 main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 32037#L3122 assume 0 != main_~tmp~25; 32038#L3094 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 33955#L440 havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 31950#L3305 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 30911#L3330 bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 30912#L2473 assume 0 == initPersonOnFloor_~floor; 34450#L2474 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 30927#L2581-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 31225#L2265 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 30873#L2277-2 havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31173#L854 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 31174#L1736 assume 0 != timeShift_~tmp~14; 31194#L1737 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 31195#L1441-11 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 32250#L845 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 32251#L905-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 31908#L937-12 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 31960#L483 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31175#L854-1 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 31176#L493 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 32196#L494 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 32197#L495 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 30680#L493-1 cleanup_~i~1 := 0; 34706#L2926-2 [2019-10-22 08:57:27,728 INFO L793 eck$LassoCheckResult]: Loop: 34706#L2926-2 assume !false; 34705#L2927 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 34704#L2930 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 34703#L668 cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 34702#L2934 assume 1 != cleanup_~tmp___0~7; 32422#L2934-1 havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 32423#L2202-42 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 33040#L2229-42 anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 31575#L953 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 31565#L1017 isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 34466#L1030 cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 32033#L2946 assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31163#L854-2 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 31164#L1736-1 assume 0 != timeShift_~tmp~14; 31200#L1737-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 31201#L1441-23 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 32252#L845-1 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 32253#L905-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 34725#L937-25 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 31963#L483-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31165#L854-3 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 31166#L493-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 32198#L494-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 32199#L495-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 34707#L493-3 cleanup_~i~1 := 1 + cleanup_~i~1; 34706#L2926-2 [2019-10-22 08:57:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash -157269105, now seen corresponding path program 1 times [2019-10-22 08:57:27,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667677643] [2019-10-22 08:57:27,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667677643] [2019-10-22 08:57:27,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:27,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883019007] [2019-10-22 08:57:27,798 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1232168348, now seen corresponding path program 1 times [2019-10-22 08:57:27,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672801671] [2019-10-22 08:57:27,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,840 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,103 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-10-22 08:57:28,401 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-22 08:57:28,415 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:28,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:28,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:28,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:28,416 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:57:28,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:28,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:28,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:28,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26.cil.c_Iteration3_Loop [2019-10-22 08:57:28,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:28,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:28,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,933 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:28,934 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/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-10-22 08:57:28,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:28,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:28,952 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:28,952 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:28,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:28,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:28,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:28,986 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:28,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:28,996 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,018 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:29,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,039 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:29,086 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,087 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:29,097 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,097 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret42=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret42=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:29,109 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,109 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret41=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret41=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:29,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,115 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,121 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~8=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:29,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,128 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,133 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:29,149 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,149 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret45=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret45=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:29,156 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:29,156 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret44=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret44=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:29,161 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8a24e-d3bc-4c50-9fd0-c913937a94d6/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:57:29,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:29,179 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:57:29,181 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:29,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:29,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:29,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:29,181 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:29,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:29,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:29,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26.cil.c_Iteration3_Loop [2019-10-22 08:57:29,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:29,182 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:29,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,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-10-22 08:57:29,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,834 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:29,841 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:29,843 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-10-22 08:57:29,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,850 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-10-22 08:57:29,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,855 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-10-22 08:57:29,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,861 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:29,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,863 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:29,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,875 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-10-22 08:57:29,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,877 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,879 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-10-22 08:57:29,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,880 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,884 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-10-22 08:57:29,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,888 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-10-22 08:57:29,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,897 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-10-22 08:57:29,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,898 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,899 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-10-22 08:57:29,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,904 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-10-22 08:57:29,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,907 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-10-22 08:57:29,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,910 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-10-22 08:57:29,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,911 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,912 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,914 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-10-22 08:57:29,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,916 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-10-22 08:57:29,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,917 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:29,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,918 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:29,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,922 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-10-22 08:57:29,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,924 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-10-22 08:57:29,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,928 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-10-22 08:57:29,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,932 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,932 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,933 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-10-22 08:57:29,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,934 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,935 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,936 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-10-22 08:57:29,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,937 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,937 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:29,937 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,938 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:29,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,954 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-10-22 08:57:29,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,958 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-10-22 08:57:29,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,961 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-10-22 08:57:29,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,965 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-10-22 08:57:29,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,966 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,967 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,968 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-10-22 08:57:29,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,973 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-10-22 08:57:29,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,979 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:29,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,980 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:29,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,984 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-10-22 08:57:29,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,985 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,986 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-10-22 08:57:29,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,988 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-10-22 08:57:29,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,989 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,990 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,991 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-10-22 08:57:29,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,994 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:29,998 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:29,998 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:29,999 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:30,000 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:57:30,000 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:30,000 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-10-22 08:57:30,002 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:57:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:30,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:30,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:30,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:30,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:30,226 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-10-22 08:57:30,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4319 states and 8148 transitions. cyclomatic complexity: 3830 Second operand 5 states. [2019-10-22 08:57:30,635 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4319 states and 8148 transitions. cyclomatic complexity: 3830. Second operand 5 states. Result 7086 states and 13370 transitions. Complement of second has 8 states. [2019-10-22 08:57:30,636 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-10-22 08:57:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:57:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6946 transitions. [2019-10-22 08:57:30,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 27 letters. Loop has 25 letters. [2019-10-22 08:57:30,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:30,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 52 letters. Loop has 25 letters. [2019-10-22 08:57:30,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:30,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 27 letters. Loop has 50 letters. [2019-10-22 08:57:30,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:30,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7086 states and 13370 transitions. [2019-10-22 08:57:30,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:30,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7086 states to 0 states and 0 transitions. [2019-10-22 08:57:30,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:30,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:30,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:30,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:30,682 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:30,682 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:30,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:30,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:30,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:30,683 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 08:57:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:30,683 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 08:57:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:57:30,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 08:57:30,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:30,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:30,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:30,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:30,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:30,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:30,684 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:30,684 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:30,684 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:30,684 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:30,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:30,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:30,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:30,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:30 BoogieIcfgContainer [2019-10-22 08:57:30,693 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:30,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:30,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:30,693 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:30,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:24" (3/4) ... [2019-10-22 08:57:30,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:30,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:30,701 INFO L168 Benchmark]: Toolchain (without parser) took 15626.86 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 793.2 MB). Free memory was 934.1 MB in the beginning and 1.4 GB in the end (delta: -476.2 MB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:30,703 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:30,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:30,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 257.06 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:30,705 INFO L168 Benchmark]: Boogie Preprocessor took 298.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:30,705 INFO L168 Benchmark]: RCFGBuilder took 8143.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:30,706 INFO L168 Benchmark]: BuchiAutomizer took 6130.92 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 322.4 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -200.4 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:30,706 INFO L168 Benchmark]: Witness Printer took 6.77 ms. Allocated memory is still 1.8 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:30,708 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 786.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 257.06 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 298.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8143.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6130.92 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 322.4 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -200.4 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.77 ms. Allocated memory is still 1.8 GB. Free memory is still 1.4 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 6.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.7s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 11695 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 4845 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30400 SDtfs, 58233 SDslu, 68802 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s 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: 19ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...