./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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 093479089abdaadb7e9be964d84aa50a0bea01c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:50:20,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:50:20,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:50:20,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:50:20,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:50:20,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:50:20,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:50:20,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:50:20,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:50:20,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:50:20,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:50:20,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:50:20,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:50:20,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:50:20,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:50:20,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:50:20,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:50:20,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:50:20,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:50:20,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:50:20,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:50:20,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:50:20,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:50:20,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:50:20,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:50:20,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:50:20,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:50:20,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:50:20,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:50:20,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:50:20,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:50:20,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:50:20,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:50:20,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:50:20,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:50:20,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:50:20,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:50:20,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:50:20,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:50:20,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:50:20,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:50:20,806 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:50:20,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:50:20,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:50:20,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:50:20,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:50:20,831 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:50:20,831 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:50:20,831 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:50:20,832 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:50:20,832 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:50:20,832 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:50:20,833 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:50:20,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:50:20,834 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:50:20,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:50:20,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:50:20,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:50:20,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:50:20,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:50:20,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:50:20,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:50:20,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:50:20,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:50:20,836 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:50:20,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:50:20,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:50:20,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:50:20,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:50:20,838 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:50:20,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:50:20,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:50:20,839 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:50:20,842 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:50:20,842 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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 -> 093479089abdaadb7e9be964d84aa50a0bea01c9 [2019-11-15 23:50:20,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:50:20,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:50:20,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:50:20,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:50:20,916 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:50:20,917 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2019-11-15 23:50:20,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/data/b1c53633a/194679ab487d4cf6a4227964c452aaf0/FLAG71f582bb9 [2019-11-15 23:50:21,515 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:50:21,516 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2019-11-15 23:50:21,536 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/data/b1c53633a/194679ab487d4cf6a4227964c452aaf0/FLAG71f582bb9 [2019-11-15 23:50:21,752 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/data/b1c53633a/194679ab487d4cf6a4227964c452aaf0 [2019-11-15 23:50:21,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:50:21,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:50:21,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:21,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:50:21,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:50:21,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:21" (1/1) ... [2019-11-15 23:50:21,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5439c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:21, skipping insertion in model container [2019-11-15 23:50:21,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:21" (1/1) ... [2019-11-15 23:50:21,770 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:50:21,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:50:22,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:22,448 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:50:22,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:22,616 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:50:22,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22 WrapperNode [2019-11-15 23:50:22,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:22,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:22,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:50:22,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:50:22,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:22,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:22,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:22,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:50:22,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:50:22,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:50:23,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... [2019-11-15 23:50:23,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:50:23,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:50:23,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:50:23,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:50:23,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:50:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:50:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:50:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:50:36,892 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:50:36,893 INFO L284 CfgBuilder]: Removed 1613 assume(true) statements. [2019-11-15 23:50:36,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:36 BoogieIcfgContainer [2019-11-15 23:50:36,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:50:36,898 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:50:36,899 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:50:36,902 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:50:36,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:50:36,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:50:21" (1/3) ... [2019-11-15 23:50:36,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8bfa3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:50:36, skipping insertion in model container [2019-11-15 23:50:36,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:50:36,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:22" (2/3) ... [2019-11-15 23:50:36,905 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8bfa3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:50:36, skipping insertion in model container [2019-11-15 23:50:36,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:50:36,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:36" (3/3) ... [2019-11-15 23:50:36,907 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2019-11-15 23:50:36,951 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:50:36,951 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:50:36,952 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:50:36,952 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:50:36,952 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:50:36,952 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:50:36,952 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:50:36,953 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:50:37,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6967 states. [2019-11-15 23:50:37,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3473 [2019-11-15 23:50:37,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:50:37,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:50:37,222 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] [2019-11-15 23:50:37,222 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] [2019-11-15 23:50:37,222 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:50:37,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6967 states. [2019-11-15 23:50:37,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3473 [2019-11-15 23:50:37,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:50:37,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:50:37,306 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] [2019-11-15 23:50:37,306 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] [2019-11-15 23:50:37,313 INFO L791 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(10);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string62.base, #t~string62.offset, 1);call write~init~int(95, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(93, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 3 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string64.base, #t~string64.offset, 1);call write~init~int(93, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(32, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string66.base, #t~string66.offset, 1);call write~init~int(97, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 4 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string68.base, #t~string68.offset, 1);call write~init~int(105, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(10);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string72.base, #t~string72.offset, 1);call write~init~int(112, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string74.base, #t~string74.offset, 1);call write~init~int(111, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(119, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(110, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 4 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string76.base, #t~string76.offset, 1);call write~init~int(73, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(76, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(95, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 4 + #t~string76.offset, 1);call write~init~int(58, #t~string76.base, 5 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 6 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string78.base, #t~string78.offset, 1);call write~init~int(37, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(105, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 3 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(37, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(105, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 3 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(70, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(95, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(112, #t~string88.base, 3 + #t~string88.offset, 1);call write~init~int(58, #t~string88.base, 4 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 5 + #t~string88.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string94.base, #t~string94.offset, 1);call write~init~int(37, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(105, #t~string94.base, 2 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 3 + #t~string94.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(37, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(105, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 3 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.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(2);call write~init~int(10, #t~string105.base, #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 1 + #t~string105.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(9);~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(21);call #t~string159.base, #t~string159.offset := #Ultimate.allocOnStack(30);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(9);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(21);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(30);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(9);call #t~string167.base, #t~string167.offset := #Ultimate.allocOnStack(25);call #t~string168.base, #t~string168.offset := #Ultimate.allocOnStack(30);call #t~string169.base, #t~string169.offset := #Ultimate.allocOnStack(9);call #t~string170.base, #t~string170.offset := #Ultimate.allocOnStack(25); 6297#L-1true havoc main_#res;havoc main_#t~ret130, main_~retValue_acc~23, main_~tmp~25;havoc main_~retValue_acc~23;havoc main_~tmp~25; 685#L3055true havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 49#L3063true main_#t~ret130 := valid_product_#res;main_~tmp~25 := main_#t~ret130;havoc main_#t~ret130; 9#L2889true assume 0 != main_~tmp~25; 635#L2860true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1914#L2380true havoc bigMacCall_#t~ret123, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~25;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~25; 4373#L2946true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~25 := 4;getOrigin_#res := getOrigin_~retValue_acc~25; 3040#L2971true bigMacCall_#t~ret123 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret123;havoc bigMacCall_#t~ret123;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; 534#L399true assume 0 == initPersonOnFloor_~floor; 435#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 2900#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 6612#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5593#L203-2true havoc cleanup_#t~ret124, cleanup_#t~ret125, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~1;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~1;havoc timeShift_#t~ret59, timeShift_~tmp~13;havoc timeShift_~tmp~13;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; 301#L960true timeShift_#t~ret59 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret59;havoc timeShift_#t~ret59; 6089#L1971true assume 0 != timeShift_~tmp~13; 6013#L1972true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6088#L1616-11true havoc __utac_acc__Specification2_spec__3_#t~ret111, __utac_acc__Specification2_spec__3_#t~ret112, __utac_acc__Specification2_spec__3_#t~ret113, __utac_acc__Specification2_spec__3_#t~ret114, __utac_acc__Specification2_spec__3_#t~ret115, __utac_acc__Specification2_spec__3_#t~ret116, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~16, __utac_acc__Specification2_spec__3_~tmp___0~9, __utac_acc__Specification2_spec__3_~tmp___1~5, __utac_acc__Specification2_spec__3_~tmp___2~5, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~16;havoc __utac_acc__Specification2_spec__3_~tmp___0~9;havoc __utac_acc__Specification2_spec__3_~tmp___1~5;havoc __utac_acc__Specification2_spec__3_~tmp___2~5;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 4#L951-10true __utac_acc__Specification2_spec__3_#t~ret111 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~16 := __utac_acc__Specification2_spec__3_#t~ret111;havoc __utac_acc__Specification2_spec__3_#t~ret111;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~16; 4057#L2425true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3786#L2426true assume 0 != ~floorButtons_spc2_0~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; 302#L960-1true __utac_acc__Specification2_spec__3_#t~ret112 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret112;havoc __utac_acc__Specification2_spec__3_#t~ret112; 5459#L2430true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 5900#L2485true cleanup_~i~1 := 0; 461#L2692-2true [2019-11-15 23:50:37,314 INFO L793 eck$LassoCheckResult]: Loop: 461#L2692-2true assume !false; 874#L2693true cleanup_~__cil_tmp4~1 := ~cleanupTimeShifts~0 - 1; 780#L2696true assume cleanup_~i~1 < cleanup_~__cil_tmp4~1;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; 2038#L793true cleanup_#t~ret124 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret124;havoc cleanup_#t~ret124; 750#L2700true assume 1 != cleanup_~tmp___0~10; 749#L2700-1true havoc isIdle_#res;havoc isIdle_#t~ret7, isIdle_~retValue_acc~10, isIdle_~tmp~3;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~3;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret2, anyStopRequested_#t~ret3, anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~2, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~2;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 4274#L128-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 2769#L155-130true anyStopRequested_#t~ret2 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret2;havoc anyStopRequested_#t~ret2; 6286#L1059true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 115#L1123true isIdle_#t~ret7 := anyStopRequested_#res;isIdle_~tmp~3 := isIdle_#t~ret7;havoc isIdle_#t~ret7;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~3 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 303#L1136true cleanup_#t~ret125 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret125;havoc cleanup_#t~ret125; 19#L2712true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret59, timeShift_~tmp~13;havoc timeShift_~tmp~13;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; 300#L960-6true timeShift_#t~ret59 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret59;havoc timeShift_#t~ret59; 6090#L1971-1true assume 0 != timeShift_~tmp~13; 6014#L1972-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6087#L1616-23true havoc __utac_acc__Specification2_spec__3_#t~ret111, __utac_acc__Specification2_spec__3_#t~ret112, __utac_acc__Specification2_spec__3_#t~ret113, __utac_acc__Specification2_spec__3_#t~ret114, __utac_acc__Specification2_spec__3_#t~ret115, __utac_acc__Specification2_spec__3_#t~ret116, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~16, __utac_acc__Specification2_spec__3_~tmp___0~9, __utac_acc__Specification2_spec__3_~tmp___1~5, __utac_acc__Specification2_spec__3_~tmp___2~5, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~16;havoc __utac_acc__Specification2_spec__3_~tmp___0~9;havoc __utac_acc__Specification2_spec__3_~tmp___1~5;havoc __utac_acc__Specification2_spec__3_~tmp___2~5;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 22#L951-21true __utac_acc__Specification2_spec__3_#t~ret111 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~16 := __utac_acc__Specification2_spec__3_#t~ret111;havoc __utac_acc__Specification2_spec__3_#t~ret111;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~16; 4063#L2425-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3767#L2426-1true assume 0 != ~floorButtons_spc2_0~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; 289#L960-7true __utac_acc__Specification2_spec__3_#t~ret112 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret112;havoc __utac_acc__Specification2_spec__3_#t~ret112; 5472#L2430-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 5892#L2485-1true cleanup_~i~1 := 1 + cleanup_~i~1; 461#L2692-2true [2019-11-15 23:50:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash 618203043, now seen corresponding path program 1 times [2019-11-15 23:50:37,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:37,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591063192] [2019-11-15 23:50:37,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:37,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:37,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:37,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591063192] [2019-11-15 23:50:37,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:37,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:37,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394073071] [2019-11-15 23:50:37,650 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:50:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1317289327, now seen corresponding path program 1 times [2019-11-15 23:50:37,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:37,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701010210] [2019-11-15 23:50:37,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:37,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:37,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:37,714 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:38,103 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-11-15 23:50:38,474 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-15 23:50:38,485 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:50:38,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:50:38,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:50:38,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:50:38,487 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:50:38,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:38,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:50:38,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:50:38,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product24.cil.c_Iteration1_Loop [2019-11-15 23:50:38,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:50:38,489 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:50:38,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:38,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,269 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:50:39,270 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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) [2019-11-15 23:50:39,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,287 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:39,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:39,299 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:50:39,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,318 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:39,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:39,330 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~3=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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-11-15 23:50:39,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,370 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-11-15 23:50:39,376 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:39,376 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/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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-11-15 23:50:39,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,392 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-11-15 23:50:39,398 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:39,398 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/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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) [2019-11-15 23:50:39,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,418 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:39,427 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:39,427 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret59=0} Honda state: {ULTIMATE.start_timeShift_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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) [2019-11-15 23:50:39,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,444 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:39,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:39,457 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=6, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=6, ~doorState~0=6, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=6, ULTIMATE.start_timeShift_~tmp~13=6} Honda state: {ULTIMATE.start_areDoorsOpen_#res=6, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=6, ~doorState~0=6, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=6, ULTIMATE.start_timeShift_~tmp~13=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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-11-15 23:50:39,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:39,466 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f994912-3d89-4ae7-bb48-521a240be38f/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:39,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:50:39,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:50:39,502 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:50:39,504 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:50:39,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:50:39,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:50:39,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:50:39,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:50:39,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:39,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:50:39,505 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:50:39,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product24.cil.c_Iteration1_Loop [2019-11-15 23:50:39,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:50:39,506 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:50:39,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:39,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:40,071 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-11-15 23:50:40,406 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:50:40,418 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:50:40,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,422 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:50:40,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,431 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:50:40,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,478 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,495 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:50:40,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,497 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:50:40,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,535 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:50:40,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,536 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:50:40,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,553 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,557 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,569 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,593 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,601 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,612 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,613 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,624 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,649 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,683 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:50:40,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,684 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:50:40,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:40,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:50:40,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:40,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:40,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:40,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:40,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:40,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:40,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:40,709 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:50:40,714 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:50:40,715 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:50:40,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:50:40,717 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:50:40,717 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:50:40,718 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-11-15 23:50:40,721 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:50:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:40,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:40,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:40,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:50:40,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:41,043 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:50:41,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6967 states. Second operand 5 states. [2019-11-15 23:50:41,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6967 states.. Second operand 5 states. Result 10500 states and 19802 transitions. Complement of second has 9 states. [2019-11-15 23:50:41,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:50:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:50:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13207 transitions. [2019-11-15 23:50:41,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13207 transitions. Stem has 24 letters. Loop has 22 letters. [2019-11-15 23:50:41,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:41,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13207 transitions. Stem has 46 letters. Loop has 22 letters. [2019-11-15 23:50:41,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:41,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13207 transitions. Stem has 24 letters. Loop has 44 letters. [2019-11-15 23:50:41,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:41,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10500 states and 19802 transitions. [2019-11-15 23:50:41,879 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:50:41,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10500 states to 0 states and 0 transitions. [2019-11-15 23:50:41,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:50:41,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:50:41,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:50:41,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:50:41,884 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:50:41,884 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:50:41,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:41,889 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 23:50:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:41,891 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 23:50:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:50:41,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 23:50:41,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:50:41,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:50:41,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:50:41,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:50:41,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:50:41,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:50:41,893 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:50:41,894 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:50:41,894 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:50:41,894 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:50:41,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:50:41,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:50:41,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:50:41,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:50:41 BoogieIcfgContainer [2019-11-15 23:50:41,900 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:50:41,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:50:41,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:50:41,901 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:50:41,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:36" (3/4) ... [2019-11-15 23:50:41,905 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:50:41,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:50:41,906 INFO L168 Benchmark]: Toolchain (without parser) took 20150.19 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 598.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 422.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:41,906 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:41,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:41,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 377.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:41,908 INFO L168 Benchmark]: Boogie Preprocessor took 491.43 ms. Allocated memory is still 1.2 GB. Free memory was 993.5 MB in the beginning and 924.4 MB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:41,909 INFO L168 Benchmark]: RCFGBuilder took 13408.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 478.2 MB). Free memory was 924.4 MB in the beginning and 1.2 GB in the end (delta: -282.0 MB). Peak memory consumption was 421.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:41,910 INFO L168 Benchmark]: BuchiAutomizer took 5001.98 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -2.6 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 91.3 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:41,910 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:41,914 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 862.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 377.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 491.43 ms. Allocated memory is still 1.2 GB. Free memory was 993.5 MB in the beginning and 924.4 MB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 13408.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 478.2 MB). Free memory was 924.4 MB in the beginning and 1.2 GB in the end (delta: -282.0 MB). Peak memory consumption was 421.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5001.98 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -2.6 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 91.3 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13173 SDtfs, 26312 SDslu, 6603 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 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...