./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 375e158327910cae8c3594f7d2ad0376509a1ecb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:03:05,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:03:05,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:03:05,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:03:05,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:03:05,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:03:05,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:03:05,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:03:05,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:03:05,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:03:05,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:03:05,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:03:05,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:03:05,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:03:05,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:03:05,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:03:05,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:03:05,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:03:05,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:03:05,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:03:05,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:03:05,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:03:05,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:03:05,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:03:05,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:03:05,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:03:05,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:03:05,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:03:05,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:03:05,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:03:05,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:03:05,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:03:05,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:03:05,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:03:05,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:03:05,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:03:05,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:03:05,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:03:05,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:03:05,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:03:05,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:03:05,705 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:03:05,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:03:05,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:03:05,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:03:05,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:03:05,734 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:03:05,734 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:03:05,734 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:03:05,735 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:03:05,735 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:03:05,735 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:03:05,735 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:03:05,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:03:05,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:03:05,736 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:03:05,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:03:05,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:03:05,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:03:05,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:03:05,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:03:05,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:03:05,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:03:05,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:03:05,738 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:03:05,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:03:05,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:03:05,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:03:05,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:03:05,739 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:03:05,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:03:05,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:03:05,739 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:03:05,740 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:03:05,740 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2019-11-15 23:03:05,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:03:05,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:03:05,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:03:05,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:03:05,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:03:05,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2019-11-15 23:03:05,864 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/data/6ad60b96e/29d8613369ea4d6ca6deb2a4922ac408/FLAGbcc35454e [2019-11-15 23:03:06,267 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:03:06,268 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2019-11-15 23:03:06,283 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/data/6ad60b96e/29d8613369ea4d6ca6deb2a4922ac408/FLAGbcc35454e [2019-11-15 23:03:06,595 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/data/6ad60b96e/29d8613369ea4d6ca6deb2a4922ac408 [2019-11-15 23:03:06,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:03:06,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:03:06,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:03:06,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:03:06,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:03:06,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:03:06" (1/1) ... [2019-11-15 23:03:06,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6d2bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:06, skipping insertion in model container [2019-11-15 23:03:06,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:03:06" (1/1) ... [2019-11-15 23:03:06,613 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:03:06,657 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:03:06,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:03:06,952 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:03:06,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:03:07,008 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:03:07,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07 WrapperNode [2019-11-15 23:03:07,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:03:07,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:03:07,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:03:07,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:03:07,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:03:07,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:03:07,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:03:07,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:03:07,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... [2019-11-15 23:03:07,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:03:07,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:03:07,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:03:07,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:03:07,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:03:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:03:07,572 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:03:07,572 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 23:03:07,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:03:07 BoogieIcfgContainer [2019-11-15 23:03:07,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:03:07,574 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:03:07,574 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:03:07,577 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:03:07,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:03:07,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:03:06" (1/3) ... [2019-11-15 23:03:07,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d2278cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:03:07, skipping insertion in model container [2019-11-15 23:03:07,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:03:07,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:07" (2/3) ... [2019-11-15 23:03:07,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d2278cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:03:07, skipping insertion in model container [2019-11-15 23:03:07,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:03:07,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:03:07" (3/3) ... [2019-11-15 23:03:07,585 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-1.c [2019-11-15 23:03:07,648 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:03:07,648 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:03:07,649 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:03:07,649 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:03:07,650 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:03:07,650 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:03:07,650 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:03:07,651 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:03:07,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-11-15 23:03:07,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-15 23:03:07,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:07,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:07,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:03:07,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:07,708 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:03:07,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-11-15 23:03:07,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-15 23:03:07,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:07,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:07,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:03:07,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:07,730 INFO L791 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 75#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 77#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 74#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 61#L313-1true [2019-11-15 23:03:07,731 INFO L793 eck$LassoCheckResult]: Loop: 61#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 64#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 69#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 67#L320true assume !(0 != start_simulation_~tmp~3); 61#L313-1true [2019-11-15 23:03:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:07,737 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2019-11-15 23:03:07,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:07,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548169108] [2019-11-15 23:03:07,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:07,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:07,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:07,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548169108] [2019-11-15 23:03:07,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:07,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:07,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382567221] [2019-11-15 23:03:07,865 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:03:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2019-11-15 23:03:07,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:07,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660201067] [2019-11-15 23:03:07,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:07,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:07,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:07,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660201067] [2019-11-15 23:03:07,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:07,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:03:07,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23696123] [2019-11-15 23:03:07,877 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:07,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:07,890 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-11-15 23:03:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:07,919 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-11-15 23:03:07,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:07,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2019-11-15 23:03:07,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 23:03:07,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2019-11-15 23:03:07,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:03:07,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:03:07,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-11-15 23:03:07,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:07,939 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-15 23:03:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-11-15 23:03:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 23:03:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 23:03:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-11-15 23:03:07,982 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-15 23:03:07,982 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-15 23:03:07,982 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:03:07,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-11-15 23:03:07,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 23:03:07,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:07,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:07,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:03:07,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:07,986 INFO L791 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 169#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 170#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 226#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 225#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 222#L313-1 [2019-11-15 23:03:07,986 INFO L793 eck$LassoCheckResult]: Loop: 222#L313-1 assume !false; 191#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 174#L262 assume !false; 213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 214#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 185#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 186#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 199#L242 assume !(0 != eval_~tmp___1~0); 200#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 206#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 192#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 179#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 180#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 210#L320 assume !(0 != start_simulation_~tmp~3); 222#L313-1 [2019-11-15 23:03:07,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2019-11-15 23:03:07,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:07,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233555529] [2019-11-15 23:03:07,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:07,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:07,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233555529] [2019-11-15 23:03:08,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:03:08,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922902139] [2019-11-15 23:03:08,019 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:03:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2019-11-15 23:03:08,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49493881] [2019-11-15 23:03:08,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49493881] [2019-11-15 23:03:08,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:03:08,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461197866] [2019-11-15 23:03:08,059 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:08,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:08,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:08,060 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-15 23:03:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:08,072 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2019-11-15 23:03:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:08,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2019-11-15 23:03:08,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 23:03:08,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2019-11-15 23:03:08,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:03:08,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:03:08,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2019-11-15 23:03:08,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:08,079 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-11-15 23:03:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2019-11-15 23:03:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 23:03:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 23:03:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2019-11-15 23:03:08,085 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-11-15 23:03:08,085 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-11-15 23:03:08,085 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:03:08,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2019-11-15 23:03:08,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 23:03:08,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:08,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:08,087 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:03:08,087 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,087 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 314#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 315#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 371#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 370#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 367#L313-1 [2019-11-15 23:03:08,087 INFO L793 eck$LassoCheckResult]: Loop: 367#L313-1 assume !false; 336#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 319#L262 assume !false; 358#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 359#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 330#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 344#L242 assume !(0 != eval_~tmp___1~0); 345#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 337#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 324#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 325#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 352#L320 assume !(0 != start_simulation_~tmp~3); 367#L313-1 [2019-11-15 23:03:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2019-11-15 23:03:08,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188230068] [2019-11-15 23:03:08,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2019-11-15 23:03:08,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640618199] [2019-11-15 23:03:08,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640618199] [2019-11-15 23:03:08,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:03:08,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279289798] [2019-11-15 23:03:08,168 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:08,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:03:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:08,169 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-11-15 23:03:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:08,277 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2019-11-15 23:03:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:03:08,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2019-11-15 23:03:08,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2019-11-15 23:03:08,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2019-11-15 23:03:08,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-15 23:03:08,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-15 23:03:08,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2019-11-15 23:03:08,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:08,283 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2019-11-15 23:03:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2019-11-15 23:03:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2019-11-15 23:03:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:03:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2019-11-15 23:03:08,289 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-11-15 23:03:08,289 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-11-15 23:03:08,290 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:03:08,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2019-11-15 23:03:08,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-15 23:03:08,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:08,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:08,292 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:03:08,292 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,292 INFO L791 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 532#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 533#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 591#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 590#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 587#L313-1 [2019-11-15 23:03:08,292 INFO L793 eck$LassoCheckResult]: Loop: 587#L313-1 assume !false; 554#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 535#L262 assume !false; 577#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 578#L214 assume !(0 == ~p_dw_st~0); 585#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 548#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 549#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 592#L242 assume !(0 != eval_~tmp___1~0); 568#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 569#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 546#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 555#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 542#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 543#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 572#L320 assume !(0 != start_simulation_~tmp~3); 587#L313-1 [2019-11-15 23:03:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2019-11-15 23:03:08,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156512310] [2019-11-15 23:03:08,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,321 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2019-11-15 23:03:08,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895064191] [2019-11-15 23:03:08,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895064191] [2019-11-15 23:03:08,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:08,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722087098] [2019-11-15 23:03:08,357 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:08,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:08,358 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-11-15 23:03:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:08,388 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2019-11-15 23:03:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:08,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2019-11-15 23:03:08,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-11-15 23:03:08,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2019-11-15 23:03:08,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-15 23:03:08,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-15 23:03:08,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2019-11-15 23:03:08,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:08,393 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-15 23:03:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2019-11-15 23:03:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-11-15 23:03:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 23:03:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2019-11-15 23:03:08,405 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2019-11-15 23:03:08,405 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2019-11-15 23:03:08,405 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:03:08,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2019-11-15 23:03:08,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-11-15 23:03:08,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:08,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:08,409 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,410 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,410 INFO L791 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 725#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 726#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 792#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 790#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 791#L313-1 assume !false; 803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 801#L262 [2019-11-15 23:03:08,411 INFO L793 eck$LassoCheckResult]: Loop: 801#L262 assume !false; 800#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 799#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 798#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 797#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 796#L242 assume 0 != eval_~tmp___1~0; 795#L242-1 assume !(0 == ~p_dw_st~0); 754#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 727#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 729#L139 assume !(0 == ~c_dr_pc~0); 744#L142 assume 1 == ~c_dr_pc~0; 745#L143 do_read_c_~a~0 := ~a_t~0; 750#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 784#L32-3 assume !(1 == ~p_dw_pc~0); 785#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 813#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 812#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 811#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 756#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 715#L51-3 assume 1 == ~c_dr_pc~0; 716#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 810#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 809#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 808#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 807#L82-5 ~q_read_ev~0 := 2; 806#L172 assume ~p_last_write~0 == ~c_last_read~0; 805#L173 assume ~p_num_write~0 == ~c_num_read~0; 804#L10-2 assume !false; 802#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 801#L262 [2019-11-15 23:03:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2019-11-15 23:03:08,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064433481] [2019-11-15 23:03:08,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,451 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2019-11-15 23:03:08,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858880783] [2019-11-15 23:03:08,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858880783] [2019-11-15 23:03:08,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:08,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037017253] [2019-11-15 23:03:08,496 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:08,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:08,496 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2019-11-15 23:03:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:08,518 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2019-11-15 23:03:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:08,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2019-11-15 23:03:08,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-11-15 23:03:08,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2019-11-15 23:03:08,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-15 23:03:08,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-15 23:03:08,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2019-11-15 23:03:08,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:08,523 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2019-11-15 23:03:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2019-11-15 23:03:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-11-15 23:03:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 23:03:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2019-11-15 23:03:08,529 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2019-11-15 23:03:08,529 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2019-11-15 23:03:08,530 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:03:08,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2019-11-15 23:03:08,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-11-15 23:03:08,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:08,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:08,532 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,532 INFO L791 eck$LassoCheckResult]: Stem: 980#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 946#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 947#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1014#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1013#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1003#L313-1 assume !false; 968#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 969#L262 [2019-11-15 23:03:08,533 INFO L793 eck$LassoCheckResult]: Loop: 969#L262 assume !false; 992#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 993#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1011#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1021#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1020#L242 assume 0 != eval_~tmp___1~0; 1018#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1004#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 998#L96 assume 0 == ~p_dw_pc~0; 991#L107-1 assume !false; 997#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 974#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 948#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 950#L139 assume !(0 == ~c_dr_pc~0); 965#L142 assume 1 == ~c_dr_pc~0; 966#L143 do_read_c_~a~0 := ~a_t~0; 971#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1005#L32-3 assume !(1 == ~p_dw_pc~0); 1006#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 1034#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 983#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 975#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 976#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1032#L51-3 assume 1 == ~c_dr_pc~0; 1030#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1029#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1028#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1027#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1026#L82-5 ~q_read_ev~0 := 2; 1025#L172 assume ~p_last_write~0 == ~c_last_read~0; 1024#L173 assume ~p_num_write~0 == ~c_num_read~0; 1008#L10-2 assume !false; 999#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 969#L262 [2019-11-15 23:03:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2019-11-15 23:03:08,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068591233] [2019-11-15 23:03:08,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2019-11-15 23:03:08,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204333043] [2019-11-15 23:03:08,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204333043] [2019-11-15 23:03:08,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:08,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551875652] [2019-11-15 23:03:08,574 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:08,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:08,575 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2019-11-15 23:03:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:08,602 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-15 23:03:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:08,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2019-11-15 23:03:08,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2019-11-15 23:03:08,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2019-11-15 23:03:08,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-11-15 23:03:08,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-11-15 23:03:08,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2019-11-15 23:03:08,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:08,607 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-11-15 23:03:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2019-11-15 23:03:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-15 23:03:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:03:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2019-11-15 23:03:08,613 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-11-15 23:03:08,613 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-11-15 23:03:08,613 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:03:08,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2019-11-15 23:03:08,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2019-11-15 23:03:08,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:08,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:08,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,616 INFO L791 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1176#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1177#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1250#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1249#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1242#L313-1 assume !false; 1199#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1200#L262 assume !false; 1266#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1265#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1264#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1263#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1207#L242 assume 0 != eval_~tmp___1~0; 1204#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1205#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1243#L96 assume 0 == ~p_dw_pc~0; 1231#L107-1 [2019-11-15 23:03:08,616 INFO L793 eck$LassoCheckResult]: Loop: 1231#L107-1 assume !false; 1233#L108 assume !(0 == ~q_free~0); 1193#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1194#L32 assume !(1 == ~p_dw_pc~0); 1246#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1185#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1186#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1219#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1208#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1173#L51 assume !(1 == ~c_dr_pc~0); 1169#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1170#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1175#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1232#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1230#L82-2 ~q_write_ev~0 := 2; 1231#L107-1 [2019-11-15 23:03:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2019-11-15 23:03:08,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243252236] [2019-11-15 23:03:08,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,644 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2019-11-15 23:03:08,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061797940] [2019-11-15 23:03:08,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061797940] [2019-11-15 23:03:08,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:03:08,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463335530] [2019-11-15 23:03:08,716 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:08,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:03:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:08,717 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2019-11-15 23:03:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:08,817 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2019-11-15 23:03:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:03:08,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2019-11-15 23:03:08,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2019-11-15 23:03:08,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2019-11-15 23:03:08,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2019-11-15 23:03:08,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2019-11-15 23:03:08,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2019-11-15 23:03:08,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:08,827 INFO L688 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2019-11-15 23:03:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2019-11-15 23:03:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2019-11-15 23:03:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 23:03:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2019-11-15 23:03:08,839 INFO L711 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-11-15 23:03:08,840 INFO L591 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-11-15 23:03:08,840 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:03:08,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2019-11-15 23:03:08,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2019-11-15 23:03:08,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:08,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:08,851 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,853 INFO L791 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1589#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1590#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1659#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1657#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1658#L313-1 assume !false; 1690#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1689#L262 assume !false; 1688#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1687#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1686#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1685#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1684#L242 assume 0 != eval_~tmp___1~0; 1683#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1682#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1680#L96 assume 0 == ~p_dw_pc~0; 1642#L107-1 [2019-11-15 23:03:08,853 INFO L793 eck$LassoCheckResult]: Loop: 1642#L107-1 assume !false; 1644#L108 assume !(0 == ~q_free~0); 1606#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1607#L32 assume !(1 == ~p_dw_pc~0); 1653#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1598#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1599#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1633#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1619#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1586#L51 assume 1 == ~c_dr_pc~0; 1587#L52 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1583#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1588#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1643#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1641#L82-2 ~q_write_ev~0 := 2; 1642#L107-1 [2019-11-15 23:03:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2019-11-15 23:03:08,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808411147] [2019-11-15 23:03:08,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,885 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2019-11-15 23:03:08,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464505143] [2019-11-15 23:03:08,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:08,911 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2019-11-15 23:03:08,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144494176] [2019-11-15 23:03:08,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144494176] [2019-11-15 23:03:08,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:08,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135581146] [2019-11-15 23:03:09,103 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:03:09,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:03:09,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:03:09,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:03:09,106 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:03:09,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:09,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:03:09,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:03:09,106 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration8_Loop [2019-11-15 23:03:09,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:03:09,107 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:03:09,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,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-11-15 23:03:09,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,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-11-15 23:03:09,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:03:09,384 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:09,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:09,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:09,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:09,405 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Honda state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:03:09,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:09,437 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:09,447 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:09,447 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:03:09,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:09,462 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:03:09,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:03:09,493 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:09,508 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:03:09,510 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:03:09,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:03:09,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:03:09,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:03:09,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:03:09,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:09,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:03:09,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:03:09,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration8_Loop [2019-11-15 23:03:09,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:03:09,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:03:09,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:09,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:03:09,796 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:03:09,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,807 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:09,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,808 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:09,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,825 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:09,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,826 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:09,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,858 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,872 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:09,877 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:09,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,882 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 23:03:09,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,884 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,888 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,889 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,891 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,892 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:09,892 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,894 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:09,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,903 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,904 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,918 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:09,918 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,918 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:09,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,921 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,922 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,924 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,925 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,930 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,931 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,940 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,941 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,947 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,948 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,948 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,953 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,953 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,966 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,967 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,970 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:09,971 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:09,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,972 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 23:03:09,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,974 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:09,975 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:09,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,978 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:09,978 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:09,980 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:09,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:09,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:09,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:09,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:09,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:09,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:09,993 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:09,994 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:09,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:09,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,006 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,006 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,007 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:10,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,010 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,010 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,011 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,014 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,018 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,020 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,022 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,028 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,029 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,038 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,038 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,041 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,043 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,048 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,049 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,054 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,054 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,056 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 23:03:10,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,058 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,059 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,061 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,061 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,063 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:10,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,070 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,071 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,077 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,077 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,078 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:10,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,081 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,081 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,084 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,085 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,088 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,095 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,095 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,104 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,105 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,111 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,111 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,114 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,114 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,119 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,120 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:10,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,123 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,124 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,125 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 23:03:10,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,126 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,126 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,127 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,128 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,130 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,130 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,130 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,130 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,132 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,132 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,142 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,142 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,143 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,143 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,148 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,149 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,149 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,149 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,153 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,153 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,154 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,154 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,156 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,156 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,157 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,157 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,160 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,160 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,161 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,162 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,168 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,168 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,169 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,170 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,174 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,174 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,175 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,175 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,177 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,177 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,178 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,179 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,179 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,186 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,186 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,186 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,187 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,189 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,190 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,190 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,190 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:10,191 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:10,191 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,193 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 23:03:10,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,194 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,194 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,195 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,195 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,198 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,198 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,199 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,199 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,201 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:10,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,210 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,211 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,211 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,212 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,217 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,217 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,218 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,218 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,219 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:10,220 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,222 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,222 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,223 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,223 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,226 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,226 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,226 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,227 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,228 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,231 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,231 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,231 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,233 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,249 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,249 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,249 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,250 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,251 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,256 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,256 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,257 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,258 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,261 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,261 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,261 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,262 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,274 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,274 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,274 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,275 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,276 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,279 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,279 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:10,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,280 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,281 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,284 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 23:03:10,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,285 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,285 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,286 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,287 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,289 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,289 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,290 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,290 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,292 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:10,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,306 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,306 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,307 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,308 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,314 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,314 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,315 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,315 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,317 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:10,317 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,319 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,319 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,320 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,321 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,323 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,323 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,324 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,325 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,327 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,328 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,328 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,330 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,349 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,349 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,350 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,351 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,358 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,358 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,359 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,360 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,362 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,362 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,363 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,364 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,386 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,386 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,387 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,388 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,391 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,391 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,392 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:10,393 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:10,393 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,395 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 23:03:10,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,396 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,396 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,397 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,397 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,400 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,400 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,401 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,401 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,402 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:10,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,410 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,410 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,411 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,412 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,415 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,416 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,416 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,416 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,417 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:10,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,420 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,420 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,421 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,422 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,424 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,424 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,425 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,426 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,429 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,429 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,429 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,430 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,438 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,438 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,439 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,439 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,447 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,447 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,448 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,448 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,452 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,452 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,452 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,453 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,460 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,460 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,461 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,462 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,466 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,466 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:10,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,467 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:10,467 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:10,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,471 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 23:03:10,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,472 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,472 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,472 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,472 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,472 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,473 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,477 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,477 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,478 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,478 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,479 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:03:10,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,492 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,492 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,493 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,494 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,498 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,498 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,499 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:10,499 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,500 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:03:10,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,503 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,504 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,504 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,505 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,509 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,509 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,510 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,510 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,515 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,515 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,515 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,517 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,517 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,543 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,543 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,544 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,558 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,558 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,559 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,560 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,565 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,565 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,566 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,578 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,578 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,579 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,580 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:10,586 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:10,586 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:10,586 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:10,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:10,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:10,587 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:10,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:10,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:10,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:10,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:10,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:10,595 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2019-11-15 23:03:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:10,621 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2019-11-15 23:03:10,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:10,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2019-11-15 23:03:10,624 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2019-11-15 23:03:10,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2019-11-15 23:03:10,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2019-11-15 23:03:10,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2019-11-15 23:03:10,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2019-11-15 23:03:10,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:10,627 INFO L688 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-11-15 23:03:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2019-11-15 23:03:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-15 23:03:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-15 23:03:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2019-11-15 23:03:10,643 INFO L711 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-11-15 23:03:10,644 INFO L591 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-11-15 23:03:10,644 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:03:10,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2019-11-15 23:03:10,645 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2019-11-15 23:03:10,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:10,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:10,649 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:10,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:10,650 INFO L791 eck$LassoCheckResult]: Stem: 1989#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1949#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1950#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2028#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2026#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2027#L313-1 assume !false; 2133#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2132#L262 assume !false; 2131#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2130#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2129#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2128#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1980#L242 assume 0 != eval_~tmp___1~0; 1977#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1978#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2013#L96 assume 0 == ~p_dw_pc~0; 2006#L107-1 [2019-11-15 23:03:10,650 INFO L793 eck$LassoCheckResult]: Loop: 2006#L107-1 assume !false; 2012#L108 assume !(0 == ~q_free~0); 1966#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1967#L32 assume !(1 == ~p_dw_pc~0); 2021#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1958#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1959#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1997#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1981#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1947#L51 assume !(1 == ~c_dr_pc~0); 1943#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1944#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1948#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2011#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2010#L82-2 ~q_write_ev~0 := 2; 2006#L107-1 [2019-11-15 23:03:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2019-11-15 23:03:10,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:10,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131920150] [2019-11-15 23:03:10,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2019-11-15 23:03:10,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:10,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419998339] [2019-11-15 23:03:10,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:10,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419998339] [2019-11-15 23:03:10,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:10,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:03:10,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775488472] [2019-11-15 23:03:10,734 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:10,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:03:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:10,734 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2019-11-15 23:03:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:10,808 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2019-11-15 23:03:10,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:03:10,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2019-11-15 23:03:10,812 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2019-11-15 23:03:10,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2019-11-15 23:03:10,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2019-11-15 23:03:10,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2019-11-15 23:03:10,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2019-11-15 23:03:10,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:10,817 INFO L688 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2019-11-15 23:03:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2019-11-15 23:03:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2019-11-15 23:03:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-15 23:03:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2019-11-15 23:03:10,824 INFO L711 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-11-15 23:03:10,824 INFO L591 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-11-15 23:03:10,824 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:03:10,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2019-11-15 23:03:10,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2019-11-15 23:03:10,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:10,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:10,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:10,827 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:10,827 INFO L791 eck$LassoCheckResult]: Stem: 2654#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2613#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2614#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2701#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2699#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2700#L313-1 assume !false; 2747#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2746#L262 assume !false; 2745#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2744#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2743#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2742#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2741#L242 assume 0 != eval_~tmp___1~0; 2740#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2688#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2680#L96 assume 0 == ~p_dw_pc~0; 2670#L107-1 [2019-11-15 23:03:10,827 INFO L793 eck$LassoCheckResult]: Loop: 2670#L107-1 assume !false; 2679#L108 assume !(0 == ~q_free~0); 2757#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2756#L32 assume !(1 == ~p_dw_pc~0); 2693#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 2622#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2623#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2664#L74 assume !(0 != immediate_notify_threads_~tmp~0); 2646#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2647#L51 assume !(1 == ~c_dr_pc~0); 2605#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2606#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2677#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2678#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 2674#L82-2 ~q_write_ev~0 := 2; 2670#L107-1 [2019-11-15 23:03:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2019-11-15 23:03:10,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:10,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379421258] [2019-11-15 23:03:10,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,837 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2019-11-15 23:03:10,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:10,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935676189] [2019-11-15 23:03:10,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,846 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:10,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2019-11-15 23:03:10,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:10,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704620992] [2019-11-15 23:03:10,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:10,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:10,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:10,973 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:03:10,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:03:10,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:03:10,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:03:10,973 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:03:10,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:10,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:03:10,974 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:03:10,974 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Loop [2019-11-15 23:03:10,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:03:10,974 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:03:10,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:10,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:10,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:10,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:10,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:10,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,224 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:03:11,224 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:11,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:11,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:11,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:11,246 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:11,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:11,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:11,261 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:11,261 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:03:11,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:11,279 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:03:11,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:03:11,306 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:11,321 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:03:11,324 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:03:11,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:03:11,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:03:11,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:03:11,324 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:03:11,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:11,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:03:11,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:03:11,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Loop [2019-11-15 23:03:11,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:03:11,325 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:03:11,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,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-11-15 23:03:11,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:11,570 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:03:11,570 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:03:11,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,571 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,572 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,572 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,575 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,575 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,586 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,587 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,587 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,589 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,590 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,592 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:11,592 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,594 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,594 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:11,595 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,595 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,596 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 23:03:11,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,597 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,597 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,599 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,600 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,601 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,602 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,602 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,606 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,606 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,608 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,609 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,609 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,612 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,612 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,614 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,615 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,615 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,617 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,617 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,617 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,618 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,620 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,620 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,622 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,623 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,623 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,624 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 23:03:11,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,625 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,626 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,628 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,628 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,630 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,630 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,630 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,635 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,635 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,637 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,638 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,640 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,641 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,643 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,643 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,646 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,646 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,647 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,649 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,649 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,652 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,652 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,653 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,654 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 23:03:11,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,655 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,655 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,658 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,658 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,660 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,660 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,661 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:11,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,665 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,666 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,668 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,669 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,671 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,672 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,674 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,675 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,678 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,678 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,678 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:11,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,680 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,681 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:11,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,684 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,684 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,685 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:11,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,686 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 23:03:11,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,687 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,687 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,687 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,688 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,689 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,690 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,690 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,691 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,692 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,692 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,693 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,693 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,698 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,699 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,699 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,700 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,702 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,702 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,702 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,702 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,703 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,705 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,705 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,706 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,706 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,708 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,709 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,709 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,710 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,713 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,713 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,713 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,713 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,714 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,717 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,717 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,718 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,718 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 23:03:11,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,723 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,723 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,723 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,724 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 23:03:11,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,724 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,727 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 23:03:11,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,727 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,728 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,728 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,728 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,729 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,731 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,731 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,732 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,732 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,734 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,734 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,735 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,735 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,736 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,743 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,743 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,743 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,745 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,747 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,747 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,748 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,749 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,752 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,752 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,753 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,754 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,756 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,756 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,757 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,758 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,762 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,762 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,762 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,762 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,763 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,767 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,767 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,768 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,768 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,775 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,775 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 23:03:11,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,776 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,776 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,777 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,779 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 23:03:11,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,780 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,780 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,781 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,782 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,784 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,784 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,784 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,785 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,787 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,787 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,788 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,788 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,790 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:11,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,799 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,799 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,800 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,802 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,804 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,804 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,805 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,806 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,808 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,808 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,809 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,811 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,813 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,813 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,814 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,815 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,815 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,820 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,820 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,821 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,821 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,822 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:11,823 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,829 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,829 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,830 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,831 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 23:03:11,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,845 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,845 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,845 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,846 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 23:03:11,847 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 23:03:11,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,853 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 23:03:11,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,854 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,854 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,855 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,855 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,858 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,858 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,858 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,859 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,861 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,861 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,862 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,862 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,862 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,867 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,867 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,868 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,869 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,872 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,872 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,873 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,874 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,877 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,877 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,878 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,878 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,882 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,882 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,882 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,883 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,886 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,886 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,887 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,887 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,887 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,890 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,890 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,891 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,891 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:03:11,892 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,895 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,895 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 23:03:11,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,896 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,896 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 23:03:11,896 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:03:11,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,899 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 23:03:11,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,900 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,900 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,900 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,901 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,904 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,904 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,905 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,909 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,909 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,909 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,909 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,911 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:03:11,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,921 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,921 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,922 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,923 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,934 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,934 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,935 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,936 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,942 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,942 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,943 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,944 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,950 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,950 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,951 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,952 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,958 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,958 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,958 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,958 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,966 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:03:11,966 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,970 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,970 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:11,971 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,972 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:11,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:11,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:11,977 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 23:03:11,978 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 23:03:11,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:11,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:11,978 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:11,978 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 23:03:11,979 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:03:11,979 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:11,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:12,177 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-11-15 23:03:12,231 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:03:12,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:03:12,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:03:12,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:03:12,232 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:03:12,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:03:12,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:03:12,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Lasso [2019-11-15 23:03:12,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:03:12,232 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:03:12,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,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-11-15 23:03:12,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,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-11-15 23:03:12,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,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-11-15 23:03:12,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-11-15 23:03:12,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,684 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:03:12,685 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:12,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:12,750 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:12,750 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:12,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:12,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:12,774 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:12,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:12,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:03:12,790 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:03:12,802 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:03:12,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:03:12,831 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:03:12,833 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:03:12,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:03:12,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:03:12,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:03:12,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:03:12,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:03:12,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:03:12,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:03:12,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Lasso [2019-11-15 23:03:12,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:03:12,834 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:03:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:12,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:03:13,268 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:03:13,268 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:03:13,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:13,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:13,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:13,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:13,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:13,271 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:13,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:03:13,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:13,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:13,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:13,280 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:13,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:13,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:13,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:13,281 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:13,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:13,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:13,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:13,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:13,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:03:13,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:13,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:13,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:13,283 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:03:13,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:03:13,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:13,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:13,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:13,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:13,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:03:13,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:13,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:03:13,285 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:03:13,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:03:13,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:03:13,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:03:13,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:03:13,289 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:03:13,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:03:13,290 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 23:03:13,290 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:03:13,302 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:03:13,324 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:03:13,337 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:03:13,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:03:13,341 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-15 23:03:13,341 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:03:13,342 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2019-11-15 23:03:13,346 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:03:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:03:13,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:03:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:03:13,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:03:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,484 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:03:13,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2019-11-15 23:03:13,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50. Second operand 6 states. Result 1087 states and 1324 transitions. Complement of second has 9 states. [2019-11-15 23:03:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:03:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:03:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2019-11-15 23:03:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2019-11-15 23:03:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:03:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2019-11-15 23:03:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:03:13,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2019-11-15 23:03:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:03:13,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2019-11-15 23:03:13,647 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2019-11-15 23:03:13,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2019-11-15 23:03:13,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2019-11-15 23:03:13,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2019-11-15 23:03:13,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2019-11-15 23:03:13,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:03:13,657 INFO L688 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2019-11-15 23:03:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2019-11-15 23:03:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2019-11-15 23:03:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 23:03:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2019-11-15 23:03:13,672 INFO L711 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-11-15 23:03:13,672 INFO L591 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-11-15 23:03:13,672 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:03:13,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2019-11-15 23:03:13,676 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2019-11-15 23:03:13,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:13,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:13,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,677 INFO L791 eck$LassoCheckResult]: Stem: 4150#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4071#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4072#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4231#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4229#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4230#L313-1 assume !false; 4372#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4371#L262 assume !false; 4370#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4369#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4367#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4366#L242 assume 0 != eval_~tmp___1~0; 4365#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4364#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 4363#L96 assume !(0 == ~p_dw_pc~0); 4174#L99 assume 1 == ~p_dw_pc~0; 4175#L109 [2019-11-15 23:03:13,678 INFO L793 eck$LassoCheckResult]: Loop: 4175#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4083#L32 assume 1 == ~p_dw_pc~0; 4084#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 4088#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4089#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4166#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 4689#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4063#L51 assume !(1 == ~c_dr_pc~0); 4064#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4682#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4683#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4598#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 4599#L82-2 ~q_write_ev~0 := 2; 4590#L107-1 assume !false; 4591#L108 assume !(0 == ~q_free~0); 4175#L109 [2019-11-15 23:03:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2019-11-15 23:03:13,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072459623] [2019-11-15 23:03:13,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072459623] [2019-11-15 23:03:13,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:13,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984715088] [2019-11-15 23:03:13,704 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:03:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2019-11-15 23:03:13,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104336301] [2019-11-15 23:03:13,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104336301] [2019-11-15 23:03:13,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 23:03:13,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612704490] [2019-11-15 23:03:13,720 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:13,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:13,721 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2019-11-15 23:03:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:13,738 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2019-11-15 23:03:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:13,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2019-11-15 23:03:13,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2019-11-15 23:03:13,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2019-11-15 23:03:13,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2019-11-15 23:03:13,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2019-11-15 23:03:13,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2019-11-15 23:03:13,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:03:13,747 INFO L688 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2019-11-15 23:03:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2019-11-15 23:03:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2019-11-15 23:03:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-15 23:03:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2019-11-15 23:03:13,753 INFO L711 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2019-11-15 23:03:13,753 INFO L591 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2019-11-15 23:03:13,753 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:03:13,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2019-11-15 23:03:13,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2019-11-15 23:03:13,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:13,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:13,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,757 INFO L791 eck$LassoCheckResult]: Stem: 5135#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5097#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5098#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5176#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5174#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5175#L313-1 assume !false; 5218#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5215#L262 assume !false; 5213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5211#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5209#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5207#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5205#L242 assume 0 != eval_~tmp___1~0; 5200#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5166#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5167#L96 assume 0 == ~p_dw_pc~0; 5199#L107-1 assume !false; 5156#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5125#L247 [2019-11-15 23:03:13,757 INFO L793 eck$LassoCheckResult]: Loop: 5125#L247 assume !(0 == ~c_dr_st~0); 5100#L262 assume !false; 5150#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5151#L214 assume !(0 == ~p_dw_st~0); 5163#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5112#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5113#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5127#L242 assume 0 != eval_~tmp___1~0; 5124#L242-1 assume !(0 == ~p_dw_st~0); 5125#L247 [2019-11-15 23:03:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2019-11-15 23:03:13,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733504332] [2019-11-15 23:03:13,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733504332] [2019-11-15 23:03:13,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:03:13,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548001694] [2019-11-15 23:03:13,774 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:03:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2019-11-15 23:03:13,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248239651] [2019-11-15 23:03:13,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248239651] [2019-11-15 23:03:13,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:03:13,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184293209] [2019-11-15 23:03:13,783 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:03:13,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:13,784 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-11-15 23:03:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:13,803 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2019-11-15 23:03:13,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:13,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2019-11-15 23:03:13,807 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2019-11-15 23:03:13,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2019-11-15 23:03:13,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2019-11-15 23:03:13,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2019-11-15 23:03:13,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2019-11-15 23:03:13,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:03:13,811 INFO L688 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2019-11-15 23:03:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2019-11-15 23:03:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2019-11-15 23:03:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-15 23:03:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2019-11-15 23:03:13,816 INFO L711 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-11-15 23:03:13,816 INFO L591 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-11-15 23:03:13,816 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:03:13,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2019-11-15 23:03:13,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-11-15 23:03:13,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:13,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:13,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,819 INFO L791 eck$LassoCheckResult]: Stem: 5701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5661#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5662#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5737#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5735#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5736#L313-1 assume !false; 5803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5801#L262 assume !false; 5799#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5796#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5794#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5791#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5789#L242 assume 0 != eval_~tmp___1~0; 5788#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5782#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5781#L96 assume 0 == ~p_dw_pc~0; 5777#L107-1 assume !false; 5748#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5744#L247 [2019-11-15 23:03:13,819 INFO L793 eck$LassoCheckResult]: Loop: 5744#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 5663#L266 assume !(0 != eval_~tmp___0~1); 5664#L262 assume !false; 5776#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5774#L214 assume !(0 == ~p_dw_st~0); 5772#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5770#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5768#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5764#L242 assume 0 != eval_~tmp___1~0; 5749#L242-1 assume !(0 == ~p_dw_st~0); 5744#L247 [2019-11-15 23:03:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,819 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2019-11-15 23:03:13,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038598711] [2019-11-15 23:03:13,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038598711] [2019-11-15 23:03:13,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:03:13,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692940735] [2019-11-15 23:03:13,835 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:03:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2019-11-15 23:03:13,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271792717] [2019-11-15 23:03:13,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:13,843 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:13,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:13,888 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-11-15 23:03:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:13,901 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2019-11-15 23:03:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:13,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2019-11-15 23:03:13,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2019-11-15 23:03:13,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2019-11-15 23:03:13,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-15 23:03:13,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-15 23:03:13,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2019-11-15 23:03:13,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:13,907 INFO L688 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2019-11-15 23:03:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2019-11-15 23:03:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2019-11-15 23:03:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 23:03:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-15 23:03:13,912 INFO L711 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-15 23:03:13,912 INFO L591 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-15 23:03:13,912 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:03:13,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2019-11-15 23:03:13,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-11-15 23:03:13,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:13,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:13,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:13,915 INFO L791 eck$LassoCheckResult]: Stem: 6168#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6127#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6128#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6210#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6209#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6199#L313-1 assume !false; 6149#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6150#L262 assume !false; 6184#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6185#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6260#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6259#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6158#L242 assume 0 != eval_~tmp___1~0; 6159#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6257#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6256#L96 assume !(0 == ~p_dw_pc~0); 6182#L99 assume 1 == ~p_dw_pc~0; 6144#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6145#L32 assume 1 == ~p_dw_pc~0; 6174#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 6175#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6250#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6247#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6191#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6124#L51 assume !(1 == ~c_dr_pc~0); 6125#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6239#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6236#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6232#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6228#L82-2 ~q_write_ev~0 := 2; 6224#L107-1 assume !false; 6220#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6217#L247 [2019-11-15 23:03:13,916 INFO L793 eck$LassoCheckResult]: Loop: 6217#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6129#L266 assume !(0 != eval_~tmp___0~1); 6130#L262 assume !false; 6242#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6240#L214 assume !(0 == ~p_dw_st~0); 6237#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6233#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6229#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6225#L242 assume 0 != eval_~tmp___1~0; 6221#L242-1 assume !(0 == ~p_dw_st~0); 6217#L247 [2019-11-15 23:03:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2019-11-15 23:03:13,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509418058] [2019-11-15 23:03:13,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509418058] [2019-11-15 23:03:13,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:13,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577400879] [2019-11-15 23:03:13,940 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:03:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2019-11-15 23:03:13,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116506991] [2019-11-15 23:03:13,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:13,945 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:13,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:13,989 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2019-11-15 23:03:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:14,005 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2019-11-15 23:03:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:14,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2019-11-15 23:03:14,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-11-15 23:03:14,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2019-11-15 23:03:14,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2019-11-15 23:03:14,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2019-11-15 23:03:14,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2019-11-15 23:03:14,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:03:14,010 INFO L688 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-11-15 23:03:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2019-11-15 23:03:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-11-15 23:03:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 23:03:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2019-11-15 23:03:14,015 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-11-15 23:03:14,016 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-11-15 23:03:14,016 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 23:03:14,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2019-11-15 23:03:14,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-11-15 23:03:14,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:03:14,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:03:14,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 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-11-15 23:03:14,019 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:14,020 INFO L791 eck$LassoCheckResult]: Stem: 6599#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6560#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6561#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6642#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6640#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6641#L313-1 assume !false; 6681#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6679#L262 assume !false; 6677#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6675#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6670#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6666#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6662#L242 assume 0 != eval_~tmp___1~0; 6659#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6633#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6625#L96 assume 0 == ~p_dw_pc~0; 6626#L107-1 assume !false; 6651#L108 assume !(0 == ~q_free~0); 6577#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6567#L32 assume !(1 == ~p_dw_pc~0); 6568#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6569#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6570#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6608#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6594#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6557#L51 assume !(1 == ~c_dr_pc~0); 6558#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6692#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6690#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6688#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6687#L82-2 ~q_write_ev~0 := 2; 6686#L107-1 assume !false; 6671#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6667#L247 [2019-11-15 23:03:14,020 INFO L793 eck$LassoCheckResult]: Loop: 6667#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6562#L266 assume !(0 != eval_~tmp___0~1); 6563#L262 assume !false; 6615#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6616#L214 assume !(0 == ~p_dw_st~0); 6693#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6685#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6612#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6592#L242 assume 0 != eval_~tmp___1~0; 6593#L242-1 assume !(0 == ~p_dw_st~0); 6667#L247 [2019-11-15 23:03:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2019-11-15 23:03:14,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:14,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707586602] [2019-11-15 23:03:14,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:14,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:14,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:14,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2019-11-15 23:03:14,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:14,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571057117] [2019-11-15 23:03:14,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:14,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:14,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:14,053 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2019-11-15 23:03:14,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:14,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875082098] [2019-11-15 23:03:14,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:14,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:14,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:03:14,076 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:03:14,497 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-11-15 23:03:14,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:03:14 BoogieIcfgContainer [2019-11-15 23:03:14,601 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:03:14,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:03:14,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:03:14,602 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:03:14,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:03:07" (3/4) ... [2019-11-15 23:03:14,605 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:03:14,689 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_60e35c49-9c8f-43ca-b160-0e8703637dab/bin/uautomizer/witness.graphml [2019-11-15 23:03:14,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:03:14,691 INFO L168 Benchmark]: Toolchain (without parser) took 8092.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 946.4 MB in the beginning and 1.3 GB in the end (delta: -316.8 MB). Peak memory consumption was 279.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:14,691 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:03:14,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:14,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:14,693 INFO L168 Benchmark]: Boogie Preprocessor took 48.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:03:14,693 INFO L168 Benchmark]: RCFGBuilder took 479.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:14,693 INFO L168 Benchmark]: BuchiAutomizer took 7027.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 848.4 MB in the end (delta: 237.9 MB). Peak memory consumption was 292.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:14,694 INFO L168 Benchmark]: Witness Printer took 88.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 848.4 MB in the beginning and 1.3 GB in the end (delta: -414.8 MB). Peak memory consumption was 344.2 kB. Max. memory is 11.5 GB. [2019-11-15 23:03:14,700 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 479.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7027.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 848.4 MB in the end (delta: 237.9 MB). Peak memory consumption was 292.9 MB. Max. memory is 11.5 GB. * Witness Printer took 88.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 848.4 MB in the beginning and 1.3 GB in the end (delta: -414.8 MB). Peak memory consumption was 344.2 kB. 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 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function q_free and consists of 6 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 210 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 659 states and ocurred in iteration 10. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1747 SDtfs, 1631 SDslu, 1732 SDs, 0 SdLazy, 203 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc1 concLT0 SILN2 SILU0 SILI4 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp18 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq210 hnf86 smp100 dnf118 smp100 tf105 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 53ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 262]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_last_write=4, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2eaf1c5f=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55405d47=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ea0c4b0=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bd59a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72bdafdd=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31403cdf=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d11487e=0, tmp=0, c_last_read=0, __retres1=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] c_dr_i = 1 [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] c_dr_st = 0 [L313] COND TRUE 1 [L316] kernel_st = 1 [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND TRUE \read(tmp) [L253] p_dw_st = 1 [L96] COND TRUE (int )p_dw_pc == 0 [L107] COND TRUE 1 [L109] COND FALSE !((int )q_free == 0) [L119] q_buf_0 = __VERIFIER_nondet_int() [L120] p_last_write = q_buf_0 [L121] p_num_write += 1 [L122] q_free = 0 [L123] q_write_ev = 1 [L67] int tmp ; [L68] int tmp___0 ; [L29] int __retres1 ; [L32] COND FALSE !((int )p_dw_pc == 1) [L42] __retres1 = 0 [L44] return (__retres1); [L72] tmp = is_do_write_p_triggered() [L74] COND FALSE !(\read(tmp)) [L48] int __retres1 ; [L51] COND FALSE !((int )c_dr_pc == 1) [L61] __retres1 = 0 [L63] return (__retres1); [L80] tmp___0 = is_do_read_c_triggered() [L82] COND FALSE !(\read(tmp___0)) [L125] q_write_ev = 2 [L107] COND TRUE 1 [L109] COND TRUE (int )q_free == 0 [L110] p_dw_st = 2 [L111] p_dw_pc = 1 Loop: [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND FALSE !((int )p_dw_st == 0) [L218] COND TRUE (int )c_dr_st == 0 [L219] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...