./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product20_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec1_product20_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9c8d96fa066b936760c08808baca1cb90cf1092 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:15:20,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:15:20,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:15:20,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:15:20,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:15:20,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:15:20,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:15:20,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:15:20,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:15:20,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:15:20,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:15:20,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:15:20,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:15:20,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:15:20,904 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:15:20,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:15:20,906 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:15:20,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:15:20,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:15:20,912 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:15:20,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:15:20,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:15:20,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:15:20,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:15:20,918 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:15:20,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:15:20,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:15:20,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:15:20,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:15:20,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:15:20,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:15:20,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:15:20,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:15:20,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:15:20,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:15:20,928 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:15:20,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:15:20,946 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:15:20,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:15:20,948 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:15:20,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:15:20,949 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:15:20,949 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:15:20,949 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:15:20,949 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:15:20,949 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:15:20,950 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:15:20,950 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:15:20,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:15:20,950 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:15:20,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:15:20,952 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:15:20,952 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:15:20,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:15:20,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:15:20,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:15:20,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:15:20,953 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:15:20,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:15:20,954 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:15:20,954 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:15:20,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:15:20,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:15:20,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:15:20,955 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:15:20,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:15:20,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:15:20,956 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:15:20,957 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:15:20,957 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9c8d96fa066b936760c08808baca1cb90cf1092 [2019-01-01 23:15:20,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:15:21,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:15:21,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:15:21,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:15:21,016 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:15:21,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product20_false-unreach-call_true-termination.cil.c [2019-01-01 23:15:21,085 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b030afd64/2ba5f8916ffe43eba58383fee0aa577d/FLAG8a305e91a [2019-01-01 23:15:21,838 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:15:21,840 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product20_false-unreach-call_true-termination.cil.c [2019-01-01 23:15:21,872 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b030afd64/2ba5f8916ffe43eba58383fee0aa577d/FLAG8a305e91a [2019-01-01 23:15:22,097 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b030afd64/2ba5f8916ffe43eba58383fee0aa577d [2019-01-01 23:15:22,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:15:22,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:15:22,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:15:22,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:15:22,109 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:15:22,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:15:22" (1/1) ... [2019-01-01 23:15:22,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@830702e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:22, skipping insertion in model container [2019-01-01 23:15:22,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:15:22" (1/1) ... [2019-01-01 23:15:22,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:15:22,217 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:15:22,959 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:15:22,980 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:15:23,166 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:15:23,244 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:15:23,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23 WrapperNode [2019-01-01 23:15:23,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:15:23,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:15:23,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:15:23,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:15:23,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:15:23,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:15:23,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:15:23,587 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:15:23,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... [2019-01-01 23:15:23,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:15:23,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:15:23,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:15:23,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:15:23,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:15:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:15:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:15:24,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:15:38,792 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:15:38,793 INFO L280 CfgBuilder]: Removed 1113 assue(true) statements. [2019-01-01 23:15:38,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:15:38 BoogieIcfgContainer [2019-01-01 23:15:38,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:15:38,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:15:38,797 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:15:38,801 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:15:38,802 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:15:38,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:15:22" (1/3) ... [2019-01-01 23:15:38,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5090b041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:15:38, skipping insertion in model container [2019-01-01 23:15:38,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:15:38,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:23" (2/3) ... [2019-01-01 23:15:38,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5090b041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:15:38, skipping insertion in model container [2019-01-01 23:15:38,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:15:38,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:15:38" (3/3) ... [2019-01-01 23:15:38,807 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product20_false-unreach-call_true-termination.cil.c [2019-01-01 23:15:38,868 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:15:38,869 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:15:38,869 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:15:38,869 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:15:38,869 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:15:38,870 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:15:38,870 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:15:38,870 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:15:38,870 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:15:38,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4762 states. [2019-01-01 23:15:39,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2341 [2019-01-01 23:15:39,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:15:39,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:15:39,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:15:39,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:15:39,155 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:15:39,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4762 states. [2019-01-01 23:15:39,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2341 [2019-01-01 23:15:39,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:15:39,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:15:39,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:15:39,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:15:39,245 INFO L794 eck$LassoCheckResult]: Stem: 2857#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(10);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string55.base, #t~string55.offset, 1);call write~init~int(95, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(93, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(93, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(32, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string59.base, #t~string59.offset, 1);call write~init~int(97, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(116, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 4 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string61.base, #t~string61.offset, 1);call write~init~int(105, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(10);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string65.base, #t~string65.offset, 1);call write~init~int(112, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string67.base, #t~string67.offset, 1);call write~init~int(111, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(119, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(110, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string69.base, #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(76, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(95, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(112, #t~string69.base, 4 + #t~string69.offset, 1);call write~init~int(58, #t~string69.base, 5 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 6 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(37, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(105, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(37, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(105, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 3 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(37, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 3 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(70, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(95, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 3 + #t~string81.offset, 1);call write~init~int(58, #t~string81.base, 4 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 5 + #t~string81.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~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string98.base, #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 1 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(30);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(9);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(21);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(30);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(9);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(21);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(30);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(25);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(30);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(9);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 3904#L-1true havoc main_#res;havoc main_#t~ret159, main_~retValue_acc~26, main_~tmp~27;havoc main_~retValue_acc~26;havoc main_~tmp~27; 4600#L2037true havoc valid_product_#res;havoc valid_product_~retValue_acc~21;havoc valid_product_~retValue_acc~21;valid_product_~retValue_acc~21 := 1;valid_product_#res := valid_product_~retValue_acc~21; 3071#L2045true main_#t~ret159 := valid_product_#res;main_~tmp~27 := main_#t~ret159;havoc main_#t~ret159; 907#L3157true assume 0 != main_~tmp~27; 1199#L3130true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 4435#L3185true havoc bigMacCall_#t~ret152, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 977#L3395true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 821#L3420true bigMacCall_#t~ret152 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret152;havoc bigMacCall_#t~ret152;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1172#L2511true assume 0 == initPersonOnFloor_~floor; 1117#L2512true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 175#L2619-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 2690#L3192true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3478#L3204-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 2596#L2315-2true havoc angelinaCall_#t~ret149, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 973#L3395-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 824#L3420-1true angelinaCall_#t~ret149 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret149;havoc angelinaCall_#t~ret149;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1153#L2511-1true assume 0 == initPersonOnFloor_~floor; 1096#L2512-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 159#L2619-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 2700#L3192-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3485#L3204-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 2601#L2315-5true havoc cleanup_#t~ret153, cleanup_#t~ret154, cleanup_~i~3, cleanup_~tmp~25, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret52, timeShift_~tmp~11;havoc timeShift_~tmp~11;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 3539#L293true timeShift_#t~ret52 := areDoorsOpen_#res;timeShift_~tmp~11 := timeShift_#t~ret52;havoc timeShift_#t~ret52; 3810#L1236true assume 0 != timeShift_~tmp~11; 3702#L1237true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3563#L909-11true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~28, __utac_acc__Specification1_spec__3_~tmp___0~12, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~28;havoc __utac_acc__Specification1_spec__3_~tmp___0~12;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 2802#L284-6true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~28 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~28; 1650#L3230true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 1781#L3231true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 3560#L293-1true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 208#L3235true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3454#L3290true cleanup_~i~3 := 0; 2066#L2962-2true [2019-01-01 23:15:39,246 INFO L796 eck$LassoCheckResult]: Loop: 2066#L2962-2true assume !false; 1812#L2963true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1646#L2966true assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~0;havoc isBlocked_~retValue_acc~0;isBlocked_~retValue_acc~0 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~0; 1307#L131true cleanup_#t~ret153 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret153;havoc cleanup_#t~ret153; 414#L2970true assume 1 != cleanup_~tmp___0~10; 394#L2970-1true havoc isIdle_#res;havoc isIdle_#t~ret7, isIdle_~retValue_acc~7, isIdle_~tmp~3;havoc isIdle_~retValue_acc~7;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~6, anyStopRequested_~tmp~2, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~6;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 3250#L2235-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 298#L2262-50true anyStopRequested_#t~ret2 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret2;havoc anyStopRequested_#t~ret2; 1498#L392true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~6 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~6; 4334#L456true isIdle_#t~ret7 := anyStopRequested_#res;isIdle_~tmp~3 := isIdle_#t~ret7;havoc isIdle_#t~ret7;isIdle_~retValue_acc~7 := (if 0 == isIdle_~tmp~3 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~7; 3567#L469true cleanup_#t~ret154 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret154;havoc cleanup_#t~ret154; 722#L2982true assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret52, timeShift_~tmp~11;havoc timeShift_~tmp~11;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 3547#L293-6true timeShift_#t~ret52 := areDoorsOpen_#res;timeShift_~tmp~11 := timeShift_#t~ret52;havoc timeShift_#t~ret52; 3811#L1236-1true assume 0 != timeShift_~tmp~11; 3688#L1237-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3542#L909-23true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~28, __utac_acc__Specification1_spec__3_~tmp___0~12, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~28;havoc __utac_acc__Specification1_spec__3_~tmp___0~12;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 2727#L284-13true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~28 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~28; 1648#L3230-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 1767#L3231-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 3530#L293-7true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 214#L3235-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3447#L3290-1true cleanup_~i~3 := 1 + cleanup_~i~3; 2066#L2962-2true [2019-01-01 23:15:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:15:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash -977036186, now seen corresponding path program 1 times [2019-01-01 23:15:39,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:15:39,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:15:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:15:39,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:15:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:15:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:15:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:15:39,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:15:39,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:15:39,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:15:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:15:39,644 INFO L82 PathProgramCache]: Analyzing trace with hash -675361047, now seen corresponding path program 1 times [2019-01-01 23:15:39,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:15:39,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:15:39,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:15:39,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:15:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:15:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:15:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:15:40,713 WARN L181 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:15:41,468 WARN L181 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:15:41,481 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:15:41,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:15:41,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:15:41,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:15:41,483 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:15:41,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:41,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:15:41,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:15:41,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product20_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:15:41,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:15:41,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:15:41,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,700 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:15:41,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,968 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:15:41,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:41,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:42,532 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 23:15:42,953 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:15:43,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:15:43,105 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:43,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:15:43,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:15:43,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:15:43,142 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:43,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:15:43,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:15:43,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:15:43,172 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:43,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:15:43,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:15:43,220 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:15:43,220 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#res=1, ~calls_0~0=1, ULTIMATE.start_anyStopRequested_~tmp___3~0=1, ULTIMATE.start_isFloorCalling_~retValue_acc~22=1} Honda state: {ULTIMATE.start_isFloorCalling_#res=1, ~calls_0~0=1, ULTIMATE.start_anyStopRequested_~tmp___3~0=1, ULTIMATE.start_isFloorCalling_~retValue_acc~22=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:15:43,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:15:43,259 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:43,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:15:43,280 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:43,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:15:43,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:15:43,348 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:15:43,348 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~7=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:15:43,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:15:43,381 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:15:43,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:15:43,434 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:55,479 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:15:55,481 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:15:55,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:15:55,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:15:55,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:15:55,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:15:55,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:15:55,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:15:55,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:15:55,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product20_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:15:55,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:15:55,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:15:55,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,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-01-01 23:15:55,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,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-01-01 23:15:55,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,728 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:15:55,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:55,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:15:56,200 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:15:56,329 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:15:56,758 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:15:57,051 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 23:15:57,231 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:15:57,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:15:57,598 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:15:57,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,613 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:15:57,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,615 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:15:57,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,643 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:15:57,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:15:57,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:15:57,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:15:57,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:15:57,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:15:57,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:15:57,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:15:57,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:15:57,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:15:57,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:15:57,761 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:15:57,767 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:15:57,768 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:15:57,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:15:57,771 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:15:57,771 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:15:57,771 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2019-01-01 23:15:57,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:15:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:15:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:15:58,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:15:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:15:58,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:15:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:15:58,460 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:15:58,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4762 states. Second operand 5 states. [2019-01-01 23:15:59,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4762 states.. Second operand 5 states. Result 7163 states and 13473 transitions. Complement of second has 9 states. [2019-01-01 23:15:59,342 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-01-01 23:15:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:15:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9026 transitions. [2019-01-01 23:15:59,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9026 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-01 23:15:59,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:15:59,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9026 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-01 23:15:59,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:15:59,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9026 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-01 23:15:59,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:15:59,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7163 states and 13473 transitions. [2019-01-01 23:15:59,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:15:59,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7163 states to 0 states and 0 transitions. [2019-01-01 23:15:59,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:15:59,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:15:59,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:15:59,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:15:59,450 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:15:59,450 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:15:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:15:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:15:59,458 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:15:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:15:59,462 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:15:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:15:59,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:15:59,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:15:59,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:15:59,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:15:59,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:15:59,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:15:59,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:15:59,466 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:15:59,466 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:15:59,466 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:15:59,466 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:15:59,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:15:59,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:15:59,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:15:59,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:15:59 BoogieIcfgContainer [2019-01-01 23:15:59,476 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:15:59,476 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:15:59,476 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:15:59,477 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:15:59,477 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:15:38" (3/4) ... [2019-01-01 23:15:59,483 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:15:59,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:15:59,484 INFO L168 Benchmark]: Toolchain (without parser) took 37381.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 519.0 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -233.4 MB). Peak memory consumption was 285.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:15:59,486 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:15:59,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1140.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:15:59,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 339.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:15:59,489 INFO L168 Benchmark]: Boogie Preprocessor took 343.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:15:59,490 INFO L168 Benchmark]: RCFGBuilder took 14863.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -150.9 MB). Peak memory consumption was 445.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:15:59,491 INFO L168 Benchmark]: BuchiAutomizer took 20679.01 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 182.5 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -13.8 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:15:59,493 INFO L168 Benchmark]: Witness Printer took 6.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:15:59,500 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1140.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 339.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 343.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 14863.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -150.9 MB). Peak memory consumption was 445.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20679.01 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 182.5 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -13.8 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 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 20.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 18.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. 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.0s 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: 8992 SDtfs, 13406 SDslu, 4455 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 29ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...