./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product32_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_product32_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 c19987793b6e68bdb17fd7f8908095882b728be3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:17:30,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:17:30,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:17:30,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:17:30,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:17:30,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:17:30,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:17:30,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:17:30,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:17:30,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:17:30,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:17:30,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:17:30,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:17:30,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:17:30,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:17:30,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:17:30,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:17:30,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:17:30,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:17:30,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:17:30,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:17:30,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:17:30,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:17:30,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:17:30,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:17:30,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:17:30,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:17:30,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:17:30,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:17:30,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:17:30,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:17:30,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:17:30,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:17:30,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:17:30,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:17:30,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:17:30,948 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:17:30,965 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:17:30,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:17:30,967 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:17:30,967 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:17:30,968 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:17:30,968 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:17:30,968 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:17:30,968 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:17:30,969 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:17:30,969 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:17:30,969 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:17:30,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:17:30,969 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:17:30,970 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:17:30,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:17:30,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:17:30,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:17:30,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:17:30,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:17:30,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:17:30,971 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:17:30,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:17:30,971 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:17:30,971 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:17:30,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:17:30,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:17:30,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:17:30,972 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:17:30,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:17:30,973 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:17:30,973 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:17:30,974 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:17:30,974 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 -> c19987793b6e68bdb17fd7f8908095882b728be3 [2019-01-01 23:17:31,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:17:31,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:17:31,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:17:31,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:17:31,048 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:17:31,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product32_false-unreach-call_true-termination.cil.c [2019-01-01 23:17:31,119 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f15df6f9/c0aa67938e864074af4c1c0d949f617b/FLAGd6c14aedb [2019-01-01 23:17:31,727 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:17:31,728 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product32_false-unreach-call_true-termination.cil.c [2019-01-01 23:17:31,762 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f15df6f9/c0aa67938e864074af4c1c0d949f617b/FLAGd6c14aedb [2019-01-01 23:17:31,914 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f15df6f9/c0aa67938e864074af4c1c0d949f617b [2019-01-01 23:17:31,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:17:31,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:17:31,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:17:31,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:17:31,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:17:31,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:17:31" (1/1) ... [2019-01-01 23:17:31,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e4e466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:31, skipping insertion in model container [2019-01-01 23:17:31,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:17:31" (1/1) ... [2019-01-01 23:17:31,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:17:32,029 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:17:32,803 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:17:32,828 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:17:33,093 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:17:33,196 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:17:33,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33 WrapperNode [2019-01-01 23:17:33,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:17:33,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:17:33,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:17:33,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:17:33,212 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:17:33" (1/1) ... [2019-01-01 23:17:33,275 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:17:33" (1/1) ... [2019-01-01 23:17:33,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:17:33,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:17:33,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:17:33,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:17:33,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:33,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:33,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:33,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:33,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:34,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:34,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (1/1) ... [2019-01-01 23:17:34,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:17:34,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:17:34,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:17:34,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:17:34,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (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:17:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:17:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:17:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:17:34,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:17:50,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:17:50,236 INFO L280 CfgBuilder]: Removed 1673 assue(true) statements. [2019-01-01 23:17:50,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:17:50 BoogieIcfgContainer [2019-01-01 23:17:50,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:17:50,237 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:17:50,237 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:17:50,242 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:17:50,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:17:50,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:17:31" (1/3) ... [2019-01-01 23:17:50,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ba06605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:17:50, skipping insertion in model container [2019-01-01 23:17:50,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:17:50,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:33" (2/3) ... [2019-01-01 23:17:50,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ba06605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:17:50, skipping insertion in model container [2019-01-01 23:17:50,246 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:17:50,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:17:50" (3/3) ... [2019-01-01 23:17:50,249 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product32_false-unreach-call_true-termination.cil.c [2019-01-01 23:17:50,314 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:17:50,314 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:17:50,315 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:17:50,315 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:17:50,315 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:17:50,315 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:17:50,315 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:17:50,315 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:17:50,315 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:17:50,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7122 states. [2019-01-01 23:17:50,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3521 [2019-01-01 23:17:50,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:17:50,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:17:50,641 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:17:50,641 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:17:50,641 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:17:50,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7122 states. [2019-01-01 23:17:50,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3521 [2019-01-01 23:17:50,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:17:50,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:17:50,745 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:17:50,746 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:17:50,756 INFO L794 eck$LassoCheckResult]: Stem: 2884#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~string61.base, #t~string61.offset := #Ultimate.allocOnStack(10);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(95, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string65.base, #t~string65.offset, 1);call write~init~int(93, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string67.base, #t~string67.offset, 1);call write~init~int(97, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(32, #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(3);call write~init~int(37, #t~string69.base, #t~string69.offset, 1);call write~init~int(105, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(10);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string73.base, #t~string73.offset, 1);call write~init~int(112, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string75.base, #t~string75.offset, 1);call write~init~int(111, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(119, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(110, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(76, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(95, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(112, #t~string77.base, 4 + #t~string77.offset, 1);call write~init~int(58, #t~string77.base, 5 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 6 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.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~string89.base, #t~string89.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(70, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(95, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(112, #t~string89.base, 3 + #t~string89.offset, 1);call write~init~int(58, #t~string89.base, 4 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 5 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string106.base, #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 1 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(9);~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0;call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(30);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(9);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(21);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(30);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(9);call #t~string156.base, #t~string156.offset := #Ultimate.allocOnStack(21);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(30);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(9);call #t~string162.base, #t~string162.offset := #Ultimate.allocOnStack(25);call #t~string163.base, #t~string163.offset := #Ultimate.allocOnStack(30);call #t~string164.base, #t~string164.offset := #Ultimate.allocOnStack(9);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(25);~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; 6785#L-1true havoc main_#res;havoc main_#t~ret125, main_~retValue_acc~23, main_~tmp~25;havoc main_~retValue_acc~23;havoc main_~tmp~25; 3042#L2241true havoc valid_product_#res;havoc valid_product_~retValue_acc~25;havoc valid_product_~retValue_acc~25;valid_product_~retValue_acc~25 := 1;valid_product_#res := valid_product_~retValue_acc~25; 5381#L2249true main_#t~ret125 := valid_product_#res;main_~tmp~25 := main_#t~ret125;havoc main_#t~ret125; 3567#L2205true assume 0 != main_~tmp~25; 2258#L2175true ~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; 4577#L2268true havoc bigMacCall_#t~ret118, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 3920#L85true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2892#L110true bigMacCall_#t~ret118 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret118;havoc bigMacCall_#t~ret118;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 5047#L3158true assume 0 == initPersonOnFloor_~floor; 4989#L3159true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4214#L3266-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; 5112#L2275true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 6902#L2287-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5762#L2962-2true havoc angelinaCall_#t~ret115, angelinaCall_~tmp~19;havoc angelinaCall_~tmp~19;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 3900#L85-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2889#L110-1true angelinaCall_#t~ret115 := getOrigin_#res;angelinaCall_~tmp~19 := angelinaCall_#t~ret115;havoc angelinaCall_#t~ret115;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~19;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 5045#L3158-1true assume 0 == initPersonOnFloor_~floor; 4995#L3159-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4212#L3266-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; 5117#L2275-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 6906#L2287-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5751#L2962-5true havoc cleanup_#t~ret119, cleanup_#t~ret120, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~1;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~1;havoc timeShift_#t~ret60, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3998#L457true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 2228#L1468true assume 0 != timeShift_~tmp~14; 2283#L1469true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2297#L1113-11true havoc __utac_acc__Specification1_spec__3_#t~ret127, __utac_acc__Specification1_spec__3_#t~ret128, __utac_acc__Specification1_spec__3_#t~ret129, __utac_acc__Specification1_spec__3_#t~ret130, __utac_acc__Specification1_spec__3_#t~ret131, __utac_acc__Specification1_spec__3_#t~ret132, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~26, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~6, __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~26;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~6;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 4281#L448-10true __utac_acc__Specification1_spec__3_#t~ret127 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~26 := __utac_acc__Specification1_spec__3_#t~ret127;havoc __utac_acc__Specification1_spec__3_#t~ret127;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~26; 6006#L2313true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 5983#L2314true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3999#L457-1true __utac_acc__Specification1_spec__3_#t~ret128 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret128;havoc __utac_acc__Specification1_spec__3_#t~ret128; 5959#L2318true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 947#L2373true cleanup_~i~1 := 0; 435#L2007-2true [2019-01-01 23:17:50,758 INFO L796 eck$LassoCheckResult]: Loop: 435#L2007-2true assume !false; 52#L2008true cleanup_~__cil_tmp4~1 := ~cleanupTimeShifts~0 - 1; 1553#L2011true assume cleanup_~i~1 < cleanup_~__cil_tmp4~1;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 4155#L275true cleanup_#t~ret119 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret119;havoc cleanup_#t~ret119; 1450#L2015true assume 1 != cleanup_~tmp___0~9; 1420#L2015-1true havoc isIdle_#res;havoc isIdle_#t~ret8, isIdle_~retValue_acc~10, isIdle_~tmp~4;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret3, anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~29;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~29; 478#L2883-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~29 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~29; 4321#L2910-130true anyStopRequested_#t~ret3 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret3;havoc anyStopRequested_#t~ret3; 5961#L556true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 3437#L620true isIdle_#t~ret8 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret8;havoc isIdle_#t~ret8;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 4003#L633true cleanup_#t~ret120 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret120;havoc cleanup_#t~ret120; 3530#L2027true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret60, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3991#L457-6true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 2230#L1468-1true assume 0 != timeShift_~tmp~14; 2288#L1469-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2292#L1113-23true havoc __utac_acc__Specification1_spec__3_#t~ret127, __utac_acc__Specification1_spec__3_#t~ret128, __utac_acc__Specification1_spec__3_#t~ret129, __utac_acc__Specification1_spec__3_#t~ret130, __utac_acc__Specification1_spec__3_#t~ret131, __utac_acc__Specification1_spec__3_#t~ret132, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~26, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~6, __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~26;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~6;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 4260#L448-21true __utac_acc__Specification1_spec__3_#t~ret127 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~26 := __utac_acc__Specification1_spec__3_#t~ret127;havoc __utac_acc__Specification1_spec__3_#t~ret127;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~26; 6008#L2313-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6046#L2314-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3992#L457-7true __utac_acc__Specification1_spec__3_#t~ret128 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret128;havoc __utac_acc__Specification1_spec__3_#t~ret128; 5960#L2318-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 917#L2373-1true cleanup_~i~1 := 1 + cleanup_~i~1; 435#L2007-2true [2019-01-01 23:17:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:17:50,773 INFO L82 PathProgramCache]: Analyzing trace with hash 880410858, now seen corresponding path program 1 times [2019-01-01 23:17:50,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:17:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:17:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:50,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:17:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:17:51,178 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:17:51,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:17:51,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:17:51,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:17:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:17:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash 240294125, now seen corresponding path program 1 times [2019-01-01 23:17:51,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:17:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:17:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:17:51,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:17:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:17:52,724 WARN L181 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:17:53,107 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:17:53,119 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:17:53,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:17:53,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:17:53,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:17:53,121 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:17:53,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:53,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:17:53,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:17:53,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:17:53,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:17:53,124 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:17:53,151 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:17:53,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,208 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:17:53,210 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:17:53,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:17:53,230 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:17:53,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,263 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:17:53,271 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:17:53,275 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:17:53,279 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:17:53,283 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:17:53,284 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:17:53,296 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:17:53,298 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:17:53,301 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:17:53,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,306 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:17:53,312 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:17:53,334 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:17:53,354 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:17:53,380 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:17:53,540 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:17:53,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:17:53,566 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:17:53,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,717 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:17:53,743 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:17:53,769 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:17:53,783 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:17:53,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:17:53,787 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:17:53,799 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:17:53,801 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:17:54,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:17:54,369 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:17:54,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,388 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,389 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret132=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret132=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:17:54,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,427 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,427 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=-8, ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___4~3=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~14=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=-8, ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___4~3=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~14=-8} 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:17:54,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,478 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,496 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,497 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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:17:54,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,567 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:17:54,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,580 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret131=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret131=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:17:54,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,621 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,622 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~4=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~4=1} 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:17:54,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,654 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 [2019-01-01 23:17:54,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,698 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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:17:54,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,706 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:17:54,718 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,718 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:54,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#res=-8, ~calls_0~0=-8, ULTIMATE.start_anyStopRequested_~tmp___3~0=-8, ULTIMATE.start_isFloorCalling_~retValue_acc~29=-8} Honda state: {ULTIMATE.start_isFloorCalling_#res=-8, ~calls_0~0=-8, ULTIMATE.start_anyStopRequested_~tmp___3~0=-8, ULTIMATE.start_isFloorCalling_~retValue_acc~29=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:54,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,790 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___2~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:54,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,813 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,813 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret130=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret130=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:54,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,839 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret7=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:54,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:54,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:54,876 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:54,876 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret4=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:55,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:55,061 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:55,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:17:55,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:18:07,156 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:18:07,158 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:18:07,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:18:07,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:18:07,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:18:07,159 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:18:07,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:18:07,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:18:07,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:18:07,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:18:07,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:18:07,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:18:07,164 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:18:07,177 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:18:07,181 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:18:07,191 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:18:07,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:18:07,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:18:07,272 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:18:07,296 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:18:07,325 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:18:07,374 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:18:07,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,412 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:18:07,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,414 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:18:07,454 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:18:07,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,457 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:18:07,460 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:18:07,464 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:18:07,472 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:18:07,475 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:18:07,480 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:18:07,484 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:18:07,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,500 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:18:07,501 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:18:07,506 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:18:07,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:18:07,518 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:18:07,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:18:07,790 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:18:08,015 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:18:08,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:18:08,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:18:08,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:18:08,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,514 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:18:08,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,518 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:18:08,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,531 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:18:08,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,534 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:18:08,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,535 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:18:08,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,537 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:18:08,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,548 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:18:08,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,552 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:18:08,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,554 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:18:08,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,557 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:18:08,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,560 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:18:08,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,563 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:18:08,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,567 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:18:08,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,570 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:18:08,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,577 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:18:08,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,580 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:18:08,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,583 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:18:08,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,585 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:18:08,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,586 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:18:08,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:18:08,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,599 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:18:08,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,602 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:18:08,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,605 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:18:08,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,608 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:18:08,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,609 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:18:08,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,609 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:18:08,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,614 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:18:08,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,617 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:18:08,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,620 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:18:08,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,626 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:18:08,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,636 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:18:08,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,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:18:08,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,647 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:18:08,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,654 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:18:08,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,657 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:18:08,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,664 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:18:08,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,668 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:18:08,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,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:18:08,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,692 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:18:08,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,695 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:18:08,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:18:08,703 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:18:08,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:18:08,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:18:08,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:18:08,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:18:08,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:18:08,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:18:08,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:18:08,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:18:08,731 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:18:08,731 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:18:08,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:18:08,739 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:18:08,740 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:18:08,740 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-01-01 23:18:08,742 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:18:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:18:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:18:08,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:18:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:18:09,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:18:09,165 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:18:09,181 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:18:09,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7122 states. Second operand 5 states. [2019-01-01 23:18:09,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7122 states.. Second operand 5 states. Result 10703 states and 20133 transitions. Complement of second has 9 states. [2019-01-01 23:18:09,958 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:18:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:18:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13466 transitions. [2019-01-01 23:18:09,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13466 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-01 23:18:09,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:18:09,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13466 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-01 23:18:09,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:18:09,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13466 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-01 23:18:09,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:18:09,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10703 states and 20133 transitions. [2019-01-01 23:18:10,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:18:10,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10703 states to 0 states and 0 transitions. [2019-01-01 23:18:10,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:18:10,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:18:10,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:18:10,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:18:10,147 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:18:10,147 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:18:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:18:10,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:18:10,153 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:18:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:18:10,158 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:18:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:18:10,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:18:10,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:18:10,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:18:10,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:18:10,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:18:10,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:18:10,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:18:10,160 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:18:10,160 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:18:10,160 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:18:10,161 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:18:10,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:18:10,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:18:10,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:18:10,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:18:10 BoogieIcfgContainer [2019-01-01 23:18:10,172 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:18:10,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:18:10,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:18:10,172 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:18:10,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:17:50" (3/4) ... [2019-01-01 23:18:10,179 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:18:10,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:18:10,180 INFO L168 Benchmark]: Toolchain (without parser) took 38261.42 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 628.6 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 483.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:18:10,182 INFO L168 Benchmark]: CDTParser took 0.18 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:18:10,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1277.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:18:10,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 492.77 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: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:18:10,185 INFO L168 Benchmark]: Boogie Preprocessor took 494.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 960.8 MB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:18:10,186 INFO L168 Benchmark]: RCFGBuilder took 16049.40 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 478.2 MB). Free memory was 960.8 MB in the beginning and 1.3 GB in the end (delta: -300.9 MB). Peak memory consumption was 419.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:18:10,188 INFO L168 Benchmark]: BuchiAutomizer took 19934.55 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.0 MB). Free memory was 1.3 GB in the beginning and 1.1 GB in the end (delta: 174.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:18:10,190 INFO L168 Benchmark]: Witness Printer took 6.71 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:18:10,196 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.18 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 1277.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 492.77 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: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 494.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 960.8 MB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16049.40 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 478.2 MB). Free memory was 960.8 MB in the beginning and 1.3 GB in the end (delta: -300.9 MB). Peak memory consumption was 419.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19934.55 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.0 MB). Free memory was 1.3 GB in the beginning and 1.1 GB in the end (delta: 174.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.71 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 18.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13432 SDtfs, 20066 SDslu, 6675 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...