./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df684da5e5a56662a7be6091ec5bb0a21e1453c5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-14 04:37:18,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:37:18,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:37:18,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:37:18,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:37:18,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:37:18,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:37:18,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:37:18,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:37:18,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:37:18,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:37:18,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:37:18,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:37:18,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:37:18,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:37:18,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:37:18,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:37:18,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:37:18,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:37:18,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:37:18,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:37:18,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:37:18,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:37:18,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:37:18,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:37:18,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:37:18,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:37:18,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:37:18,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:37:18,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:37:18,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:37:18,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:37:18,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:37:18,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:37:18,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:37:18,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:37:18,119 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:37:18,137 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:37:18,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:37:18,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:37:18,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:37:18,140 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:37:18,140 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:37:18,140 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:37:18,140 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:37:18,141 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:37:18,142 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:37:18,142 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:37:18,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:37:18,143 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:37:18,143 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:37:18,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:37:18,144 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:37:18,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:37:18,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:37:18,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:37:18,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:37:18,145 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:37:18,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:37:18,145 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:37:18,145 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:37:18,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:37:18,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:37:18,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:37:18,149 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:37:18,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:37:18,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:37:18,149 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:37:18,152 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:37:18,153 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df684da5e5a56662a7be6091ec5bb0a21e1453c5 [2019-01-14 04:37:18,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:37:18,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:37:18,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:37:18,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:37:18,219 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:37:18,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2019-01-14 04:37:18,295 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227dd9ccf/efd02a02e0a548609ba443a4129ae7fb/FLAG6ce09da4c [2019-01-14 04:37:18,741 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:37:18,742 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2019-01-14 04:37:18,752 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227dd9ccf/efd02a02e0a548609ba443a4129ae7fb/FLAG6ce09da4c [2019-01-14 04:37:19,119 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227dd9ccf/efd02a02e0a548609ba443a4129ae7fb [2019-01-14 04:37:19,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:37:19,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:37:19,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:37:19,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:37:19,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:37:19,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327820ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19, skipping insertion in model container [2019-01-14 04:37:19,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:37:19,181 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:37:19,390 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:37:19,398 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:37:19,473 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:37:19,508 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:37:19,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19 WrapperNode [2019-01-14 04:37:19,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:37:19,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:37:19,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:37:19,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:37:19,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:37:19,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:37:19,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:37:19,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:37:19,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... [2019-01-14 04:37:19,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:37:19,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:37:19,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:37:19,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:37:19,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:37:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:37:20,590 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:37:20,590 INFO L286 CfgBuilder]: Removed 60 assue(true) statements. [2019-01-14 04:37:20,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:37:20 BoogieIcfgContainer [2019-01-14 04:37:20,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:37:20,592 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:37:20,592 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:37:20,596 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:37:20,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:37:20,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:37:19" (1/3) ... [2019-01-14 04:37:20,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22130ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:37:20, skipping insertion in model container [2019-01-14 04:37:20,598 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:37:20,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:19" (2/3) ... [2019-01-14 04:37:20,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22130ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:37:20, skipping insertion in model container [2019-01-14 04:37:20,599 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:37:20,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:37:20" (3/3) ... [2019-01-14 04:37:20,601 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2_false-unreach-call_false-termination.cil.c [2019-01-14 04:37:20,656 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:37:20,657 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:37:20,657 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:37:20,657 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:37:20,657 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:37:20,658 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:37:20,658 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:37:20,658 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:37:20,658 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:37:20,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2019-01-14 04:37:20,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-01-14 04:37:20,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,714 INFO L867 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] [2019-01-14 04:37:20,714 INFO L868 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] [2019-01-14 04:37:20,714 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:37:20,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2019-01-14 04:37:20,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-01-14 04:37:20,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,723 INFO L867 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] [2019-01-14 04:37:20,723 INFO L868 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] [2019-01-14 04:37:20,730 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 14#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; 76#L452true havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 11#L212true assume !(1 == ~q_req_up~0); 9#L212-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 43#L227-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 56#L232-1true assume !(0 == ~q_read_ev~0); 59#L265-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 22#L270-1true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 42#L55true assume 1 == ~p_dw_pc~0; 72#L56true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 44#L66true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 74#L67true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 69#L305true assume !(0 != activate_threads_~tmp~1); 75#L305-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 62#L74true assume !(1 == ~c_dr_pc~0); 32#L74-2true is_do_read_c_triggered_~__retres1~1 := 0; 63#L85true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 91#L86true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 77#L313true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 78#L313-2true assume !(1 == ~q_read_ev~0); 50#L283-1true assume !(1 == ~q_write_ev~0); 3#L409-1true [2019-01-14 04:37:20,731 INFO L796 eck$LassoCheckResult]: Loop: 3#L409-1true assume !false; 47#L410true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4#L354true assume false; 40#L370true start_simulation_~kernel_st~0 := 2; 7#L212-2true assume !(1 == ~q_req_up~0); 5#L212-3true start_simulation_~kernel_st~0 := 3; 57#L265-2true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 51#L265-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 16#L270-3true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12#L55-3true assume 1 == ~p_dw_pc~0; 68#L56-1true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 41#L66-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 70#L67-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 53#L305-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 58#L305-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 30#L74-3true assume 1 == ~c_dr_pc~0; 87#L75-1true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 34#L85-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 88#L86-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 80#L313-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 61#L313-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 73#L283-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 81#L288-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13#L245-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 65#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 92#L258-1true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 33#L384true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 19#L391true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L392true start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 84#L426true assume !(0 != start_simulation_~tmp~4); 3#L409-1true [2019-01-14 04:37:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1146955365, now seen corresponding path program 1 times [2019-01-14 04:37:20,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:20,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:20,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:20,907 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1868636057, now seen corresponding path program 1 times [2019-01-14 04:37:20,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:20,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:20,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:20,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:20,954 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 3 states. [2019-01-14 04:37:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:20,984 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2019-01-14 04:37:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:20,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 135 transitions. [2019-01-14 04:37:20,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:37:21,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 128 transitions. [2019-01-14 04:37:21,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-01-14 04:37:21,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-01-14 04:37:21,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2019-01-14 04:37:21,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:21,009 INFO L706 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-01-14 04:37:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2019-01-14 04:37:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-14 04:37:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 04:37:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2019-01-14 04:37:21,048 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-01-14 04:37:21,048 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-01-14 04:37:21,048 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:37:21,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 128 transitions. [2019-01-14 04:37:21,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:37:21,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:21,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:21,052 INFO L867 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] [2019-01-14 04:37:21,052 INFO L868 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, 1, 1] [2019-01-14 04:37:21,053 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 218#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; 219#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 216#L212 assume !(1 == ~q_req_up~0); 207#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 208#L227-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 253#L232-1 assume !(0 == ~q_read_ev~0); 264#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 229#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 230#L55 assume 1 == ~p_dw_pc~0; 252#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 246#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 254#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 275#L305 assume !(0 != activate_threads_~tmp~1); 276#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 267#L74 assume !(1 == ~c_dr_pc~0); 238#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 239#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 269#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 278#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 279#L313-2 assume !(1 == ~q_read_ev~0); 256#L283-1 assume !(1 == ~q_write_ev~0); 195#L409-1 [2019-01-14 04:37:21,053 INFO L796 eck$LassoCheckResult]: Loop: 195#L409-1 assume !false; 196#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 197#L354 assume !false; 198#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 242#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 243#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 272#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 257#L334 assume !(0 != eval_~tmp___1~0); 250#L370 start_simulation_~kernel_st~0 := 2; 203#L212-2 assume !(1 == ~q_req_up~0); 199#L212-3 start_simulation_~kernel_st~0 := 3; 200#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 259#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 221#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 211#L55-3 assume 1 == ~p_dw_pc~0; 212#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 206#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 251#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 260#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 261#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 236#L74-3 assume !(1 == ~c_dr_pc~0); 233#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 234#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 241#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 280#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 265#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 266#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 277#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 213#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 215#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 271#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 240#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 223#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 224#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 249#L426 assume !(0 != start_simulation_~tmp~4); 195#L409-1 [2019-01-14 04:37:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1153867225, now seen corresponding path program 1 times [2019-01-14 04:37:21,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:21,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,113 INFO L82 PathProgramCache]: Analyzing trace with hash 91737555, now seen corresponding path program 1 times [2019-01-14 04:37:21,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:21,282 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:21,283 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-01-14 04:37:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:21,317 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2019-01-14 04:37:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:21,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 127 transitions. [2019-01-14 04:37:21,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:37:21,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 127 transitions. [2019-01-14 04:37:21,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-01-14 04:37:21,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-01-14 04:37:21,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 127 transitions. [2019-01-14 04:37:21,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:21,327 INFO L706 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-01-14 04:37:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 127 transitions. [2019-01-14 04:37:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-14 04:37:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 04:37:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2019-01-14 04:37:21,334 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-01-14 04:37:21,334 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-01-14 04:37:21,335 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:37:21,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 127 transitions. [2019-01-14 04:37:21,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:37:21,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:21,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:21,340 INFO L867 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] [2019-01-14 04:37:21,340 INFO L868 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, 1, 1] [2019-01-14 04:37:21,340 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 399#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; 400#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 392#L212 assume !(1 == ~q_req_up~0); 388#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 389#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 434#L232-1 assume !(0 == ~q_read_ev~0); 445#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 408#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 409#L55 assume 1 == ~p_dw_pc~0; 433#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 424#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 435#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 454#L305 assume !(0 != activate_threads_~tmp~1); 455#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 448#L74 assume !(1 == ~c_dr_pc~0); 419#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 420#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 450#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 459#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 460#L313-2 assume !(1 == ~q_read_ev~0); 437#L283-1 assume !(1 == ~q_write_ev~0); 376#L409-1 [2019-01-14 04:37:21,341 INFO L796 eck$LassoCheckResult]: Loop: 376#L409-1 assume !false; 377#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 378#L354 assume !false; 379#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 425#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 426#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 453#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 438#L334 assume !(0 != eval_~tmp___1~0); 431#L370 start_simulation_~kernel_st~0 := 2; 384#L212-2 assume !(1 == ~q_req_up~0); 380#L212-3 start_simulation_~kernel_st~0 := 3; 381#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 440#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 402#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 394#L55-3 assume !(1 == ~p_dw_pc~0); 386#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 387#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 432#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 441#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 442#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 417#L74-3 assume 1 == ~c_dr_pc~0; 418#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 415#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 422#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 461#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 446#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 447#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 458#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 396#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 398#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 452#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 421#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 404#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 405#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 430#L426 assume !(0 != start_simulation_~tmp~4); 376#L409-1 [2019-01-14 04:37:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 434480677, now seen corresponding path program 1 times [2019-01-14 04:37:21,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:21,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash 188672275, now seen corresponding path program 1 times [2019-01-14 04:37:21,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:21,474 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:21,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:21,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:21,476 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. cyclomatic complexity: 42 Second operand 3 states. [2019-01-14 04:37:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:21,637 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2019-01-14 04:37:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:21,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 241 transitions. [2019-01-14 04:37:21,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2019-01-14 04:37:21,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 241 transitions. [2019-01-14 04:37:21,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-14 04:37:21,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-14 04:37:21,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 241 transitions. [2019-01-14 04:37:21,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:21,654 INFO L706 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2019-01-14 04:37:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 241 transitions. [2019-01-14 04:37:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-14 04:37:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-14 04:37:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 241 transitions. [2019-01-14 04:37:21,670 INFO L729 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2019-01-14 04:37:21,672 INFO L609 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2019-01-14 04:37:21,672 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:37:21,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 241 transitions. [2019-01-14 04:37:21,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2019-01-14 04:37:21,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:21,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:21,681 INFO L867 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] [2019-01-14 04:37:21,681 INFO L868 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, 1, 1] [2019-01-14 04:37:21,681 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 663#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; 664#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 660#L212 assume !(1 == ~q_req_up~0); 662#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 758#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 756#L232-1 assume !(0 == ~q_read_ev~0); 754#L265-1 assume !(0 == ~q_write_ev~0); 753#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 752#L55 assume 1 == ~p_dw_pc~0; 751#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 749#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 748#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 747#L305 assume !(0 != activate_threads_~tmp~1); 730#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 731#L74 assume !(1 == ~c_dr_pc~0); 684#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 685#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 720#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 732#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 733#L313-2 assume !(1 == ~q_read_ev~0); 702#L283-1 assume !(1 == ~q_write_ev~0); 703#L409-1 [2019-01-14 04:37:21,682 INFO L796 eck$LassoCheckResult]: Loop: 703#L409-1 assume !false; 781#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 775#L354 assume !false; 774#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 772#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 723#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 724#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 704#L334 assume !(0 != eval_~tmp___1~0); 706#L370 start_simulation_~kernel_st~0 := 2; 744#L212-2 assume !(1 == ~q_req_up~0); 642#L212-3 start_simulation_~kernel_st~0 := 3; 643#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 707#L265-4 assume !(0 == ~q_write_ev~0); 708#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 769#L55-3 assume !(1 == ~p_dw_pc~0); 768#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 766#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 765#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 764#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 763#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 760#L74-3 assume !(1 == ~c_dr_pc~0); 759#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 757#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 755#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 734#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 715#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 716#L283-3 assume !(1 == ~q_write_ev~0); 729#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 804#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 802#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 801#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 800#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 798#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 796#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 793#L426 assume !(0 != start_simulation_~tmp~4); 703#L409-1 [2019-01-14 04:37:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash -845383001, now seen corresponding path program 1 times [2019-01-14 04:37:21,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:21,742 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2007131368, now seen corresponding path program 1 times [2019-01-14 04:37:21,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:21,920 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:21,921 INFO L87 Difference]: Start difference. First operand 167 states and 241 transitions. cyclomatic complexity: 75 Second operand 3 states. [2019-01-14 04:37:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:21,986 INFO L93 Difference]: Finished difference Result 281 states and 398 transitions. [2019-01-14 04:37:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:21,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 398 transitions. [2019-01-14 04:37:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2019-01-14 04:37:21,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 281 states and 398 transitions. [2019-01-14 04:37:21,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2019-01-14 04:37:21,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2019-01-14 04:37:21,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 398 transitions. [2019-01-14 04:37:21,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:21,998 INFO L706 BuchiCegarLoop]: Abstraction has 281 states and 398 transitions. [2019-01-14 04:37:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 398 transitions. [2019-01-14 04:37:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2019-01-14 04:37:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-01-14 04:37:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2019-01-14 04:37:22,013 INFO L729 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2019-01-14 04:37:22,013 INFO L609 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2019-01-14 04:37:22,014 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:37:22,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 390 transitions. [2019-01-14 04:37:22,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 222 [2019-01-14 04:37:22,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:22,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:22,019 INFO L867 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] [2019-01-14 04:37:22,020 INFO L868 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, 1, 1] [2019-01-14 04:37:22,021 INFO L794 eck$LassoCheckResult]: Stem: 1149#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 1118#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; 1119#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 1115#L212 assume !(1 == ~q_req_up~0); 1117#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1156#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1157#L232-1 assume !(0 == ~q_read_ev~0); 1171#L265-1 assume !(0 == ~q_write_ev~0); 1128#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1129#L55 assume !(1 == ~p_dw_pc~0); 1144#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1145#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1191#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1192#L305 assume !(0 != activate_threads_~tmp~1); 1208#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1207#L74 assume !(1 == ~c_dr_pc~0); 1140#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1141#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1178#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1193#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1194#L313-2 assume !(1 == ~q_read_ev~0); 1161#L283-1 assume !(1 == ~q_write_ev~0); 1162#L409-1 [2019-01-14 04:37:22,021 INFO L796 eck$LassoCheckResult]: Loop: 1162#L409-1 assume !false; 1331#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1326#L354 assume !false; 1325#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1146#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1147#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1181#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1165#L334 assume !(0 != eval_~tmp___1~0); 1153#L370 start_simulation_~kernel_st~0 := 2; 1105#L212-2 assume !(1 == ~q_req_up~0); 1099#L212-3 start_simulation_~kernel_st~0 := 3; 1100#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1167#L265-4 assume !(0 == ~q_write_ev~0); 1168#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1369#L55-3 assume !(1 == ~p_dw_pc~0); 1351#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1350#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1185#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1163#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1164#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1138#L74-3 assume !(1 == ~c_dr_pc~0); 1135#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1136#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1143#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1196#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1173#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1174#L283-3 assume !(1 == ~q_write_ev~0); 1190#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1367#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1365#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1364#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1363#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1362#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 1361#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1356#L426 assume !(0 != start_simulation_~tmp~4); 1162#L409-1 [2019-01-14 04:37:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2124707736, now seen corresponding path program 1 times [2019-01-14 04:37:22,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:22,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:22,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:22,182 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2007131368, now seen corresponding path program 2 times [2019-01-14 04:37:22,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:22,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:22,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:22,449 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:22,451 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. cyclomatic complexity: 117 Second operand 5 states. [2019-01-14 04:37:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:22,612 INFO L93 Difference]: Finished difference Result 662 states and 942 transitions. [2019-01-14 04:37:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:22,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 942 transitions. [2019-01-14 04:37:22,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 590 [2019-01-14 04:37:22,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 662 states and 942 transitions. [2019-01-14 04:37:22,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-01-14 04:37:22,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2019-01-14 04:37:22,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 942 transitions. [2019-01-14 04:37:22,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:22,644 INFO L706 BuchiCegarLoop]: Abstraction has 662 states and 942 transitions. [2019-01-14 04:37:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 942 transitions. [2019-01-14 04:37:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 284. [2019-01-14 04:37:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-14 04:37:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2019-01-14 04:37:22,687 INFO L729 BuchiCegarLoop]: Abstraction has 284 states and 396 transitions. [2019-01-14 04:37:22,688 INFO L609 BuchiCegarLoop]: Abstraction has 284 states and 396 transitions. [2019-01-14 04:37:22,690 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:37:22,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 396 transitions. [2019-01-14 04:37:22,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2019-01-14 04:37:22,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:22,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:22,699 INFO L867 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] [2019-01-14 04:37:22,699 INFO L868 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, 1, 1] [2019-01-14 04:37:22,700 INFO L794 eck$LassoCheckResult]: Stem: 2107#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 2071#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; 2072#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 2063#L212 assume !(1 == ~q_req_up~0); 2065#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2114#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2115#L232-1 assume !(0 == ~q_read_ev~0); 2128#L265-1 assume !(0 == ~q_write_ev~0); 2131#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2176#L55 assume !(1 == ~p_dw_pc~0); 2175#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2174#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2173#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2172#L305 assume !(0 != activate_threads_~tmp~1); 2171#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2170#L74 assume !(1 == ~c_dr_pc~0); 2097#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2098#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2163#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2164#L313 assume !(0 != activate_threads_~tmp___0~1); 2270#L313-2 assume !(1 == ~q_read_ev~0); 2118#L283-1 assume !(1 == ~q_write_ev~0); 2119#L409-1 [2019-01-14 04:37:22,700 INFO L796 eck$LassoCheckResult]: Loop: 2119#L409-1 assume !false; 2266#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2049#L354 assume !false; 2050#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2104#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2105#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2141#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2120#L334 assume !(0 != eval_~tmp___1~0); 2111#L370 start_simulation_~kernel_st~0 := 2; 2055#L212-2 assume !(1 == ~q_req_up~0); 2051#L212-3 start_simulation_~kernel_st~0 := 3; 2052#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2122#L265-4 assume !(0 == ~q_write_ev~0); 2076#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2077#L55-3 assume !(1 == ~p_dw_pc~0); 2057#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2058#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2294#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2293#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2129#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2130#L74-3 assume !(1 == ~c_dr_pc~0); 2291#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2290#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2289#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2288#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2287#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2286#L283-3 assume !(1 == ~q_write_ev~0); 2283#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2282#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2279#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2278#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2274#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2272#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2271#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2269#L426 assume !(0 != start_simulation_~tmp~4); 2119#L409-1 [2019-01-14 04:37:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 1 times [2019-01-14 04:37:22,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:22,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:22,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1306066790, now seen corresponding path program 1 times [2019-01-14 04:37:22,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:22,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:22,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-01-14 04:37:22,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:22,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:22,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:22,941 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-01-14 04:37:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:23,361 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2019-01-14 04:37:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:37:23,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 586 transitions. [2019-01-14 04:37:23,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 368 [2019-01-14 04:37:23,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 430 states and 586 transitions. [2019-01-14 04:37:23,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2019-01-14 04:37:23,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2019-01-14 04:37:23,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 430 states and 586 transitions. [2019-01-14 04:37:23,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:23,377 INFO L706 BuchiCegarLoop]: Abstraction has 430 states and 586 transitions. [2019-01-14 04:37:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states and 586 transitions. [2019-01-14 04:37:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 296. [2019-01-14 04:37:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-14 04:37:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 408 transitions. [2019-01-14 04:37:23,395 INFO L729 BuchiCegarLoop]: Abstraction has 296 states and 408 transitions. [2019-01-14 04:37:23,395 INFO L609 BuchiCegarLoop]: Abstraction has 296 states and 408 transitions. [2019-01-14 04:37:23,396 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:37:23,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 408 transitions. [2019-01-14 04:37:23,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 240 [2019-01-14 04:37:23,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:23,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:23,401 INFO L867 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] [2019-01-14 04:37:23,405 INFO L868 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, 1, 1, 1] [2019-01-14 04:37:23,405 INFO L794 eck$LassoCheckResult]: Stem: 2835#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 2802#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; 2803#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 2794#L212 assume !(1 == ~q_req_up~0); 2796#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2843#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2844#L232-1 assume !(0 == ~q_read_ev~0); 2858#L265-1 assume !(0 == ~q_write_ev~0); 2814#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2815#L55 assume !(1 == ~p_dw_pc~0); 2906#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2845#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2846#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2903#L305 assume !(0 != activate_threads_~tmp~1); 2883#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2863#L74 assume !(1 == ~c_dr_pc~0); 2864#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2866#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2867#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2884#L313 assume !(0 != activate_threads_~tmp___0~1); 2885#L313-2 assume !(1 == ~q_read_ev~0); 2849#L283-1 assume !(1 == ~q_write_ev~0); 2777#L409-1 [2019-01-14 04:37:23,405 INFO L796 eck$LassoCheckResult]: Loop: 2777#L409-1 assume !false; 2778#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2805#L354 assume !false; 2962#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2961#L245 assume !(0 == ~p_dw_st~0); 2957#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 2954#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2950#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2913#L334 assume !(0 != eval_~tmp___1~0); 2915#L370 start_simulation_~kernel_st~0 := 2; 2946#L212-2 assume !(1 == ~q_req_up~0); 2781#L212-3 start_simulation_~kernel_st~0 := 3; 2782#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2852#L265-4 assume !(0 == ~q_write_ev~0); 2807#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2808#L55-3 assume !(1 == ~p_dw_pc~0); 2788#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2789#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2879#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2853#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2854#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2824#L74-3 assume !(1 == ~c_dr_pc~0); 2821#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2822#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2829#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2888#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2889#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2880#L283-3 assume !(1 == ~q_write_ev~0); 2881#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2890#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3071#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3069#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3068#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3064#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3062#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2891#L426 assume !(0 != start_simulation_~tmp~4); 2777#L409-1 [2019-01-14 04:37:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 2 times [2019-01-14 04:37:23,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash -100688383, now seen corresponding path program 1 times [2019-01-14 04:37:23,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:23,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:23,544 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:23,544 INFO L87 Difference]: Start difference. First operand 296 states and 408 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-01-14 04:37:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:23,728 INFO L93 Difference]: Finished difference Result 532 states and 732 transitions. [2019-01-14 04:37:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:23,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 732 transitions. [2019-01-14 04:37:23,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 476 [2019-01-14 04:37:23,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 732 transitions. [2019-01-14 04:37:23,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2019-01-14 04:37:23,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2019-01-14 04:37:23,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 732 transitions. [2019-01-14 04:37:23,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:23,748 INFO L706 BuchiCegarLoop]: Abstraction has 532 states and 732 transitions. [2019-01-14 04:37:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 732 transitions. [2019-01-14 04:37:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 302. [2019-01-14 04:37:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-01-14 04:37:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 410 transitions. [2019-01-14 04:37:23,761 INFO L729 BuchiCegarLoop]: Abstraction has 302 states and 410 transitions. [2019-01-14 04:37:23,762 INFO L609 BuchiCegarLoop]: Abstraction has 302 states and 410 transitions. [2019-01-14 04:37:23,762 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:37:23,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 410 transitions. [2019-01-14 04:37:23,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2019-01-14 04:37:23,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:23,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:23,768 INFO L867 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] [2019-01-14 04:37:23,768 INFO L868 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, 1, 1, 1] [2019-01-14 04:37:23,768 INFO L794 eck$LassoCheckResult]: Stem: 3675#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 3642#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; 3643#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 3634#L212 assume !(1 == ~q_req_up~0); 3636#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3683#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3684#L232-1 assume !(0 == ~q_read_ev~0); 3700#L265-1 assume !(0 == ~q_write_ev~0); 3652#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3653#L55 assume !(1 == ~p_dw_pc~0); 3738#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3685#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3686#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3735#L305 assume !(0 != activate_threads_~tmp~1); 3719#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3703#L74 assume !(1 == ~c_dr_pc~0); 3704#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3706#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3707#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3720#L313 assume !(0 != activate_threads_~tmp___0~1); 3721#L313-2 assume !(1 == ~q_read_ev~0); 3689#L283-1 assume !(1 == ~q_write_ev~0); 3690#L409-1 [2019-01-14 04:37:23,769 INFO L796 eck$LassoCheckResult]: Loop: 3690#L409-1 assume !false; 3791#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3779#L354 assume !false; 3777#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3775#L245 assume !(0 == ~p_dw_st~0); 3772#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 3769#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3767#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 3764#L334 assume !(0 != eval_~tmp___1~0); 3761#L370 start_simulation_~kernel_st~0 := 2; 3756#L212-2 assume !(1 == ~q_req_up~0); 3751#L212-3 start_simulation_~kernel_st~0 := 3; 3749#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3747#L265-4 assume !(0 == ~q_write_ev~0); 3744#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3637#L55-3 assume !(1 == ~p_dw_pc~0); 3638#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 3837#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3835#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3833#L305-3 assume !(0 != activate_threads_~tmp~1); 3831#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3819#L74-3 assume !(1 == ~c_dr_pc~0); 3817#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3816#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3815#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3814#L313-3 assume !(0 != activate_threads_~tmp___0~1); 3812#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3808#L283-3 assume !(1 == ~q_write_ev~0); 3804#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3803#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3801#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3800#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3799#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3798#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3797#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3794#L426 assume !(0 != start_simulation_~tmp~4); 3690#L409-1 [2019-01-14 04:37:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 3 times [2019-01-14 04:37:23,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:23,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:23,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1689036285, now seen corresponding path program 1 times [2019-01-14 04:37:23,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:23,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:23,857 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:23,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:23,859 INFO L87 Difference]: Start difference. First operand 302 states and 410 transitions. cyclomatic complexity: 110 Second operand 3 states. [2019-01-14 04:37:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:23,934 INFO L93 Difference]: Finished difference Result 375 states and 490 transitions. [2019-01-14 04:37:23,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:23,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 490 transitions. [2019-01-14 04:37:23,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2019-01-14 04:37:23,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 490 transitions. [2019-01-14 04:37:23,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2019-01-14 04:37:23,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2019-01-14 04:37:23,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 490 transitions. [2019-01-14 04:37:23,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:23,944 INFO L706 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2019-01-14 04:37:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 490 transitions. [2019-01-14 04:37:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2019-01-14 04:37:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-01-14 04:37:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 490 transitions. [2019-01-14 04:37:23,955 INFO L729 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2019-01-14 04:37:23,955 INFO L609 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2019-01-14 04:37:23,955 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:37:23,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 490 transitions. [2019-01-14 04:37:23,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2019-01-14 04:37:23,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:23,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:23,961 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:23,961 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:23,961 INFO L794 eck$LassoCheckResult]: Stem: 4355#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 4324#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; 4325#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 4321#L212 assume !(1 == ~q_req_up~0); 4323#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4363#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4364#L232-1 assume !(0 == ~q_read_ev~0); 4383#L265-1 assume !(0 == ~q_write_ev~0); 4335#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4336#L55 assume !(1 == ~p_dw_pc~0); 4426#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 4365#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4366#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4423#L305 assume !(0 != activate_threads_~tmp~1); 4406#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4388#L74 assume !(1 == ~c_dr_pc~0); 4347#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 4348#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4390#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4407#L313 assume !(0 != activate_threads_~tmp___0~1); 4408#L313-2 assume !(1 == ~q_read_ev~0); 4372#L283-1 assume !(1 == ~q_write_ev~0); 4373#L409-1 assume !false; 4504#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4494#L354 assume !false; 4493#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4489#L245 assume !(0 == ~p_dw_st~0); 4487#L249 [2019-01-14 04:37:23,961 INFO L796 eck$LassoCheckResult]: Loop: 4487#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 4486#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4485#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4483#L334 assume 0 != eval_~tmp___1~0; 4484#L334-1 assume !(0 == ~p_dw_st~0); 4433#L339 assume !(0 == ~c_dr_st~0); 4496#L354 assume !false; 4384#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4385#L245 assume !(0 == ~p_dw_st~0); 4487#L249 [2019-01-14 04:37:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 1 times [2019-01-14 04:37:23,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:23,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:23,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:23,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:24,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:24,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:24,035 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:24,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash 145107811, now seen corresponding path program 1 times [2019-01-14 04:37:24,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:24,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:24,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:24,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:37:24,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:24,300 INFO L87 Difference]: Start difference. First operand 375 states and 490 transitions. cyclomatic complexity: 117 Second operand 5 states. [2019-01-14 04:37:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:24,428 INFO L93 Difference]: Finished difference Result 415 states and 530 transitions. [2019-01-14 04:37:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:37:24,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 530 transitions. [2019-01-14 04:37:24,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 341 [2019-01-14 04:37:24,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 415 states and 530 transitions. [2019-01-14 04:37:24,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 415 [2019-01-14 04:37:24,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2019-01-14 04:37:24,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 530 transitions. [2019-01-14 04:37:24,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:24,439 INFO L706 BuchiCegarLoop]: Abstraction has 415 states and 530 transitions. [2019-01-14 04:37:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 530 transitions. [2019-01-14 04:37:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2019-01-14 04:37:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-01-14 04:37:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 486 transitions. [2019-01-14 04:37:24,449 INFO L729 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2019-01-14 04:37:24,449 INFO L609 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2019-01-14 04:37:24,450 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:37:24,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 486 transitions. [2019-01-14 04:37:24,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2019-01-14 04:37:24,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:24,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:24,455 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:24,455 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:24,455 INFO L794 eck$LassoCheckResult]: Stem: 5161#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 5129#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; 5130#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 5122#L212 assume !(1 == ~q_req_up~0); 5124#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5167#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5168#L232-1 assume !(0 == ~q_read_ev~0); 5187#L265-1 assume !(0 == ~q_write_ev~0); 5140#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5141#L55 assume !(1 == ~p_dw_pc~0); 5237#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 5169#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5170#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 5234#L305 assume !(0 != activate_threads_~tmp~1); 5215#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5192#L74 assume !(1 == ~c_dr_pc~0); 5193#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 5195#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5196#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5216#L313 assume !(0 != activate_threads_~tmp___0~1); 5217#L313-2 assume !(1 == ~q_read_ev~0); 5178#L283-1 assume !(1 == ~q_write_ev~0); 5179#L409-1 assume !false; 5173#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 5174#L354 assume !false; 5188#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5189#L245 assume !(0 == ~p_dw_st~0); 5160#L249 [2019-01-14 04:37:24,455 INFO L796 eck$LassoCheckResult]: Loop: 5160#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5175#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5317#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 5316#L334 assume 0 != eval_~tmp___1~0; 5315#L334-1 assume !(0 == ~p_dw_st~0); 5312#L339 assume !(0 == ~c_dr_st~0); 5302#L354 assume !false; 5300#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5159#L245 assume !(0 == ~p_dw_st~0); 5160#L249 [2019-01-14 04:37:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:24,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 2 times [2019-01-14 04:37:24,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:24,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:24,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:24,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:24,507 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:24,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash -534950559, now seen corresponding path program 1 times [2019-01-14 04:37:24,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:24,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:24,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:24,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:24,582 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:24,583 INFO L87 Difference]: Start difference. First operand 375 states and 486 transitions. cyclomatic complexity: 113 Second operand 3 states. [2019-01-14 04:37:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:24,799 INFO L93 Difference]: Finished difference Result 489 states and 622 transitions. [2019-01-14 04:37:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:24,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 489 states and 622 transitions. [2019-01-14 04:37:24,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-01-14 04:37:24,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 489 states to 489 states and 622 transitions. [2019-01-14 04:37:24,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 489 [2019-01-14 04:37:24,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 489 [2019-01-14 04:37:24,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 622 transitions. [2019-01-14 04:37:24,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:24,810 INFO L706 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2019-01-14 04:37:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 622 transitions. [2019-01-14 04:37:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-01-14 04:37:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-01-14 04:37:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 622 transitions. [2019-01-14 04:37:24,824 INFO L729 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2019-01-14 04:37:24,824 INFO L609 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2019-01-14 04:37:24,824 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:37:24,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 622 transitions. [2019-01-14 04:37:24,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-01-14 04:37:24,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:24,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:24,828 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:24,828 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:24,828 INFO L794 eck$LassoCheckResult]: Stem: 6032#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 5999#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; 6000#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 5993#L212 assume !(1 == ~q_req_up~0); 5995#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6038#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6039#L232-1 assume !(0 == ~q_read_ev~0); 6056#L265-1 assume !(0 == ~q_write_ev~0); 6010#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6011#L55 assume !(1 == ~p_dw_pc~0); 6099#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6040#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6041#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6096#L305 assume !(0 != activate_threads_~tmp~1); 6078#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6059#L74 assume !(1 == ~c_dr_pc~0); 6060#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6410#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6409#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6408#L313 assume !(0 != activate_threads_~tmp___0~1); 6081#L313-2 assume !(1 == ~q_read_ev~0); 6045#L283-1 assume !(1 == ~q_write_ev~0); 6046#L409-1 assume !false; 6403#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 6401#L354 assume !false; 6399#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6314#L245 assume !(0 == ~p_dw_st~0); 6316#L249 [2019-01-14 04:37:24,829 INFO L796 eck$LassoCheckResult]: Loop: 6316#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6155#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6311#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 6292#L334 assume 0 != eval_~tmp___1~0; 6207#L334-1 assume !(0 == ~p_dw_st~0); 6203#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 6196#L358 assume !(0 != eval_~tmp___0~2); 6197#L354 assume !false; 6321#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6317#L245 assume !(0 == ~p_dw_st~0); 6316#L249 [2019-01-14 04:37:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 3 times [2019-01-14 04:37:24,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:24,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:24,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:24,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:24,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:24,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash 545725425, now seen corresponding path program 1 times [2019-01-14 04:37:24,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:24,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:24,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,389 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:37:25,526 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 04:37:25,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:25,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:25,555 INFO L87 Difference]: Start difference. First operand 489 states and 622 transitions. cyclomatic complexity: 135 Second operand 3 states. [2019-01-14 04:37:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:25,723 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2019-01-14 04:37:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:25,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 427 transitions. [2019-01-14 04:37:25,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2019-01-14 04:37:25,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 344 states and 427 transitions. [2019-01-14 04:37:25,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 344 [2019-01-14 04:37:25,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 344 [2019-01-14 04:37:25,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 427 transitions. [2019-01-14 04:37:25,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:25,736 INFO L706 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2019-01-14 04:37:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 427 transitions. [2019-01-14 04:37:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-01-14 04:37:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-01-14 04:37:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2019-01-14 04:37:25,753 INFO L729 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2019-01-14 04:37:25,754 INFO L609 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2019-01-14 04:37:25,754 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:37:25,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 427 transitions. [2019-01-14 04:37:25,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2019-01-14 04:37:25,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:25,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:25,759 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:25,759 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:37:25,760 INFO L794 eck$LassoCheckResult]: Stem: 6875#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 6841#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; 6842#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 6835#L212 assume !(1 == ~q_req_up~0); 6837#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6883#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6884#L232-1 assume !(0 == ~q_read_ev~0); 6901#L265-1 assume !(0 == ~q_write_ev~0); 6904#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6882#L55 assume !(1 == ~p_dw_pc~0); 6873#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6874#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6885#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6952#L305 assume !(0 != activate_threads_~tmp~1); 6923#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6907#L74 assume !(1 == ~c_dr_pc~0); 6866#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6867#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6909#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6924#L313 assume !(0 != activate_threads_~tmp___0~1); 6925#L313-2 assume !(1 == ~q_read_ev~0); 6892#L283-1 assume !(1 == ~q_write_ev~0); 6893#L409-1 assume !false; 7095#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 7093#L354 assume !false; 7091#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7088#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 7086#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7085#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 7084#L334 assume 0 != eval_~tmp___1~0; 7083#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 7082#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 7008#L118 assume 0 == ~p_dw_pc~0; 7006#L129-1 [2019-01-14 04:37:25,760 INFO L796 eck$LassoCheckResult]: Loop: 7006#L129-1 assume !false; 6986#L130 assume !(0 == ~q_free~0); 6987#L131 ~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_req_up~0 := 1; 7006#L129-1 [2019-01-14 04:37:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,760 INFO L82 PathProgramCache]: Analyzing trace with hash 316097349, now seen corresponding path program 1 times [2019-01-14 04:37:25,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash 206771, now seen corresponding path program 1 times [2019-01-14 04:37:25,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:25,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2006979089, now seen corresponding path program 1 times [2019-01-14 04:37:25,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,994 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:37:26,040 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:26,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:26,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:26,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:26,043 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:37:26,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:26,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:26,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2019-01-14 04:37:26,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:26,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:26,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,473 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:37:26,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:26,480 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:26,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:26,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:26,499 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_req_up~0=1} Honda state: {~q_req_up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:26,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:26,538 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:26,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_buf_0~0=-4, ~p_last_write~0=-4, ULTIMATE.start_do_write_p_#t~nondet2=-4} Honda state: {~q_buf_0~0=-4, ~p_last_write~0=-4, ULTIMATE.start_do_write_p_#t~nondet2=-4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,567 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:26,567 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:37:26,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:26,624 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:26,661 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=-2}, {~p_num_write~0=2}, {~p_num_write~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:26,688 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:26,738 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:26,767 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:37:26,769 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:26,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:26,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:26,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:26,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:37:26,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:26,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:26,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2019-01-14 04:37:26,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:26,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:26,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:27,197 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:37:27,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:27,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:37:27,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:27,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:27,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:27,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:27,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,276 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:27,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:27,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:27,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,300 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 04:37:27,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,303 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,307 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:27,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,315 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,324 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:27,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,336 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:27,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,349 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,353 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:27,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,357 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 04:37:27,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,362 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,364 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,371 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,375 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,390 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,397 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:27,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,415 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,416 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,417 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 04:37:27,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,420 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,425 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:27,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,433 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:27,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,448 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,448 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,454 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:27,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:27,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,473 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,474 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:27,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,478 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 04:37:27,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,479 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,483 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:27,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,497 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,505 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,506 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:27,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:27,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,542 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,546 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:27,549 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:27,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,551 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 04:37:27,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:27,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,561 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,576 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:27,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,577 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,610 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:27,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,613 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,617 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:27,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,643 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:27,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,654 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 04:37:27,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,655 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,656 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,662 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:27,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,676 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,679 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:27,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,702 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,702 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,703 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,713 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:27,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,739 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,740 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:27,745 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:27,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,749 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 04:37:27,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,754 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,756 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,765 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,772 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,780 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:27,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,792 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,792 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:27,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:27,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:27,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,797 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 04:37:27,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,797 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,798 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:27,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:27,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,805 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,806 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:27,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:27,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,814 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,815 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:27,815 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:27,817 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:27,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:27,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:27,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:27,834 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:27,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:27,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:27,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:27,834 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:27,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:27,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:27,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:29,387 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-01-14 04:37:29,499 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 04:37:29,503 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:29,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:29,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:29,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:29,503 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:37:29,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:29,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:29,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:29,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2019-01-14 04:37:29,504 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:29,504 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:29,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:29,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:30,339 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,351 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,397 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,397 INFO L448 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,431 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,431 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,457 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,485 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,485 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,512 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,512 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,537 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,537 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a_t~0=0} Honda state: {~a_t~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,565 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=0, ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=0, 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,604 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,630 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Honda state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,656 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,656 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,682 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,683 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_pc~0=0} Honda state: {~c_dr_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,707 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,707 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_i~0=0} Honda state: {~c_dr_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,742 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6=0} Honda state: {ULTIMATE.start_eval_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,769 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0, ULTIMATE.start_exists_runnable_thread_~__retres1~2=0, ULTIMATE.start_exists_runnable_thread_#res=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=1, ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,793 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_st~0=0} Honda state: {~p_dw_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,814 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:30,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,870 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=-2}, {~p_num_write~0=2}, {~p_num_write~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:37:30,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,904 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,917 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_pc~0=0} Honda state: {~p_dw_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,949 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_last_read~0=0} Honda state: {~c_last_read~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:30,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:30,979 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:30,979 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_i~0=0} Honda state: {~p_dw_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:31,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret4=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:31,029 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:31,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~4=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,089 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:31,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,138 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:37:31,140 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:31,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:31,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:31,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:31,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:37:31,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:31,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:31,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2019-01-14 04:37:31,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:31,141 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:31,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,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-01-14 04:37:31,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,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-01-14 04:37:31,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,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-01-14 04:37:31,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,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-01-14 04:37:31,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-01-14 04:37:31,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:31,885 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:37:31,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:31,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:31,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:31,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:31,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:31,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:31,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:31,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:31,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:31,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:31,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:31,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:32,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:32,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:32,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:32,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:32,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:32,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:32,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:32,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:32,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:32,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:32,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:32,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:32,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:32,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:32,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:32,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:32,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,049 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:37:32,049 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:37:32,082 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:37:32,102 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:37:32,103 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:37:32,109 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:37:32,114 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 04:37:32,114 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:37:32,115 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2019-01-14 04:37:32,163 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:37:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:32,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:37:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:32,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:37:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:33,210 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:37:33,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 344 states and 427 transitions. cyclomatic complexity: 84 Second operand 5 states. [2019-01-14 04:37:34,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 344 states and 427 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 2260 states and 2825 transitions. Complement of second has 10 states. [2019-01-14 04:37:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2019-01-14 04:37:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:37:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 494 transitions. [2019-01-14 04:37:34,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 33 letters. Loop has 3 letters. [2019-01-14 04:37:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:37:34,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 36 letters. Loop has 3 letters. [2019-01-14 04:37:34,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:37:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 33 letters. Loop has 6 letters. [2019-01-14 04:37:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:37:34,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2260 states and 2825 transitions. [2019-01-14 04:37:34,334 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1134 [2019-01-14 04:37:34,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2260 states to 1818 states and 2267 transitions. [2019-01-14 04:37:34,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1267 [2019-01-14 04:37:34,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2019-01-14 04:37:34,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1818 states and 2267 transitions. [2019-01-14 04:37:34,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:37:34,352 INFO L706 BuchiCegarLoop]: Abstraction has 1818 states and 2267 transitions. [2019-01-14 04:37:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states and 2267 transitions. [2019-01-14 04:37:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1730. [2019-01-14 04:37:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-01-14 04:37:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2161 transitions. [2019-01-14 04:37:34,389 INFO L729 BuchiCegarLoop]: Abstraction has 1730 states and 2161 transitions. [2019-01-14 04:37:34,389 INFO L609 BuchiCegarLoop]: Abstraction has 1730 states and 2161 transitions. [2019-01-14 04:37:34,389 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:37:34,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1730 states and 2161 transitions. [2019-01-14 04:37:34,403 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1068 [2019-01-14 04:37:34,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:34,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:34,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,407 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-14 04:37:34,408 INFO L794 eck$LassoCheckResult]: Stem: 9672#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 9614#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; 9615#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 9612#L212 assume !(1 == ~q_req_up~0); 9597#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 9598#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 9686#L232-1 assume !(0 == ~q_read_ev~0); 9728#L265-1 assume !(0 == ~q_write_ev~0); 9639#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 9640#L55 assume !(1 == ~p_dw_pc~0); 9670#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 9671#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9687#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9760#L305 assume !(0 != activate_threads_~tmp~1); 9761#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9736#L74 assume !(1 == ~c_dr_pc~0); 9656#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 9657#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9738#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9765#L313 assume !(0 != activate_threads_~tmp___0~1); 9766#L313-2 assume !(1 == ~q_read_ev~0); 9703#L283-1 assume !(1 == ~q_write_ev~0); 9704#L409-1 assume !false; 10449#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10447#L354 assume !false; 10445#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10443#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10441#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10439#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10437#L334 assume 0 != eval_~tmp___1~0; 10435#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10433#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10431#L118 assume !(0 == ~p_dw_pc~0); 10429#L121 assume !(1 == ~p_dw_pc~0); 10424#L129-1 [2019-01-14 04:37:34,409 INFO L796 eck$LassoCheckResult]: Loop: 10424#L129-1 assume !false; 10425#L130 assume !(0 == ~q_free~0); 10396#L131 ~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_req_up~0 := 1; 10398#L129-1 assume !false; 10395#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10393#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 10112#L358 assume 0 != eval_~tmp___0~2;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 10381#L159 assume 0 == ~c_dr_pc~0; 10348#L11-2 assume !false; 10100#L171 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 10098#L354 assume !false; 10096#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10094#L245 assume !(0 == ~p_dw_st~0); 10091#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10088#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10085#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10084#L334 assume !(0 != eval_~tmp___1~0); 10083#L370 start_simulation_~kernel_st~0 := 2; 10078#L212-2 assume !(1 == ~q_req_up~0); 10076#L212-3 start_simulation_~kernel_st~0 := 3; 10075#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 10074#L265-4 assume !(0 == ~q_write_ev~0); 10073#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10072#L55-3 assume 1 == ~p_dw_pc~0; 10070#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 10069#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10068#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10066#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10065#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10063#L74-3 assume !(1 == ~c_dr_pc~0); 10062#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 10061#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10060#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10059#L313-3 assume !(0 != activate_threads_~tmp___0~1); 10058#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 10057#L283-3 assume !(1 == ~q_write_ev~0); 10014#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10056#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10055#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10054#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 10053#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10052#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 10051#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 10050#L426 assume !(0 != start_simulation_~tmp~4); 10049#L409-1 assume !false; 10048#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10047#L354 assume !false; 10046#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10045#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10044#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10043#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10042#L334 assume 0 != eval_~tmp___1~0; 10041#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10040#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10038#L118 assume !(0 == ~p_dw_pc~0); 10039#L121 assume 1 == ~p_dw_pc~0; 10116#L131 ~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_req_up~0 := 1; 10119#L129-1 assume !false; 10115#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10111#L339 assume !(0 == ~c_dr_st~0); 10109#L354 assume !false; 10107#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10105#L245 assume !(0 == ~p_dw_st~0); 10103#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10099#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10097#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10095#L334 assume !(0 != eval_~tmp___1~0); 10093#L370 start_simulation_~kernel_st~0 := 2; 10089#L212-2 assume 1 == ~q_req_up~0; 10086#L25-3 assume 0 == ~q_free~0;~q_write_ev~0 := 0; 10087#L25-5 assume 1 == ~q_free~0;~q_read_ev~0 := 0; 10277#L30-3 ~q_ev~0 := 0;~q_req_up~0 := 0; 10357#L212-3 start_simulation_~kernel_st~0 := 3; 10356#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 10355#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 10354#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10353#L55-3 assume 1 == ~p_dw_pc~0; 10352#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 10350#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10335#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10336#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10345#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10344#L74-3 assume 1 == ~c_dr_pc~0; 10342#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 10343#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10033#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10034#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 10459#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 10457#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 10456#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10455#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10454#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10453#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 10452#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10451#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 10450#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 10448#L426 assume !(0 != start_simulation_~tmp~4); 10446#L409-1 assume !false; 10444#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10442#L354 assume !false; 10440#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10438#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10436#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10434#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10432#L334 assume 0 != eval_~tmp___1~0; 10430#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10428#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10426#L118 assume !(0 == ~p_dw_pc~0); 10423#L121 assume !(1 == ~p_dw_pc~0); 10424#L129-1 [2019-01-14 04:37:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1209083458, now seen corresponding path program 1 times [2019-01-14 04:37:34,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,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-01-14 04:37:34,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:34,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash 672189047, now seen corresponding path program 1 times [2019-01-14 04:37:34,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-14 04:37:34,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:34,537 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:34,537 INFO L87 Difference]: Start difference. First operand 1730 states and 2161 transitions. cyclomatic complexity: 439 Second operand 3 states. [2019-01-14 04:37:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:34,669 INFO L93 Difference]: Finished difference Result 1296 states and 1625 transitions. [2019-01-14 04:37:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:34,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1296 states and 1625 transitions. [2019-01-14 04:37:34,682 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 610 [2019-01-14 04:37:34,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1296 states to 1296 states and 1625 transitions. [2019-01-14 04:37:34,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 735 [2019-01-14 04:37:34,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2019-01-14 04:37:34,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1296 states and 1625 transitions. [2019-01-14 04:37:34,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:37:34,695 INFO L706 BuchiCegarLoop]: Abstraction has 1296 states and 1625 transitions. [2019-01-14 04:37:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states and 1625 transitions. [2019-01-14 04:37:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1252. [2019-01-14 04:37:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-01-14 04:37:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1565 transitions. [2019-01-14 04:37:34,722 INFO L729 BuchiCegarLoop]: Abstraction has 1252 states and 1565 transitions. [2019-01-14 04:37:34,722 INFO L609 BuchiCegarLoop]: Abstraction has 1252 states and 1565 transitions. [2019-01-14 04:37:34,722 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:37:34,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1252 states and 1565 transitions. [2019-01-14 04:37:34,731 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 594 [2019-01-14 04:37:34,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:34,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:34,732 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,732 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,733 INFO L794 eck$LassoCheckResult]: Stem: 12701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 12647#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; 12648#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 12641#L212 assume !(1 == ~q_req_up~0); 12630#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 12631#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 12716#L232-1 assume !(0 == ~q_read_ev~0); 12754#L265-1 assume !(0 == ~q_write_ev~0); 12672#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12673#L55 assume !(1 == ~p_dw_pc~0); 12699#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 12700#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12717#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12781#L305 assume !(0 != activate_threads_~tmp~1); 12782#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12759#L74 assume !(1 == ~c_dr_pc~0); 12689#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 12690#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12761#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12786#L313 assume !(0 != activate_threads_~tmp___0~1); 12787#L313-2 assume !(1 == ~q_read_ev~0); 12730#L283-1 assume !(1 == ~q_write_ev~0); 12731#L409-1 assume !false; 13203#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 13202#L354 assume !false; 13201#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13200#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 13199#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13198#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13197#L334 assume 0 != eval_~tmp___1~0; 13196#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 13195#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 13194#L118 assume 0 == ~p_dw_pc~0; 13192#L129-1 assume !false; 13193#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 13313#L339 [2019-01-14 04:37:34,733 INFO L796 eck$LassoCheckResult]: Loop: 13313#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 13177#L358 assume !(0 != eval_~tmp___0~2); 13178#L354 assume !false; 13329#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13327#L245 assume !(0 == ~p_dw_st~0); 13324#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 13287#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13320#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13317#L334 assume 0 != eval_~tmp___1~0; 13315#L334-1 assume !(0 == ~p_dw_st~0); 13313#L339 [2019-01-14 04:37:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1173119927, now seen corresponding path program 1 times [2019-01-14 04:37:34,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:34,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:34,799 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash -474460271, now seen corresponding path program 2 times [2019-01-14 04:37:34,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:34,929 INFO L87 Difference]: Start difference. First operand 1252 states and 1565 transitions. cyclomatic complexity: 320 Second operand 3 states. [2019-01-14 04:37:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:35,059 INFO L93 Difference]: Finished difference Result 1925 states and 2391 transitions. [2019-01-14 04:37:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:35,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2391 transitions. [2019-01-14 04:37:35,077 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 965 [2019-01-14 04:37:35,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1924 states and 2390 transitions. [2019-01-14 04:37:35,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1122 [2019-01-14 04:37:35,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1122 [2019-01-14 04:37:35,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1924 states and 2390 transitions. [2019-01-14 04:37:35,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:37:35,092 INFO L706 BuchiCegarLoop]: Abstraction has 1924 states and 2390 transitions. [2019-01-14 04:37:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states and 2390 transitions. [2019-01-14 04:37:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1660. [2019-01-14 04:37:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-01-14 04:37:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2066 transitions. [2019-01-14 04:37:35,133 INFO L729 BuchiCegarLoop]: Abstraction has 1660 states and 2066 transitions. [2019-01-14 04:37:35,133 INFO L609 BuchiCegarLoop]: Abstraction has 1660 states and 2066 transitions. [2019-01-14 04:37:35,133 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:37:35,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1660 states and 2066 transitions. [2019-01-14 04:37:35,148 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 798 [2019-01-14 04:37:35,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:35,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:35,152 INFO L867 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, 1, 1, 1, 1, 1] [2019-01-14 04:37:35,152 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:35,153 INFO L794 eck$LassoCheckResult]: Stem: 15882#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 15828#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; 15829#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 15817#L212 assume !(1 == ~q_req_up~0); 15811#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 15812#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 15895#L232-1 assume !(0 == ~q_read_ev~0); 15927#L265-1 assume !(0 == ~q_write_ev~0); 15846#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15847#L55 assume !(1 == ~p_dw_pc~0); 15876#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 15877#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15896#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15947#L305 assume !(0 != activate_threads_~tmp~1); 15948#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15934#L74 assume !(1 == ~c_dr_pc~0); 15868#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 15869#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15936#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 15956#L313 assume !(0 != activate_threads_~tmp___0~1); 15957#L313-2 assume !(1 == ~q_read_ev~0); 15909#L283-1 assume !(1 == ~q_write_ev~0); 15910#L409-1 assume !false; 16496#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 16495#L354 assume !false; 16494#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16493#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 16492#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16491#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16490#L334 assume 0 != eval_~tmp___1~0; 16488#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 16486#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 16482#L118 assume 0 == ~p_dw_pc~0; 16468#L129-1 assume !false; 16442#L130 assume !(0 == ~q_free~0); 16279#L131 ~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_req_up~0 := 1; 16370#L129-1 assume !false; 17091#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 17090#L339 [2019-01-14 04:37:35,153 INFO L796 eck$LassoCheckResult]: Loop: 17090#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 16584#L358 assume !(0 != eval_~tmp___0~2); 17089#L354 assume !false; 17105#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 17103#L245 assume !(0 == ~p_dw_st~0); 17101#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 16798#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 17098#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 17094#L334 assume 0 != eval_~tmp___1~0; 17092#L334-1 assume !(0 == ~p_dw_st~0); 17090#L339 [2019-01-14 04:37:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash -266582925, now seen corresponding path program 1 times [2019-01-14 04:37:35,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:35,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash -474460271, now seen corresponding path program 3 times [2019-01-14 04:37:35,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:35,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:35,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:35,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1848061315, now seen corresponding path program 1 times [2019-01-14 04:37:35,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,580 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:37:35,988 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2019-01-14 04:37:36,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:37:36 BoogieIcfgContainer [2019-01-14 04:37:36,093 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:37:36,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:37:36,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:37:36,094 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:37:36,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:37:20" (3/4) ... [2019-01-14 04:37:36,099 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:37:36,169 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:37:36,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:37:36,170 INFO L168 Benchmark]: Toolchain (without parser) took 17046.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -64.5 MB). Peak memory consumption was 259.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,171 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:37:36,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.48 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:37:36,172 INFO L168 Benchmark]: Boogie Preprocessor took 145.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,173 INFO L168 Benchmark]: RCFGBuilder took 845.88 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: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,173 INFO L168 Benchmark]: BuchiAutomizer took 15501.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.0 MB). Peak memory consumption was 252.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,174 INFO L168 Benchmark]: Witness Printer took 75.41 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,177 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.48 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 145.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 845.88 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: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15501.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.0 MB). Peak memory consumption was 252.0 MB. Max. memory is 11.5 GB. * Witness Printer took 75.41 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. 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 7 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1660 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 10.5s. Construction of modules took 2.0s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1730 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1841 SDtfs, 2087 SDslu, 2232 SDs, 0 SdLazy, 243 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN2 SILU0 SILI8 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq201 hnf90 smp100 dnf132 smp100 tf104 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 70ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 354]: 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, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36aa0431=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b3e1e0c=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@497c6e21=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=1, tmp___0=0, q_write_ev=2, __retres1=1, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61ba7528=0, q_free=0, __retres1=0, p_dw_st=2, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3527010d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@315abd7a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43bef3d=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 329]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 Loop: [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...