./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 532163d21d7e473fbfa4a073427e9fd2a45c7337 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 04:34:18,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:34:18,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:34:18,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:34:18,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:34:18,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:34:18,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:34:18,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:34:18,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:34:18,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:34:18,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:34:18,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:34:18,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:34:18,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:34:18,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:34:18,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:34:18,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:34:18,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:34:18,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:34:18,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:34:18,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:34:18,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:34:18,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:34:18,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:34:18,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:34:18,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:34:18,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:34:18,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:34:18,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:34:18,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:34:18,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:34:18,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:34:18,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:34:18,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:34:18,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:34:18,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:34:18,156 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 04:34:18,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:34:18,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:34:18,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:34:18,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:34:18,168 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:34:18,168 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 04:34:18,168 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 04:34:18,168 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 04:34:18,168 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 04:34:18,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 04:34:18,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 04:34:18,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 04:34:18,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:34:18,170 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:34:18,171 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 04:34:18,171 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 04:34:18,171 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 532163d21d7e473fbfa4a073427e9fd2a45c7337 [2018-12-09 04:34:18,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:34:18,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:34:18,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:34:18,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:34:18,206 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:34:18,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c [2018-12-09 04:34:18,249 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/data/0bcb73803/0be2e0bda36a40a3886cb6a670d79b24/FLAG90f96a2b7 [2018-12-09 04:34:18,555 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:34:18,556 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c [2018-12-09 04:34:18,560 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/data/0bcb73803/0be2e0bda36a40a3886cb6a670d79b24/FLAG90f96a2b7 [2018-12-09 04:34:18,569 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/data/0bcb73803/0be2e0bda36a40a3886cb6a670d79b24 [2018-12-09 04:34:18,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:34:18,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:34:18,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:34:18,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:34:18,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:34:18,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ed00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18, skipping insertion in model container [2018-12-09 04:34:18,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:34:18,596 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:34:18,698 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:34:18,701 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:34:18,721 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:34:18,731 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:34:18,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18 WrapperNode [2018-12-09 04:34:18,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:34:18,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:34:18,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:34:18,732 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:34:18,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:34:18,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:34:18,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:34:18,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:34:18,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... [2018-12-09 04:34:18,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:34:18,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:34:18,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:34:18,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:34:18,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:34:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:34:18,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:34:19,072 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:34:19,072 INFO L280 CfgBuilder]: Removed 72 assue(true) statements. [2018-12-09 04:34:19,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:34:19 BoogieIcfgContainer [2018-12-09 04:34:19,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:34:19,073 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 04:34:19,073 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 04:34:19,075 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 04:34:19,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:34:19,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 04:34:18" (1/3) ... [2018-12-09 04:34:19,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d432c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:34:19, skipping insertion in model container [2018-12-09 04:34:19,077 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:34:19,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:34:18" (2/3) ... [2018-12-09 04:34:19,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d432c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:34:19, skipping insertion in model container [2018-12-09 04:34:19,077 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:34:19,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:34:19" (3/3) ... [2018-12-09 04:34:19,078 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu1_false-unreach-call_false-termination.cil.c [2018-12-09 04:34:19,112 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:34:19,112 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 04:34:19,112 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 04:34:19,112 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 04:34:19,112 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:34:19,112 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:34:19,112 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 04:34:19,112 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:34:19,113 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 04:34:19,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states. [2018-12-09 04:34:19,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-12-09 04:34:19,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,145 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 04:34:19,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states. [2018-12-09 04:34:19,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-12-09 04:34:19,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,153 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 13#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 19#L486true havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5#L219true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 67#L226-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 75#L231-1true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 94#L107true assume 1 == ~P_1_pc~0; 57#L108true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 95#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 58#L119true activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 27#L373true assume !(0 != activate_threads_~tmp~1); 15#L373-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 104#L189true assume 1 == ~C_1_pc~0; 62#L190true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 38#L210true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 107#L211true activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 31#L381true assume !(0 != activate_threads_~tmp___1~1); 68#L435-1true [2018-12-09 04:34:19,153 INFO L796 eck$LassoCheckResult]: Loop: 68#L435-1true assume !false; 29#L436true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 89#L294true assume false; 11#L310true start_simulation_~kernel_st~0 := 2; 3#L219-1true start_simulation_~kernel_st~0 := 3; 9#L321true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 77#L107-3true assume 1 == ~P_1_pc~0; 53#L108-1true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 93#L118-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 55#L119-1true activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 16#L373-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 20#L373-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 96#L189-3true assume 1 == ~C_1_pc~0; 60#L190-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 36#L210-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 102#L211-1true activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 32#L381-3true assume !(0 != activate_threads_~tmp___1~1); 23#L381-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 108#L244-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 42#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 113#L258-1true start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 83#L454true assume !(0 == start_simulation_~tmp~3); 85#L454-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 103#L244-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 41#L257-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 111#L258-2true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 4#L409true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 61#L416true stop_simulation_#res := stop_simulation_~__retres2~0; 25#L417true start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 112#L467true assume !(0 != start_simulation_~tmp___0~2); 68#L435-1true [2018-12-09 04:34:19,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2018-12-09 04:34:19,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:34:19,240 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 04:34:19,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,240 INFO L82 PathProgramCache]: Analyzing trace with hash 101330720, now seen corresponding path program 1 times [2018-12-09 04:34:19,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:34:19,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:34:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:34:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:34:19,258 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2018-12-09 04:34:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,273 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2018-12-09 04:34:19,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:34:19,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2018-12-09 04:34:19,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2018-12-09 04:34:19,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2018-12-09 04:34:19,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-12-09 04:34:19,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-12-09 04:34:19,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2018-12-09 04:34:19,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,280 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2018-12-09 04:34:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2018-12-09 04:34:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-09 04:34:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 04:34:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2018-12-09 04:34:19,300 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2018-12-09 04:34:19,300 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2018-12-09 04:34:19,300 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 04:34:19,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2018-12-09 04:34:19,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2018-12-09 04:34:19,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,302 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 254#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 255#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 240#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 241#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 328#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 333#L107 assume 1 == ~P_1_pc~0; 314#L108 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 315#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 317#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 277#L373 assume !(0 != activate_threads_~tmp~1); 257#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 258#L189 assume 1 == ~C_1_pc~0; 322#L190 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 286#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 290#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 280#L381 assume !(0 != activate_threads_~tmp___1~1); 281#L435-1 [2018-12-09 04:34:19,302 INFO L796 eck$LassoCheckResult]: Loop: 281#L435-1 assume !false; 279#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 275#L294 assume !false; 331#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 332#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 295#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 296#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 249#L274 assume !(0 != eval_~tmp___2~0); 250#L310 start_simulation_~kernel_st~0 := 2; 236#L219-1 start_simulation_~kernel_st~0 := 3; 237#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 251#L107-3 assume 1 == ~P_1_pc~0; 309#L108-1 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 311#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 312#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 259#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 260#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 266#L189-3 assume 1 == ~C_1_pc~0; 320#L190-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 288#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 289#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 282#L381-3 assume !(0 != activate_threads_~tmp___1~1); 268#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 269#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 293#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 294#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 336#L454 assume !(0 == start_simulation_~tmp~3); 313#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 337#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 291#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 292#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 238#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 239#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 272#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 273#L467 assume !(0 != start_simulation_~tmp___0~2); 281#L435-1 [2018-12-09 04:34:19,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2018-12-09 04:34:19,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:34:19,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 04:34:19,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 513684202, now seen corresponding path program 1 times [2018-12-09 04:34:19,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:34:19,356 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:34:19,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:34:19,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:34:19,357 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. cyclomatic complexity: 51 Second operand 3 states. [2018-12-09 04:34:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,378 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2018-12-09 04:34:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:34:19,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 272 transitions. [2018-12-09 04:34:19,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 168 [2018-12-09 04:34:19,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 272 transitions. [2018-12-09 04:34:19,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2018-12-09 04:34:19,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-12-09 04:34:19,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 272 transitions. [2018-12-09 04:34:19,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,382 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 272 transitions. [2018-12-09 04:34:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 272 transitions. [2018-12-09 04:34:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-12-09 04:34:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-09 04:34:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2018-12-09 04:34:19,387 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-12-09 04:34:19,388 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-12-09 04:34:19,388 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 04:34:19,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 267 transitions. [2018-12-09 04:34:19,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164 [2018-12-09 04:34:19,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,389 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 558#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 559#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 543#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 544#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 636#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 642#L107 assume !(1 == ~P_1_pc~0); 645#L107-2 is_P_1_triggered_~__retres1~0 := 0; 646#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 621#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 582#L373 assume !(0 != activate_threads_~tmp~1); 561#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 562#L189 assume 1 == ~C_1_pc~0; 626#L190 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 590#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 594#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 584#L381 assume !(0 != activate_threads_~tmp___1~1); 585#L435-1 [2018-12-09 04:34:19,389 INFO L796 eck$LassoCheckResult]: Loop: 585#L435-1 assume !false; 686#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 684#L294 assume !false; 639#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 640#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 599#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 600#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 552#L274 assume !(0 != eval_~tmp___2~0); 554#L310 start_simulation_~kernel_st~0 := 2; 541#L219-1 start_simulation_~kernel_st~0 := 3; 542#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 555#L107-3 assume !(1 == ~P_1_pc~0); 643#L107-5 is_P_1_triggered_~__retres1~0 := 0; 644#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 620#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 563#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 564#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 570#L189-3 assume 1 == ~C_1_pc~0; 624#L190-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 592#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 593#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 660#L381-3 assume !(0 != activate_threads_~tmp___1~1); 715#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 661#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 597#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 598#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 651#L454 assume !(0 == start_simulation_~tmp~3); 652#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 704#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 595#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 596#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 539#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 540#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 576#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 577#L467 assume !(0 != start_simulation_~tmp___0~2); 585#L435-1 [2018-12-09 04:34:19,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2018-12-09 04:34:19,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:34:19,416 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 04:34:19,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 1 times [2018-12-09 04:34:19,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:34:19,433 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:34:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:34:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:34:19,434 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-12-09 04:34:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,464 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2018-12-09 04:34:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:34:19,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 473 transitions. [2018-12-09 04:34:19,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2018-12-09 04:34:19,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 473 transitions. [2018-12-09 04:34:19,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2018-12-09 04:34:19,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2018-12-09 04:34:19,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 473 transitions. [2018-12-09 04:34:19,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,470 INFO L705 BuchiCegarLoop]: Abstraction has 338 states and 473 transitions. [2018-12-09 04:34:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 473 transitions. [2018-12-09 04:34:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 322. [2018-12-09 04:34:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-09 04:34:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 453 transitions. [2018-12-09 04:34:19,478 INFO L728 BuchiCegarLoop]: Abstraction has 322 states and 453 transitions. [2018-12-09 04:34:19,478 INFO L608 BuchiCegarLoop]: Abstraction has 322 states and 453 transitions. [2018-12-09 04:34:19,478 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 04:34:19,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states and 453 transitions. [2018-12-09 04:34:19,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-09 04:34:19,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,480 INFO L794 eck$LassoCheckResult]: Stem: 1182#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1088#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1089#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1074#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1075#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1169#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1176#L107 assume !(1 == ~P_1_pc~0); 1179#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1180#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1155#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1114#L373 assume !(0 != activate_threads_~tmp~1); 1092#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1093#L189 assume !(1 == ~C_1_pc~0); 1191#L189-2 assume !(2 == ~C_1_pc~0); 1122#L199-1 is_C_1_triggered_~__retres1~1 := 0; 1123#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1127#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1116#L381 assume !(0 != activate_threads_~tmp___1~1); 1117#L435-1 [2018-12-09 04:34:19,481 INFO L796 eck$LassoCheckResult]: Loop: 1117#L435-1 assume !false; 1297#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1294#L294 assume !false; 1292#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1290#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1287#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1285#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1281#L274 assume !(0 != eval_~tmp___2~0); 1278#L310 start_simulation_~kernel_st~0 := 2; 1277#L219-1 start_simulation_~kernel_st~0 := 3; 1276#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1275#L107-3 assume !(1 == ~P_1_pc~0); 1274#L107-5 is_P_1_triggered_~__retres1~0 := 0; 1273#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1271#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1268#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1229#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1189#L189-3 assume !(1 == ~C_1_pc~0); 1190#L189-5 assume !(2 == ~C_1_pc~0); 1201#L199-3 is_C_1_triggered_~__retres1~1 := 0; 1261#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1258#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1255#L381-3 assume !(0 != activate_threads_~tmp___1~1); 1104#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1105#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1130#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1131#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1183#L454 assume !(0 == start_simulation_~tmp~3); 1184#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1333#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1332#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1331#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1330#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1329#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 1327#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1325#L467 assume !(0 != start_simulation_~tmp___0~2); 1117#L435-1 [2018-12-09 04:34:19,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2018-12-09 04:34:19,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1124188166, now seen corresponding path program 1 times [2018-12-09 04:34:19,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:34:19,534 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:34:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:34:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:34:19,534 INFO L87 Difference]: Start difference. First operand 322 states and 453 transitions. cyclomatic complexity: 132 Second operand 5 states. [2018-12-09 04:34:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,577 INFO L93 Difference]: Finished difference Result 564 states and 783 transitions. [2018-12-09 04:34:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:34:19,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 564 states and 783 transitions. [2018-12-09 04:34:19,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 546 [2018-12-09 04:34:19,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 564 states to 564 states and 783 transitions. [2018-12-09 04:34:19,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2018-12-09 04:34:19,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2018-12-09 04:34:19,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 783 transitions. [2018-12-09 04:34:19,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,583 INFO L705 BuchiCegarLoop]: Abstraction has 564 states and 783 transitions. [2018-12-09 04:34:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 783 transitions. [2018-12-09 04:34:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 334. [2018-12-09 04:34:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-09 04:34:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2018-12-09 04:34:19,590 INFO L728 BuchiCegarLoop]: Abstraction has 334 states and 465 transitions. [2018-12-09 04:34:19,590 INFO L608 BuchiCegarLoop]: Abstraction has 334 states and 465 transitions. [2018-12-09 04:34:19,590 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 04:34:19,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 465 transitions. [2018-12-09 04:34:19,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 316 [2018-12-09 04:34:19,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,592 INFO L794 eck$LassoCheckResult]: Stem: 2085#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1991#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1992#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1976#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1977#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2070#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2077#L107 assume !(1 == ~P_1_pc~0); 2080#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2081#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2059#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2016#L373 assume !(0 != activate_threads_~tmp~1); 1995#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1996#L189 assume !(1 == ~C_1_pc~0); 2093#L189-2 assume !(2 == ~C_1_pc~0); 2027#L199-1 is_C_1_triggered_~__retres1~1 := 0; 2028#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2032#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2021#L381 assume !(0 != activate_threads_~tmp___1~1); 2022#L435-1 [2018-12-09 04:34:19,592 INFO L796 eck$LassoCheckResult]: Loop: 2022#L435-1 assume !false; 2019#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2020#L294 assume !false; 2156#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2153#L244 assume !(0 == ~P_1_st~0); 2140#L248 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2142#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2132#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2133#L274 assume !(0 != eval_~tmp___2~0); 1988#L310 start_simulation_~kernel_st~0 := 2; 1972#L219-1 start_simulation_~kernel_st~0 := 3; 1973#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2078#L107-3 assume !(1 == ~P_1_pc~0); 2079#L107-5 is_P_1_triggered_~__retres1~0 := 0; 2130#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2131#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2118#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2119#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2091#L189-3 assume !(1 == ~C_1_pc~0); 2092#L189-5 assume !(2 == ~C_1_pc~0); 2041#L199-3 is_C_1_triggered_~__retres1~1 := 0; 2030#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2031#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2270#L381-3 assume !(0 != activate_threads_~tmp___1~1); 2007#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2008#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2035#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2036#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2086#L454 assume !(0 == start_simulation_~tmp~3); 2058#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2087#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2033#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2034#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1974#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1975#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 2011#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2012#L467 assume !(0 != start_simulation_~tmp___0~2); 2022#L435-1 [2018-12-09 04:34:19,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2018-12-09 04:34:19,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash -409531438, now seen corresponding path program 1 times [2018-12-09 04:34:19,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:34:19,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:34:19,640 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:34:19,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:34:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:34:19,641 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. cyclomatic complexity: 132 Second operand 5 states. [2018-12-09 04:34:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,691 INFO L93 Difference]: Finished difference Result 746 states and 1040 transitions. [2018-12-09 04:34:19,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:34:19,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 746 states and 1040 transitions. [2018-12-09 04:34:19,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 728 [2018-12-09 04:34:19,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 746 states to 746 states and 1040 transitions. [2018-12-09 04:34:19,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 746 [2018-12-09 04:34:19,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 746 [2018-12-09 04:34:19,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 746 states and 1040 transitions. [2018-12-09 04:34:19,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,703 INFO L705 BuchiCegarLoop]: Abstraction has 746 states and 1040 transitions. [2018-12-09 04:34:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states and 1040 transitions. [2018-12-09 04:34:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 346. [2018-12-09 04:34:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-12-09 04:34:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 472 transitions. [2018-12-09 04:34:19,712 INFO L728 BuchiCegarLoop]: Abstraction has 346 states and 472 transitions. [2018-12-09 04:34:19,713 INFO L608 BuchiCegarLoop]: Abstraction has 346 states and 472 transitions. [2018-12-09 04:34:19,713 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 04:34:19,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 346 states and 472 transitions. [2018-12-09 04:34:19,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 328 [2018-12-09 04:34:19,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,715 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,716 INFO L794 eck$LassoCheckResult]: Stem: 3178#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3084#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3085#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3069#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3070#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3160#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3169#L107 assume !(1 == ~P_1_pc~0); 3173#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3174#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3148#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3108#L373 assume !(0 != activate_threads_~tmp~1); 3087#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3088#L189 assume !(1 == ~C_1_pc~0); 3186#L189-2 assume !(2 == ~C_1_pc~0); 3117#L199-1 is_C_1_triggered_~__retres1~1 := 0; 3118#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3122#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3112#L381 assume !(0 != activate_threads_~tmp___1~1); 3113#L435-1 [2018-12-09 04:34:19,716 INFO L796 eck$LassoCheckResult]: Loop: 3113#L435-1 assume !false; 3274#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3270#L294 assume !false; 3268#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3266#L244 assume !(0 == ~P_1_st~0); 3262#L248 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3260#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3256#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3247#L274 assume !(0 != eval_~tmp___2~0); 3245#L310 start_simulation_~kernel_st~0 := 2; 3243#L219-1 start_simulation_~kernel_st~0 := 3; 3235#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3171#L107-3 assume !(1 == ~P_1_pc~0); 3172#L107-5 is_P_1_triggered_~__retres1~0 := 0; 3242#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3241#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3240#L373-3 assume !(0 != activate_threads_~tmp~1); 3239#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3238#L189-3 assume !(1 == ~C_1_pc~0); 3236#L189-5 assume !(2 == ~C_1_pc~0); 3237#L199-3 is_C_1_triggered_~__retres1~1 := 0; 3222#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3223#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3218#L381-3 assume !(0 != activate_threads_~tmp___1~1); 3219#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3213#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3214#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3209#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 3210#L454 assume !(0 == start_simulation_~tmp~3); 3286#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3284#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3283#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3282#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 3281#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3280#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 3279#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 3278#L467 assume !(0 != start_simulation_~tmp___0~2); 3113#L435-1 [2018-12-09 04:34:19,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2018-12-09 04:34:19,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash 13170388, now seen corresponding path program 1 times [2018-12-09 04:34:19,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:34:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:34:19,744 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:34:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:34:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:34:19,744 INFO L87 Difference]: Start difference. First operand 346 states and 472 transitions. cyclomatic complexity: 127 Second operand 3 states. [2018-12-09 04:34:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,776 INFO L93 Difference]: Finished difference Result 506 states and 678 transitions. [2018-12-09 04:34:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:34:19,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 678 transitions. [2018-12-09 04:34:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2018-12-09 04:34:19,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 506 states and 678 transitions. [2018-12-09 04:34:19,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2018-12-09 04:34:19,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2018-12-09 04:34:19,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 678 transitions. [2018-12-09 04:34:19,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,783 INFO L705 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2018-12-09 04:34:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 678 transitions. [2018-12-09 04:34:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2018-12-09 04:34:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-12-09 04:34:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 678 transitions. [2018-12-09 04:34:19,790 INFO L728 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2018-12-09 04:34:19,790 INFO L608 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2018-12-09 04:34:19,790 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 04:34:19,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 506 states and 678 transitions. [2018-12-09 04:34:19,792 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2018-12-09 04:34:19,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,793 INFO L794 eck$LassoCheckResult]: Stem: 4039#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3942#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3943#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3927#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3928#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4021#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4030#L107 assume !(1 == ~P_1_pc~0); 4033#L107-2 is_P_1_triggered_~__retres1~0 := 0; 4034#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4009#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3968#L373 assume !(0 != activate_threads_~tmp~1); 3946#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3947#L189 assume !(1 == ~C_1_pc~0); 4049#L189-2 assume !(2 == ~C_1_pc~0); 3977#L199-1 is_C_1_triggered_~__retres1~1 := 0; 3978#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3982#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3972#L381 assume !(0 != activate_threads_~tmp___1~1); 3973#L435-1 assume !false; 4263#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 4261#L294 [2018-12-09 04:34:19,793 INFO L796 eck$LassoCheckResult]: Loop: 4261#L294 assume !false; 4256#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4253#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 4251#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4249#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4247#L274 assume 0 != eval_~tmp___2~0; 4244#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 4242#L283 assume !(0 != eval_~tmp~0); 4243#L279 assume !(0 == ~C_1_st~0); 4261#L294 [2018-12-09 04:34:19,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2018-12-09 04:34:19,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1487904191, now seen corresponding path program 1 times [2018-12-09 04:34:19,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 489258489, now seen corresponding path program 1 times [2018-12-09 04:34:19,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:34:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:34:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:34:19,861 INFO L87 Difference]: Start difference. First operand 506 states and 678 transitions. cyclomatic complexity: 175 Second operand 3 states. [2018-12-09 04:34:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,886 INFO L93 Difference]: Finished difference Result 815 states and 1070 transitions. [2018-12-09 04:34:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:34:19,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 815 states and 1070 transitions. [2018-12-09 04:34:19,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2018-12-09 04:34:19,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 815 states to 815 states and 1070 transitions. [2018-12-09 04:34:19,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 815 [2018-12-09 04:34:19,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 815 [2018-12-09 04:34:19,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 815 states and 1070 transitions. [2018-12-09 04:34:19,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,896 INFO L705 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2018-12-09 04:34:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 1070 transitions. [2018-12-09 04:34:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2018-12-09 04:34:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-12-09 04:34:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1070 transitions. [2018-12-09 04:34:19,909 INFO L728 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2018-12-09 04:34:19,909 INFO L608 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2018-12-09 04:34:19,909 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 04:34:19,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 815 states and 1070 transitions. [2018-12-09 04:34:19,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2018-12-09 04:34:19,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,913 INFO L794 eck$LassoCheckResult]: Stem: 5374#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5270#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 5271#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5256#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5257#L226-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 5356#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5366#L107 assume !(1 == ~P_1_pc~0); 5369#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5370#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5895#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5893#L373 assume !(0 != activate_threads_~tmp~1); 5891#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5392#L189 assume !(1 == ~C_1_pc~0); 5386#L189-2 assume !(2 == ~C_1_pc~0); 5307#L199-1 is_C_1_triggered_~__retres1~1 := 0; 5308#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5884#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5882#L381 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5302#L435-1 assume !false; 5888#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5804#L294 [2018-12-09 04:34:19,913 INFO L796 eck$LassoCheckResult]: Loop: 5804#L294 assume !false; 5886#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5885#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5883#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5848#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5837#L274 assume 0 != eval_~tmp___2~0; 5830#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 5831#L283 assume !(0 != eval_~tmp~0); 5806#L279 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 5803#L298 assume !(0 != eval_~tmp___1~0); 5804#L294 [2018-12-09 04:34:19,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2018-12-09 04:34:19,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:34:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:34:19,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:34:19,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:34:19,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 04:34:19,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 1 times [2018-12-09 04:34:19,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:34:19,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:34:19,964 INFO L87 Difference]: Start difference. First operand 815 states and 1070 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-12-09 04:34:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:34:19,970 INFO L93 Difference]: Finished difference Result 800 states and 1053 transitions. [2018-12-09 04:34:19,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:34:19,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 800 states and 1053 transitions. [2018-12-09 04:34:19,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2018-12-09 04:34:19,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 800 states to 800 states and 1053 transitions. [2018-12-09 04:34:19,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 800 [2018-12-09 04:34:19,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 800 [2018-12-09 04:34:19,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 800 states and 1053 transitions. [2018-12-09 04:34:19,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:34:19,979 INFO L705 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2018-12-09 04:34:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states and 1053 transitions. [2018-12-09 04:34:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2018-12-09 04:34:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-12-09 04:34:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1053 transitions. [2018-12-09 04:34:19,987 INFO L728 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2018-12-09 04:34:19,987 INFO L608 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2018-12-09 04:34:19,987 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 04:34:19,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1053 transitions. [2018-12-09 04:34:19,989 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2018-12-09 04:34:19,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:34:19,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:34:19,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:34:19,990 INFO L794 eck$LassoCheckResult]: Stem: 6986#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6891#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 6892#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 6877#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6878#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6970#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6979#L107 assume !(1 == ~P_1_pc~0); 6981#L107-2 is_P_1_triggered_~__retres1~0 := 0; 6982#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6958#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6917#L373 assume !(0 != activate_threads_~tmp~1); 6895#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6896#L189 assume !(1 == ~C_1_pc~0); 6995#L189-2 assume !(2 == ~C_1_pc~0); 6928#L199-1 is_C_1_triggered_~__retres1~1 := 0; 6929#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6933#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6921#L381 assume !(0 != activate_threads_~tmp___1~1); 6922#L435-1 assume !false; 7207#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 7139#L294 [2018-12-09 04:34:19,990 INFO L796 eck$LassoCheckResult]: Loop: 7139#L294 assume !false; 7204#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7201#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 7199#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7197#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 7195#L274 assume 0 != eval_~tmp___2~0; 7192#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 7189#L283 assume !(0 != eval_~tmp~0); 7118#L279 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 7108#L298 assume !(0 != eval_~tmp___1~0); 7139#L294 [2018-12-09 04:34:19,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2018-12-09 04:34:19,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:34:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:20,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 2 times [2018-12-09 04:34:20,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:20,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:34:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:20,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:34:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2012858129, now seen corresponding path program 1 times [2018-12-09 04:34:20,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:34:20,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:34:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:20,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:34:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:34:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:34:20,185 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-12-09 04:34:20,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 04:34:20 BoogieIcfgContainer [2018-12-09 04:34:20,242 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 04:34:20,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:34:20,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:34:20,242 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:34:20,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:34:19" (3/4) ... [2018-12-09 04:34:20,245 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 04:34:20,286 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0938e42f-5d28-446b-9b08-74a2af28d8db/bin-2019/uautomizer/witness.graphml [2018-12-09 04:34:20,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:34:20,286 INFO L168 Benchmark]: Toolchain (without parser) took 1715.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 962.4 MB in the beginning and 1.0 GB in the end (delta: -85.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:34:20,287 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:34:20,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.49 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:34:20,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:34:20,287 INFO L168 Benchmark]: Boogie Preprocessor took 16.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:34:20,288 INFO L168 Benchmark]: RCFGBuilder took 267.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:34:20,288 INFO L168 Benchmark]: BuchiAutomizer took 1168.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:34:20,288 INFO L168 Benchmark]: Witness Printer took 43.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:34:20,289 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.49 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1168.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. * Witness Printer took 43.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 800 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 650 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 815 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1196 SDtfs, 1400 SDslu, 1460 SDs, 0 SdLazy, 146 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 269]: 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 {count=0, \result=0, \result=0, P_1_pc=0, __retres1=0, C_1_i=1, tmp=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ee848d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c0fa7b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b69d754=0, data_0=0, kernel_st=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___0=0, data_1=0, __retres1=1, max_loop=2, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f0df8d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8132c63=0, C_1_pr=0, \result=0, i=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a48f706=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16bbd4d9=0, P_1_i=1, e=0, C_1_ev=0, tmp___1=0, __retres1=0, tmp___0=0, num=0, timer=0, P_1_ev=0, tmp=0, C_1_pc=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 269]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int C_1_pc ; [L123] int C_1_st ; [L124] int C_1_i ; [L125] int C_1_ev ; [L126] int C_1_pr ; [L490] int count ; [L491] int __retres2 ; [L495] num = 0 [L496] i = 0 [L497] max_loop = 2 [L499] timer = 0 [L500] P_1_pc = 0 [L501] C_1_pc = 0 [L503] count = 0 [L483] P_1_i = 1 [L484] C_1_i = 1 [L421] int kernel_st ; [L422] int tmp ; [L423] int tmp___0 ; [L427] kernel_st = 0 [L226] COND TRUE (int )P_1_i == 1 [L227] P_1_st = 0 [L231] COND TRUE (int )C_1_i == 1 [L232] C_1_st = 0 [L365] int tmp ; [L366] int tmp___0 ; [L367] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L371] tmp = is_P_1_triggered() [L373] COND FALSE !(\read(tmp)) [L186] int __retres1 ; [L189] COND FALSE !((int )C_1_pc == 1) [L199] COND FALSE !((int )C_1_pc == 2) [L209] __retres1 = 0 [L211] return (__retres1); [L379] tmp___1 = is_C_1_triggered() [L381] COND FALSE !(\read(tmp___1)) [L435] COND TRUE 1 [L438] kernel_st = 1 [L262] int tmp ; [L263] int tmp___0 ; [L264] int tmp___1 ; [L265] int tmp___2 ; Loop: [L269] COND TRUE 1 [L241] int __retres1 ; [L244] COND TRUE (int )P_1_st == 0 [L245] __retres1 = 1 [L258] return (__retres1); [L272] tmp___2 = exists_runnable_thread() [L274] COND TRUE \read(tmp___2) [L279] COND TRUE (int )P_1_st == 0 [L281] tmp = __VERIFIER_nondet_int() [L283] COND FALSE !(\read(tmp)) [L294] COND TRUE (int )C_1_st == 0 [L296] tmp___1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...