./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-906a4fb [2020-10-19 20:09:10,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:09:10,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:09:10,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:09:10,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:09:10,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:09:10,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:09:10,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:09:10,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:09:10,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:09:10,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:09:10,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:09:10,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:09:10,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:09:10,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:09:10,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:09:10,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:09:10,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:09:10,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:09:10,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:09:10,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:09:10,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:09:10,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:09:10,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:09:10,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:09:10,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:09:10,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:09:10,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:09:10,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:09:10,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:09:10,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:09:10,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:09:10,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:09:10,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:09:10,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:09:10,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:09:10,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:09:10,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:09:10,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:09:10,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:09:10,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:09:10,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:09:10,873 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:09:10,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:09:10,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:09:10,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:09:10,875 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:09:10,876 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:09:10,876 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:09:10,876 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:09:10,876 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:09:10,877 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:09:10,877 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:09:10,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:09:10,878 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:09:10,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:09:10,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:09:10,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:09:10,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:09:10,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:09:10,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:09:10,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:09:10,880 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:09:10,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:09:10,880 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:09:10,881 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:09:10,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:09:10,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:09:10,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:09:10,882 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:09:10,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:09:10,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:09:10,883 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:09:10,883 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:09:10,884 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:09:10,884 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2020-10-19 20:09:11,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:09:11,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:09:11,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:09:11,226 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:09:11,226 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:09:11,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-19 20:09:11,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840af816c/887ae34c3c7d4d7c9f29bb7138388fbe/FLAG6d8b08d81 [2020-10-19 20:09:11,750 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:09:11,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-19 20:09:11,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840af816c/887ae34c3c7d4d7c9f29bb7138388fbe/FLAG6d8b08d81 [2020-10-19 20:09:12,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840af816c/887ae34c3c7d4d7c9f29bb7138388fbe [2020-10-19 20:09:12,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:09:12,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:09:12,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:09:12,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:09:12,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:09:12,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a599841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12, skipping insertion in model container [2020-10-19 20:09:12,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:09:12,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:09:12,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:09:12,434 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:09:12,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:09:12,559 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:09:12,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12 WrapperNode [2020-10-19 20:09:12,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:09:12,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:09:12,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:09:12,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:09:12,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:09:12,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:09:12,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:09:12,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:09:12,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... [2020-10-19 20:09:12,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:09:12,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:09:12,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:09:12,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:09:12,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:09:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:09:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:09:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:09:13,273 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:09:13,274 INFO L298 CfgBuilder]: Removed 66 assume(true) statements. [2020-10-19 20:09:13,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:09:13 BoogieIcfgContainer [2020-10-19 20:09:13,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:09:13,277 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:09:13,277 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:09:13,281 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:09:13,282 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:09:13,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:09:12" (1/3) ... [2020-10-19 20:09:13,283 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71931053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:09:13, skipping insertion in model container [2020-10-19 20:09:13,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:09:13,283 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:12" (2/3) ... [2020-10-19 20:09:13,284 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71931053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:09:13, skipping insertion in model container [2020-10-19 20:09:13,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:09:13,284 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:09:13" (3/3) ... [2020-10-19 20:09:13,286 INFO L373 chiAutomizerObserver]: Analyzing ICFG bist_cell.cil.c [2020-10-19 20:09:13,333 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:09:13,334 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:09:13,334 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:09:13,334 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:09:13,334 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:09:13,334 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:09:13,335 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:09:13,335 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:09:13,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2020-10-19 20:09:13,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:13,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:13,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:13,400 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:13,401 INFO L853 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] [2020-10-19 20:09:13,401 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:09:13,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2020-10-19 20:09:13,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:13,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:13,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:13,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:13,410 INFO L853 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] [2020-10-19 20:09:13,420 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3#L-1true havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 56#L482true havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 59#L204true assume !(1 == ~b0_req_up~0); 58#L204-1true assume !(1 == ~b1_req_up~0); 103#L211true assume !(1 == ~d0_req_up~0); 38#L218true assume !(1 == ~d1_req_up~0); 108#L225true assume !(1 == ~z_req_up~0); 26#L232true assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 107#L247-1true assume !(0 == ~b0_ev~0); 98#L313-1true assume !(0 == ~b1_ev~0); 6#L318-1true assume !(0 == ~d0_ev~0); 23#L323-1true assume !(0 == ~d1_ev~0); 49#L328-1true assume !(0 == ~z_ev~0); 65#L333-1true havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 79#L99true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 80#L121true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 20#L122true activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 90#L382true assume !(0 != activate_threads_~tmp~1); 93#L382-2true assume !(1 == ~b0_ev~0); 95#L346-1true assume !(1 == ~b1_ev~0); 5#L351-1true assume !(1 == ~d0_ev~0); 22#L356-1true assume !(1 == ~d1_ev~0); 46#L361-1true assume !(1 == ~z_ev~0); 60#L424-1true [2020-10-19 20:09:13,421 INFO L796 eck$LassoCheckResult]: Loop: 60#L424-1true assume !false; 15#L425true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 44#L287true assume false; 54#L303true start_simulation_~kernel_st~0 := 2; 57#L204-2true assume !(1 == ~b0_req_up~0); 43#L204-3true assume !(1 == ~b1_req_up~0); 101#L211-1true assume !(1 == ~d0_req_up~0); 53#L218-1true assume !(1 == ~d1_req_up~0); 106#L225-1true assume !(1 == ~z_req_up~0); 24#L232-1true start_simulation_~kernel_st~0 := 3; 99#L313-2true assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 104#L313-4true assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 10#L318-3true assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 27#L323-3true assume !(0 == ~d1_ev~0); 52#L328-3true assume 0 == ~z_ev~0;~z_ev~0 := 1; 69#L333-3true havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 77#L99-1true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 78#L121-1true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 37#L122-1true activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 94#L382-3true assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 83#L382-5true assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 100#L346-3true assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 9#L351-3true assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 25#L356-3true assume !(1 == ~d1_ev~0); 50#L361-3true assume 1 == ~z_ev~0;~z_ev~0 := 2; 66#L366-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 16#L260-1true assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 70#L267-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 31#L268-1true stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 81#L399true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 14#L406true stop_simulation_#res := stop_simulation_~__retres2~0; 85#L407true start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 39#L441true assume !(0 != start_simulation_~tmp~3); 60#L424-1true [2020-10-19 20:09:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash 201072121, now seen corresponding path program 1 times [2020-10-19 20:09:13,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:13,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603477600] [2020-10-19 20:09:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:13,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603477600] [2020-10-19 20:09:13,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:13,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:13,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926697225] [2020-10-19 20:09:13,664 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash -503786151, now seen corresponding path program 1 times [2020-10-19 20:09:13,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:13,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760067094] [2020-10-19 20:09:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:13,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760067094] [2020-10-19 20:09:13,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:13,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:09:13,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828448323] [2020-10-19 20:09:13,686 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:13,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:13,706 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2020-10-19 20:09:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:13,755 INFO L93 Difference]: Finished difference Result 107 states and 173 transitions. [2020-10-19 20:09:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:13,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 173 transitions. [2020-10-19 20:09:13,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:13,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 167 transitions. [2020-10-19 20:09:13,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:13,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:13,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 167 transitions. [2020-10-19 20:09:13,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:13,773 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2020-10-19 20:09:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 167 transitions. [2020-10-19 20:09:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2020-10-19 20:09:13,808 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2020-10-19 20:09:13,808 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2020-10-19 20:09:13,808 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:09:13,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 167 transitions. [2020-10-19 20:09:13,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:13,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:13,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:13,815 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:13,815 INFO L853 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, 1] [2020-10-19 20:09:13,816 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 224#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 225#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 301#L204 assume 1 == ~b0_req_up~0; 304#L129 assume !(~b0_val~0 != ~b0_val_t~0); 315#L129-2 ~b0_req_up~0 := 0; 303#L204-1 assume !(1 == ~b1_req_up~0); 281#L211 assume !(1 == ~d0_req_up~0); 285#L218 assume !(1 == ~d1_req_up~0); 287#L225 assume !(1 == ~z_req_up~0); 268#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 269#L247-1 assume !(0 == ~b0_ev~0); 321#L313-1 assume !(0 == ~b1_ev~0); 231#L318-1 assume !(0 == ~d0_ev~0); 232#L323-1 assume !(0 == ~d1_ev~0); 264#L328-1 assume !(0 == ~z_ev~0); 296#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 306#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 247#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 259#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 260#L382 assume !(0 != activate_threads_~tmp~1); 316#L382-2 assume !(1 == ~b0_ev~0); 317#L346-1 assume !(1 == ~b1_ev~0); 229#L351-1 assume !(1 == ~d0_ev~0); 230#L356-1 assume !(1 == ~d1_ev~0); 263#L361-1 assume !(1 == ~z_ev~0); 289#L424-1 [2020-10-19 20:09:13,819 INFO L796 eck$LassoCheckResult]: Loop: 289#L424-1 assume !false; 251#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 252#L287 assume !false; 293#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 256#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 257#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 277#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 240#L282 assume !(0 != eval_~tmp___0~0); 242#L303 start_simulation_~kernel_st~0 := 2; 300#L204-2 assume !(1 == ~b0_req_up~0); 292#L204-3 assume !(1 == ~b1_req_up~0); 274#L211-1 assume !(1 == ~d0_req_up~0); 299#L218-1 assume !(1 == ~d1_req_up~0); 272#L225-1 assume !(1 == ~z_req_up~0); 265#L232-1 start_simulation_~kernel_st~0 := 3; 266#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 322#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 238#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 239#L323-3 assume !(0 == ~d1_ev~0); 270#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 298#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 307#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 244#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 283#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 284#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 311#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 312#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 236#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 237#L356-3 assume !(1 == ~d1_ev~0); 267#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 297#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 253#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 254#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 275#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 276#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 249#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 250#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 288#L441 assume !(0 != start_simulation_~tmp~3); 289#L424-1 [2020-10-19 20:09:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash 987671025, now seen corresponding path program 1 times [2020-10-19 20:09:13,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:13,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698728539] [2020-10-19 20:09:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:13,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698728539] [2020-10-19 20:09:13,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:13,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:13,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362817196] [2020-10-19 20:09:13,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 1 times [2020-10-19 20:09:13,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:13,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995856353] [2020-10-19 20:09:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:13,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995856353] [2020-10-19 20:09:13,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:13,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:13,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104462151] [2020-10-19 20:09:13,969 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:13,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:13,970 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. cyclomatic complexity: 67 Second operand 3 states. [2020-10-19 20:09:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:13,992 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2020-10-19 20:09:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:13,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 166 transitions. [2020-10-19 20:09:13,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:13,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 166 transitions. [2020-10-19 20:09:13,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:13,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:13,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 166 transitions. [2020-10-19 20:09:13,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:13,999 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2020-10-19 20:09:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 166 transitions. [2020-10-19 20:09:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 166 transitions. [2020-10-19 20:09:14,007 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2020-10-19 20:09:14,008 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2020-10-19 20:09:14,008 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:09:14,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 166 transitions. [2020-10-19 20:09:14,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,012 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,012 INFO L853 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, 1] [2020-10-19 20:09:14,012 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 435#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 436#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 512#L204 assume 1 == ~b0_req_up~0; 515#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 526#L129-2 ~b0_req_up~0 := 0; 514#L204-1 assume !(1 == ~b1_req_up~0); 492#L211 assume !(1 == ~d0_req_up~0); 496#L218 assume !(1 == ~d1_req_up~0); 498#L225 assume !(1 == ~z_req_up~0); 479#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 480#L247-1 assume !(0 == ~b0_ev~0); 532#L313-1 assume !(0 == ~b1_ev~0); 442#L318-1 assume !(0 == ~d0_ev~0); 443#L323-1 assume !(0 == ~d1_ev~0); 475#L328-1 assume !(0 == ~z_ev~0); 507#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 517#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 458#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 470#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 471#L382 assume !(0 != activate_threads_~tmp~1); 527#L382-2 assume !(1 == ~b0_ev~0); 528#L346-1 assume !(1 == ~b1_ev~0); 440#L351-1 assume !(1 == ~d0_ev~0); 441#L356-1 assume !(1 == ~d1_ev~0); 474#L361-1 assume !(1 == ~z_ev~0); 500#L424-1 [2020-10-19 20:09:14,013 INFO L796 eck$LassoCheckResult]: Loop: 500#L424-1 assume !false; 462#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 463#L287 assume !false; 504#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 467#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 468#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 488#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 451#L282 assume !(0 != eval_~tmp___0~0); 453#L303 start_simulation_~kernel_st~0 := 2; 511#L204-2 assume !(1 == ~b0_req_up~0); 503#L204-3 assume !(1 == ~b1_req_up~0); 485#L211-1 assume !(1 == ~d0_req_up~0); 510#L218-1 assume !(1 == ~d1_req_up~0); 483#L225-1 assume !(1 == ~z_req_up~0); 476#L232-1 start_simulation_~kernel_st~0 := 3; 477#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 533#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 449#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 450#L323-3 assume !(0 == ~d1_ev~0); 481#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 509#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 518#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 455#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 494#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 495#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 522#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 523#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 447#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 448#L356-3 assume !(1 == ~d1_ev~0); 478#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 508#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 464#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 465#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 486#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 487#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 460#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 461#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 499#L441 assume !(0 != start_simulation_~tmp~3); 500#L424-1 [2020-10-19 20:09:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 768816307, now seen corresponding path program 1 times [2020-10-19 20:09:14,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761954962] [2020-10-19 20:09:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761954962] [2020-10-19 20:09:14,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:14,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992366978] [2020-10-19 20:09:14,067 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 2 times [2020-10-19 20:09:14,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392277529] [2020-10-19 20:09:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392277529] [2020-10-19 20:09:14,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227968054] [2020-10-19 20:09:14,118 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:14,119 INFO L87 Difference]: Start difference. First operand 101 states and 166 transitions. cyclomatic complexity: 66 Second operand 3 states. [2020-10-19 20:09:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,138 INFO L93 Difference]: Finished difference Result 101 states and 165 transitions. [2020-10-19 20:09:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:14,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 165 transitions. [2020-10-19 20:09:14,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 165 transitions. [2020-10-19 20:09:14,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 165 transitions. [2020-10-19 20:09:14,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,145 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2020-10-19 20:09:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 165 transitions. [2020-10-19 20:09:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 165 transitions. [2020-10-19 20:09:14,152 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2020-10-19 20:09:14,152 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2020-10-19 20:09:14,153 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:09:14,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 165 transitions. [2020-10-19 20:09:14,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,156 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,156 INFO L853 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, 1] [2020-10-19 20:09:14,157 INFO L794 eck$LassoCheckResult]: Stem: 730#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 646#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 647#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 723#L204 assume 1 == ~b0_req_up~0; 726#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 737#L129-2 ~b0_req_up~0 := 0; 725#L204-1 assume 1 == ~b1_req_up~0; 683#L144 assume !(~b1_val~0 != ~b1_val_t~0); 684#L144-2 ~b1_req_up~0 := 0; 703#L211 assume !(1 == ~d0_req_up~0); 707#L218 assume !(1 == ~d1_req_up~0); 709#L225 assume !(1 == ~z_req_up~0); 690#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 691#L247-1 assume !(0 == ~b0_ev~0); 743#L313-1 assume !(0 == ~b1_ev~0); 653#L318-1 assume !(0 == ~d0_ev~0); 654#L323-1 assume !(0 == ~d1_ev~0); 686#L328-1 assume !(0 == ~z_ev~0); 718#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 728#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 669#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 681#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 682#L382 assume !(0 != activate_threads_~tmp~1); 738#L382-2 assume !(1 == ~b0_ev~0); 739#L346-1 assume !(1 == ~b1_ev~0); 651#L351-1 assume !(1 == ~d0_ev~0); 652#L356-1 assume !(1 == ~d1_ev~0); 685#L361-1 assume !(1 == ~z_ev~0); 711#L424-1 [2020-10-19 20:09:14,157 INFO L796 eck$LassoCheckResult]: Loop: 711#L424-1 assume !false; 673#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 674#L287 assume !false; 715#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 678#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 679#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 699#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 662#L282 assume !(0 != eval_~tmp___0~0); 664#L303 start_simulation_~kernel_st~0 := 2; 722#L204-2 assume !(1 == ~b0_req_up~0); 714#L204-3 assume !(1 == ~b1_req_up~0); 696#L211-1 assume !(1 == ~d0_req_up~0); 721#L218-1 assume !(1 == ~d1_req_up~0); 694#L225-1 assume !(1 == ~z_req_up~0); 687#L232-1 start_simulation_~kernel_st~0 := 3; 688#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 744#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 660#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 661#L323-3 assume !(0 == ~d1_ev~0); 692#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 720#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 729#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 666#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 705#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 706#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 733#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 734#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 658#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 659#L356-3 assume !(1 == ~d1_ev~0); 689#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 719#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 675#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 676#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 697#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 698#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 671#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 672#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 710#L441 assume !(0 != start_simulation_~tmp~3); 711#L424-1 [2020-10-19 20:09:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1003190981, now seen corresponding path program 1 times [2020-10-19 20:09:14,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847685396] [2020-10-19 20:09:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847685396] [2020-10-19 20:09:14,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:14,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283364643] [2020-10-19 20:09:14,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 3 times [2020-10-19 20:09:14,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981895442] [2020-10-19 20:09:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981895442] [2020-10-19 20:09:14,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360166219] [2020-10-19 20:09:14,264 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:09:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:09:14,265 INFO L87 Difference]: Start difference. First operand 101 states and 165 transitions. cyclomatic complexity: 65 Second operand 4 states. [2020-10-19 20:09:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,320 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2020-10-19 20:09:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:09:14,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 164 transitions. [2020-10-19 20:09:14,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 164 transitions. [2020-10-19 20:09:14,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 164 transitions. [2020-10-19 20:09:14,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,326 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-10-19 20:09:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 164 transitions. [2020-10-19 20:09:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 164 transitions. [2020-10-19 20:09:14,334 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-10-19 20:09:14,334 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-10-19 20:09:14,334 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:09:14,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 164 transitions. [2020-10-19 20:09:14,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,337 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,338 INFO L853 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, 1] [2020-10-19 20:09:14,338 INFO L794 eck$LassoCheckResult]: Stem: 944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 863#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 864#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 937#L204 assume 1 == ~b0_req_up~0; 940#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 951#L129-2 ~b0_req_up~0 := 0; 939#L204-1 assume 1 == ~b1_req_up~0; 898#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 899#L144-2 ~b1_req_up~0 := 0; 918#L211 assume !(1 == ~d0_req_up~0); 921#L218 assume !(1 == ~d1_req_up~0); 923#L225 assume !(1 == ~z_req_up~0); 904#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 905#L247-1 assume !(0 == ~b0_ev~0); 957#L313-1 assume !(0 == ~b1_ev~0); 867#L318-1 assume !(0 == ~d0_ev~0); 868#L323-1 assume !(0 == ~d1_ev~0); 900#L328-1 assume !(0 == ~z_ev~0); 932#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 942#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 883#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 895#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 896#L382 assume !(0 != activate_threads_~tmp~1); 952#L382-2 assume !(1 == ~b0_ev~0); 953#L346-1 assume !(1 == ~b1_ev~0); 865#L351-1 assume !(1 == ~d0_ev~0); 866#L356-1 assume !(1 == ~d1_ev~0); 897#L361-1 assume !(1 == ~z_ev~0); 925#L424-1 [2020-10-19 20:09:14,338 INFO L796 eck$LassoCheckResult]: Loop: 925#L424-1 assume !false; 887#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 888#L287 assume !false; 929#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 892#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 893#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 913#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 876#L282 assume !(0 != eval_~tmp___0~0); 878#L303 start_simulation_~kernel_st~0 := 2; 936#L204-2 assume !(1 == ~b0_req_up~0); 928#L204-3 assume !(1 == ~b1_req_up~0); 910#L211-1 assume !(1 == ~d0_req_up~0); 935#L218-1 assume !(1 == ~d1_req_up~0); 908#L225-1 assume !(1 == ~z_req_up~0); 901#L232-1 start_simulation_~kernel_st~0 := 3; 902#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 958#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 874#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 875#L323-3 assume !(0 == ~d1_ev~0); 906#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 934#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 943#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 880#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 919#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 920#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 947#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 948#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 872#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 873#L356-3 assume !(1 == ~d1_ev~0); 903#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 933#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 889#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 890#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 911#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 912#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 885#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 886#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 924#L441 assume !(0 != start_simulation_~tmp~3); 925#L424-1 [2020-10-19 20:09:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1425892807, now seen corresponding path program 1 times [2020-10-19 20:09:14,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387761837] [2020-10-19 20:09:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387761837] [2020-10-19 20:09:14,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:14,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963901620] [2020-10-19 20:09:14,376 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 4 times [2020-10-19 20:09:14,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836909956] [2020-10-19 20:09:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836909956] [2020-10-19 20:09:14,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989750807] [2020-10-19 20:09:14,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:14,422 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. cyclomatic complexity: 64 Second operand 3 states. [2020-10-19 20:09:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,437 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2020-10-19 20:09:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:14,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 163 transitions. [2020-10-19 20:09:14,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 163 transitions. [2020-10-19 20:09:14,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 163 transitions. [2020-10-19 20:09:14,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,442 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-19 20:09:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 163 transitions. [2020-10-19 20:09:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2020-10-19 20:09:14,448 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-19 20:09:14,448 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-19 20:09:14,449 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:09:14,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 163 transitions. [2020-10-19 20:09:14,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,451 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,452 INFO L853 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, 1] [2020-10-19 20:09:14,452 INFO L794 eck$LassoCheckResult]: Stem: 1155#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1074#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1075#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1148#L204 assume 1 == ~b0_req_up~0; 1151#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1162#L129-2 ~b0_req_up~0 := 0; 1150#L204-1 assume 1 == ~b1_req_up~0; 1108#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1109#L144-2 ~b1_req_up~0 := 0; 1129#L211 assume 1 == ~d0_req_up~0; 1171#L159 assume !(~d0_val~0 != ~d0_val_t~0); 1161#L159-2 ~d0_req_up~0 := 0; 1134#L218 assume !(1 == ~d1_req_up~0); 1136#L225 assume !(1 == ~z_req_up~0); 1115#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1116#L247-1 assume !(0 == ~b0_ev~0); 1168#L313-1 assume !(0 == ~b1_ev~0); 1080#L318-1 assume !(0 == ~d0_ev~0); 1081#L323-1 assume !(0 == ~d1_ev~0); 1111#L328-1 assume !(0 == ~z_ev~0); 1143#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1153#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1094#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1106#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1107#L382 assume !(0 != activate_threads_~tmp~1); 1163#L382-2 assume !(1 == ~b0_ev~0); 1164#L346-1 assume !(1 == ~b1_ev~0); 1076#L351-1 assume !(1 == ~d0_ev~0); 1077#L356-1 assume !(1 == ~d1_ev~0); 1110#L361-1 assume !(1 == ~z_ev~0); 1133#L424-1 [2020-10-19 20:09:14,452 INFO L796 eck$LassoCheckResult]: Loop: 1133#L424-1 assume !false; 1098#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1099#L287 assume !false; 1140#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1103#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1104#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1124#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1087#L282 assume !(0 != eval_~tmp___0~0); 1089#L303 start_simulation_~kernel_st~0 := 2; 1147#L204-2 assume !(1 == ~b0_req_up~0); 1139#L204-3 assume !(1 == ~b1_req_up~0); 1121#L211-1 assume !(1 == ~d0_req_up~0); 1146#L218-1 assume !(1 == ~d1_req_up~0); 1119#L225-1 assume !(1 == ~z_req_up~0); 1112#L232-1 start_simulation_~kernel_st~0 := 3; 1113#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1169#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1085#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1086#L323-3 assume !(0 == ~d1_ev~0); 1117#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1145#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1154#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1091#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1130#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1131#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1158#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1159#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1083#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1084#L356-3 assume !(1 == ~d1_ev~0); 1114#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1144#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1100#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1101#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1122#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1123#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1096#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1097#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1132#L441 assume !(0 != start_simulation_~tmp~3); 1133#L424-1 [2020-10-19 20:09:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -665750479, now seen corresponding path program 1 times [2020-10-19 20:09:14,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558457631] [2020-10-19 20:09:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558457631] [2020-10-19 20:09:14,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:14,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122688441] [2020-10-19 20:09:14,503 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 5 times [2020-10-19 20:09:14,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571638517] [2020-10-19 20:09:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571638517] [2020-10-19 20:09:14,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102938498] [2020-10-19 20:09:14,560 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:09:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:09:14,561 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. cyclomatic complexity: 63 Second operand 4 states. [2020-10-19 20:09:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,608 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2020-10-19 20:09:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:09:14,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 162 transitions. [2020-10-19 20:09:14,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 162 transitions. [2020-10-19 20:09:14,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 162 transitions. [2020-10-19 20:09:14,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,618 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-19 20:09:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 162 transitions. [2020-10-19 20:09:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2020-10-19 20:09:14,624 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-19 20:09:14,624 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-19 20:09:14,624 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:09:14,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 162 transitions. [2020-10-19 20:09:14,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,627 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,627 INFO L853 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, 1] [2020-10-19 20:09:14,627 INFO L794 eck$LassoCheckResult]: Stem: 1369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1285#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1286#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1362#L204 assume 1 == ~b0_req_up~0; 1365#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1376#L129-2 ~b0_req_up~0 := 0; 1364#L204-1 assume 1 == ~b1_req_up~0; 1322#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1323#L144-2 ~b1_req_up~0 := 0; 1342#L211 assume 1 == ~d0_req_up~0; 1385#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1375#L159-2 ~d0_req_up~0 := 0; 1348#L218 assume !(1 == ~d1_req_up~0); 1350#L225 assume !(1 == ~z_req_up~0); 1329#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1330#L247-1 assume !(0 == ~b0_ev~0); 1382#L313-1 assume !(0 == ~b1_ev~0); 1292#L318-1 assume !(0 == ~d0_ev~0); 1293#L323-1 assume !(0 == ~d1_ev~0); 1325#L328-1 assume !(0 == ~z_ev~0); 1357#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1367#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1308#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1320#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1321#L382 assume !(0 != activate_threads_~tmp~1); 1377#L382-2 assume !(1 == ~b0_ev~0); 1378#L346-1 assume !(1 == ~b1_ev~0); 1290#L351-1 assume !(1 == ~d0_ev~0); 1291#L356-1 assume !(1 == ~d1_ev~0); 1324#L361-1 assume !(1 == ~z_ev~0); 1347#L424-1 [2020-10-19 20:09:14,628 INFO L796 eck$LassoCheckResult]: Loop: 1347#L424-1 assume !false; 1312#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1313#L287 assume !false; 1354#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1317#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1318#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1338#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1301#L282 assume !(0 != eval_~tmp___0~0); 1303#L303 start_simulation_~kernel_st~0 := 2; 1361#L204-2 assume !(1 == ~b0_req_up~0); 1353#L204-3 assume !(1 == ~b1_req_up~0); 1337#L211-1 assume !(1 == ~d0_req_up~0); 1360#L218-1 assume !(1 == ~d1_req_up~0); 1333#L225-1 assume !(1 == ~z_req_up~0); 1326#L232-1 start_simulation_~kernel_st~0 := 3; 1327#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1383#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1299#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1300#L323-3 assume !(0 == ~d1_ev~0); 1331#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1359#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1368#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1305#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1344#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1345#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1372#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1373#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1297#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1298#L356-3 assume !(1 == ~d1_ev~0); 1328#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1358#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1314#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1315#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1334#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1335#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1310#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1311#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1346#L441 assume !(0 != start_simulation_~tmp~3); 1347#L424-1 [2020-10-19 20:09:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,628 INFO L82 PathProgramCache]: Analyzing trace with hash 151897971, now seen corresponding path program 1 times [2020-10-19 20:09:14,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804265404] [2020-10-19 20:09:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804265404] [2020-10-19 20:09:14,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:14,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830145174] [2020-10-19 20:09:14,656 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 6 times [2020-10-19 20:09:14,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405482154] [2020-10-19 20:09:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405482154] [2020-10-19 20:09:14,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361782682] [2020-10-19 20:09:14,687 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:14,688 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. cyclomatic complexity: 62 Second operand 3 states. [2020-10-19 20:09:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,701 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2020-10-19 20:09:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:14,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 161 transitions. [2020-10-19 20:09:14,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 161 transitions. [2020-10-19 20:09:14,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 161 transitions. [2020-10-19 20:09:14,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,705 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2020-10-19 20:09:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 161 transitions. [2020-10-19 20:09:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2020-10-19 20:09:14,710 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2020-10-19 20:09:14,710 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2020-10-19 20:09:14,711 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:09:14,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 161 transitions. [2020-10-19 20:09:14,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,713 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,713 INFO L853 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, 1] [2020-10-19 20:09:14,714 INFO L794 eck$LassoCheckResult]: Stem: 1580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1496#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1497#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1573#L204 assume 1 == ~b0_req_up~0; 1576#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1587#L129-2 ~b0_req_up~0 := 0; 1575#L204-1 assume 1 == ~b1_req_up~0; 1533#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1534#L144-2 ~b1_req_up~0 := 0; 1553#L211 assume 1 == ~d0_req_up~0; 1596#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1586#L159-2 ~d0_req_up~0 := 0; 1557#L218 assume 1 == ~d1_req_up~0; 1558#L174 assume !(~d1_val~0 != ~d1_val_t~0); 1566#L174-2 ~d1_req_up~0 := 0; 1567#L225 assume !(1 == ~z_req_up~0); 1540#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1541#L247-1 assume !(0 == ~b0_ev~0); 1593#L313-1 assume !(0 == ~b1_ev~0); 1503#L318-1 assume !(0 == ~d0_ev~0); 1504#L323-1 assume !(0 == ~d1_ev~0); 1536#L328-1 assume !(0 == ~z_ev~0); 1568#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1578#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1519#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1531#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1532#L382 assume !(0 != activate_threads_~tmp~1); 1588#L382-2 assume !(1 == ~b0_ev~0); 1589#L346-1 assume !(1 == ~b1_ev~0); 1501#L351-1 assume !(1 == ~d0_ev~0); 1502#L356-1 assume !(1 == ~d1_ev~0); 1535#L361-1 assume !(1 == ~z_ev~0); 1560#L424-1 [2020-10-19 20:09:14,714 INFO L796 eck$LassoCheckResult]: Loop: 1560#L424-1 assume !false; 1523#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1524#L287 assume !false; 1564#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1528#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1529#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1549#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1512#L282 assume !(0 != eval_~tmp___0~0); 1514#L303 start_simulation_~kernel_st~0 := 2; 1572#L204-2 assume !(1 == ~b0_req_up~0); 1563#L204-3 assume !(1 == ~b1_req_up~0); 1546#L211-1 assume !(1 == ~d0_req_up~0); 1571#L218-1 assume !(1 == ~d1_req_up~0); 1544#L225-1 assume !(1 == ~z_req_up~0); 1537#L232-1 start_simulation_~kernel_st~0 := 3; 1538#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1594#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1510#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1511#L323-3 assume !(0 == ~d1_ev~0); 1542#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1570#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1579#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1516#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1555#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1556#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1583#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1584#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1508#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1509#L356-3 assume !(1 == ~d1_ev~0); 1539#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1569#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1525#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1526#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1547#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1548#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1521#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1522#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1559#L441 assume !(0 != start_simulation_~tmp~3); 1560#L424-1 [2020-10-19 20:09:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -650688005, now seen corresponding path program 1 times [2020-10-19 20:09:14,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406676770] [2020-10-19 20:09:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406676770] [2020-10-19 20:09:14,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:14,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325544656] [2020-10-19 20:09:14,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 7 times [2020-10-19 20:09:14,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724238396] [2020-10-19 20:09:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724238396] [2020-10-19 20:09:14,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375511925] [2020-10-19 20:09:14,781 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:09:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:09:14,781 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. cyclomatic complexity: 61 Second operand 4 states. [2020-10-19 20:09:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,816 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2020-10-19 20:09:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:09:14,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 160 transitions. [2020-10-19 20:09:14,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 160 transitions. [2020-10-19 20:09:14,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 160 transitions. [2020-10-19 20:09:14,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,820 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-19 20:09:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 160 transitions. [2020-10-19 20:09:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-19 20:09:14,824 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-19 20:09:14,824 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-19 20:09:14,824 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:09:14,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 160 transitions. [2020-10-19 20:09:14,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,827 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,827 INFO L853 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, 1] [2020-10-19 20:09:14,827 INFO L794 eck$LassoCheckResult]: Stem: 1794#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1710#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1711#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1787#L204 assume 1 == ~b0_req_up~0; 1790#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1801#L129-2 ~b0_req_up~0 := 0; 1789#L204-1 assume 1 == ~b1_req_up~0; 1747#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1748#L144-2 ~b1_req_up~0 := 0; 1767#L211 assume 1 == ~d0_req_up~0; 1810#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1800#L159-2 ~d0_req_up~0 := 0; 1771#L218 assume 1 == ~d1_req_up~0; 1772#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1780#L174-2 ~d1_req_up~0 := 0; 1781#L225 assume !(1 == ~z_req_up~0); 1754#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1755#L247-1 assume !(0 == ~b0_ev~0); 1807#L313-1 assume !(0 == ~b1_ev~0); 1717#L318-1 assume !(0 == ~d0_ev~0); 1718#L323-1 assume !(0 == ~d1_ev~0); 1750#L328-1 assume !(0 == ~z_ev~0); 1782#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1792#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1733#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1745#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1746#L382 assume !(0 != activate_threads_~tmp~1); 1802#L382-2 assume !(1 == ~b0_ev~0); 1803#L346-1 assume !(1 == ~b1_ev~0); 1715#L351-1 assume !(1 == ~d0_ev~0); 1716#L356-1 assume !(1 == ~d1_ev~0); 1749#L361-1 assume !(1 == ~z_ev~0); 1774#L424-1 [2020-10-19 20:09:14,827 INFO L796 eck$LassoCheckResult]: Loop: 1774#L424-1 assume !false; 1737#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1738#L287 assume !false; 1778#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1742#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1743#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1763#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1726#L282 assume !(0 != eval_~tmp___0~0); 1728#L303 start_simulation_~kernel_st~0 := 2; 1786#L204-2 assume !(1 == ~b0_req_up~0); 1777#L204-3 assume !(1 == ~b1_req_up~0); 1760#L211-1 assume !(1 == ~d0_req_up~0); 1785#L218-1 assume !(1 == ~d1_req_up~0); 1758#L225-1 assume !(1 == ~z_req_up~0); 1751#L232-1 start_simulation_~kernel_st~0 := 3; 1752#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1808#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1724#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1725#L323-3 assume !(0 == ~d1_ev~0); 1756#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1784#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1793#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1730#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1769#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1770#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1797#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1798#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1722#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1723#L356-3 assume !(1 == ~d1_ev~0); 1753#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1783#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1739#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1740#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1761#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1762#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1735#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1736#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1773#L441 assume !(0 != start_simulation_~tmp~3); 1774#L424-1 [2020-10-19 20:09:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1038255737, now seen corresponding path program 1 times [2020-10-19 20:09:14,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272260637] [2020-10-19 20:09:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272260637] [2020-10-19 20:09:14,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:14,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215501343] [2020-10-19 20:09:14,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 8 times [2020-10-19 20:09:14,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281499180] [2020-10-19 20:09:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281499180] [2020-10-19 20:09:14,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843978258] [2020-10-19 20:09:14,893 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:09:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:09:14,894 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. cyclomatic complexity: 60 Second operand 4 states. [2020-10-19 20:09:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:14,922 INFO L93 Difference]: Finished difference Result 101 states and 159 transitions. [2020-10-19 20:09:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:09:14,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 159 transitions. [2020-10-19 20:09:14,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 159 transitions. [2020-10-19 20:09:14,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-19 20:09:14,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-19 20:09:14,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 159 transitions. [2020-10-19 20:09:14,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:14,926 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2020-10-19 20:09:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 159 transitions. [2020-10-19 20:09:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-19 20:09:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-19 20:09:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2020-10-19 20:09:14,930 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2020-10-19 20:09:14,931 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2020-10-19 20:09:14,931 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:09:14,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 159 transitions. [2020-10-19 20:09:14,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-19 20:09:14,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:14,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:14,933 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:14,933 INFO L853 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, 1] [2020-10-19 20:09:14,933 INFO L794 eck$LassoCheckResult]: Stem: 2008#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1924#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1925#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2001#L204 assume 1 == ~b0_req_up~0; 2004#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2015#L129-2 ~b0_req_up~0 := 0; 2003#L204-1 assume 1 == ~b1_req_up~0; 1961#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1962#L144-2 ~b1_req_up~0 := 0; 1981#L211 assume 1 == ~d0_req_up~0; 2024#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2014#L159-2 ~d0_req_up~0 := 0; 1985#L218 assume 1 == ~d1_req_up~0; 1986#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1994#L174-2 ~d1_req_up~0 := 0; 1995#L225 assume !(1 == ~z_req_up~0); 1968#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 1969#L247-1 assume !(0 == ~b0_ev~0); 2021#L313-1 assume !(0 == ~b1_ev~0); 1931#L318-1 assume !(0 == ~d0_ev~0); 1932#L323-1 assume !(0 == ~d1_ev~0); 1964#L328-1 assume !(0 == ~z_ev~0); 1996#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2006#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1947#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1959#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1960#L382 assume !(0 != activate_threads_~tmp~1); 2016#L382-2 assume !(1 == ~b0_ev~0); 2017#L346-1 assume !(1 == ~b1_ev~0); 1929#L351-1 assume !(1 == ~d0_ev~0); 1930#L356-1 assume !(1 == ~d1_ev~0); 1963#L361-1 assume !(1 == ~z_ev~0); 1988#L424-1 [2020-10-19 20:09:14,934 INFO L796 eck$LassoCheckResult]: Loop: 1988#L424-1 assume !false; 1951#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1952#L287 assume !false; 1992#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1956#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1957#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1977#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1940#L282 assume !(0 != eval_~tmp___0~0); 1942#L303 start_simulation_~kernel_st~0 := 2; 2000#L204-2 assume !(1 == ~b0_req_up~0); 1991#L204-3 assume !(1 == ~b1_req_up~0); 1974#L211-1 assume !(1 == ~d0_req_up~0); 1999#L218-1 assume !(1 == ~d1_req_up~0); 1972#L225-1 assume !(1 == ~z_req_up~0); 1965#L232-1 start_simulation_~kernel_st~0 := 3; 1966#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2022#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1938#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1939#L323-3 assume !(0 == ~d1_ev~0); 1970#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1998#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2007#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1944#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1983#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1984#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2011#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2012#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1936#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1937#L356-3 assume !(1 == ~d1_ev~0); 1967#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1997#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1953#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1954#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1975#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1976#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1949#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1950#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1987#L441 assume !(0 != start_simulation_~tmp~3); 1988#L424-1 [2020-10-19 20:09:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,934 INFO L82 PathProgramCache]: Analyzing trace with hash 17187383, now seen corresponding path program 1 times [2020-10-19 20:09:14,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7217787] [2020-10-19 20:09:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7217787] [2020-10-19 20:09:14,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:14,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264967353] [2020-10-19 20:09:14,960 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:14,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 9 times [2020-10-19 20:09:14,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:14,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526130507] [2020-10-19 20:09:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:14,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526130507] [2020-10-19 20:09:14,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:14,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:14,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681553640] [2020-10-19 20:09:14,989 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:14,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:14,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:14,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:14,990 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. cyclomatic complexity: 59 Second operand 3 states. [2020-10-19 20:09:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,016 INFO L93 Difference]: Finished difference Result 116 states and 181 transitions. [2020-10-19 20:09:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2020-10-19 20:09:15,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-10-19 20:09:15,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 181 transitions. [2020-10-19 20:09:15,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-10-19 20:09:15,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-10-19 20:09:15,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2020-10-19 20:09:15,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,020 INFO L691 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2020-10-19 20:09:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2020-10-19 20:09:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-10-19 20:09:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-19 20:09:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2020-10-19 20:09:15,024 INFO L714 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2020-10-19 20:09:15,024 INFO L594 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2020-10-19 20:09:15,024 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:09:15,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 181 transitions. [2020-10-19 20:09:15,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-10-19 20:09:15,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,026 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,026 INFO L853 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, 1] [2020-10-19 20:09:15,027 INFO L794 eck$LassoCheckResult]: Stem: 2236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2153#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2154#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2227#L204 assume 1 == ~b0_req_up~0; 2231#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2243#L129-2 ~b0_req_up~0 := 0; 2230#L204-1 assume 1 == ~b1_req_up~0; 2188#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2189#L144-2 ~b1_req_up~0 := 0; 2208#L211 assume 1 == ~d0_req_up~0; 2252#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2242#L159-2 ~d0_req_up~0 := 0; 2213#L218 assume 1 == ~d1_req_up~0; 2214#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2220#L174-2 ~d1_req_up~0 := 0; 2221#L225 assume !(1 == ~z_req_up~0); 2194#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2195#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2249#L313-1 assume !(0 == ~b1_ev~0); 2157#L318-1 assume !(0 == ~d0_ev~0); 2158#L323-1 assume !(0 == ~d1_ev~0); 2190#L328-1 assume !(0 == ~z_ev~0); 2222#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2233#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2173#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2185#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2186#L382 assume !(0 != activate_threads_~tmp~1); 2244#L382-2 assume !(1 == ~b0_ev~0); 2245#L346-1 assume !(1 == ~b1_ev~0); 2155#L351-1 assume !(1 == ~d0_ev~0); 2156#L356-1 assume !(1 == ~d1_ev~0); 2187#L361-1 assume !(1 == ~z_ev~0); 2212#L424-1 [2020-10-19 20:09:15,027 INFO L796 eck$LassoCheckResult]: Loop: 2212#L424-1 assume !false; 2177#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2178#L287 assume !false; 2218#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2182#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2183#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2203#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2166#L282 assume !(0 != eval_~tmp___0~0); 2168#L303 start_simulation_~kernel_st~0 := 2; 2226#L204-2 assume !(1 == ~b0_req_up~0); 2229#L204-3 assume !(1 == ~b1_req_up~0); 2262#L211-1 assume !(1 == ~d0_req_up~0); 2259#L218-1 assume !(1 == ~d1_req_up~0); 2256#L225-1 assume !(1 == ~z_req_up~0); 2254#L232-1 start_simulation_~kernel_st~0 := 3; 2253#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2250#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2164#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2165#L323-3 assume !(0 == ~d1_ev~0); 2196#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2224#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2235#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2170#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2209#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2210#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2239#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2240#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2162#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2163#L356-3 assume !(1 == ~d1_ev~0); 2193#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2223#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 2179#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2180#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2201#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2202#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2175#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2176#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2211#L441 assume !(0 != start_simulation_~tmp~3); 2212#L424-1 [2020-10-19 20:09:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1297051061, now seen corresponding path program 1 times [2020-10-19 20:09:15,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253478769] [2020-10-19 20:09:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253478769] [2020-10-19 20:09:15,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434948818] [2020-10-19 20:09:15,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 10 times [2020-10-19 20:09:15,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635864809] [2020-10-19 20:09:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635864809] [2020-10-19 20:09:15,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630581142] [2020-10-19 20:09:15,080 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,080 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. cyclomatic complexity: 66 Second operand 3 states. [2020-10-19 20:09:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,107 INFO L93 Difference]: Finished difference Result 141 states and 218 transitions. [2020-10-19 20:09:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 218 transitions. [2020-10-19 20:09:15,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2020-10-19 20:09:15,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 141 states and 218 transitions. [2020-10-19 20:09:15,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-19 20:09:15,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-19 20:09:15,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 218 transitions. [2020-10-19 20:09:15,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,111 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2020-10-19 20:09:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 218 transitions. [2020-10-19 20:09:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-19 20:09:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-19 20:09:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 218 transitions. [2020-10-19 20:09:15,115 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2020-10-19 20:09:15,115 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2020-10-19 20:09:15,115 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:09:15,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 218 transitions. [2020-10-19 20:09:15,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2020-10-19 20:09:15,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,118 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,118 INFO L853 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, 1] [2020-10-19 20:09:15,118 INFO L794 eck$LassoCheckResult]: Stem: 2504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2419#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2420#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2495#L204 assume 1 == ~b0_req_up~0; 2499#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2511#L129-2 ~b0_req_up~0 := 0; 2498#L204-1 assume 1 == ~b1_req_up~0; 2454#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2455#L144-2 ~b1_req_up~0 := 0; 2475#L211 assume 1 == ~d0_req_up~0; 2520#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2510#L159-2 ~d0_req_up~0 := 0; 2480#L218 assume 1 == ~d1_req_up~0; 2481#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2488#L174-2 ~d1_req_up~0 := 0; 2489#L225 assume !(1 == ~z_req_up~0); 2460#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2461#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2517#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2425#L318-1 assume !(0 == ~d0_ev~0); 2426#L323-1 assume !(0 == ~d1_ev~0); 2456#L328-1 assume !(0 == ~z_ev~0); 2490#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2501#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2439#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2451#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2452#L382 assume !(0 != activate_threads_~tmp~1); 2512#L382-2 assume !(1 == ~b0_ev~0); 2513#L346-1 assume !(1 == ~b1_ev~0); 2421#L351-1 assume !(1 == ~d0_ev~0); 2422#L356-1 assume !(1 == ~d1_ev~0); 2453#L361-1 assume !(1 == ~z_ev~0); 2479#L424-1 [2020-10-19 20:09:15,118 INFO L796 eck$LassoCheckResult]: Loop: 2479#L424-1 assume !false; 2443#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2444#L287 assume !false; 2486#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2448#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2449#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2469#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2432#L282 assume !(0 != eval_~tmp___0~0); 2434#L303 start_simulation_~kernel_st~0 := 2; 2494#L204-2 assume !(1 == ~b0_req_up~0); 2497#L204-3 assume !(1 == ~b1_req_up~0); 2540#L211-1 assume !(1 == ~d0_req_up~0); 2534#L218-1 assume !(1 == ~d1_req_up~0); 2528#L225-1 assume !(1 == ~z_req_up~0); 2525#L232-1 start_simulation_~kernel_st~0 := 3; 2523#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2521#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2430#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2431#L323-3 assume !(0 == ~d1_ev~0); 2462#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2492#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2503#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2436#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2476#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2477#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2507#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2508#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2428#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2429#L356-3 assume !(1 == ~d1_ev~0); 2459#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2491#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 2445#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2446#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2467#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2468#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2441#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2442#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2478#L441 assume !(0 != start_simulation_~tmp~3); 2479#L424-1 [2020-10-19 20:09:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1986798985, now seen corresponding path program 1 times [2020-10-19 20:09:15,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748221198] [2020-10-19 20:09:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748221198] [2020-10-19 20:09:15,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854044619] [2020-10-19 20:09:15,141 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 11 times [2020-10-19 20:09:15,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715254329] [2020-10-19 20:09:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715254329] [2020-10-19 20:09:15,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969970103] [2020-10-19 20:09:15,167 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,167 INFO L87 Difference]: Start difference. First operand 141 states and 218 transitions. cyclomatic complexity: 78 Second operand 3 states. [2020-10-19 20:09:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,195 INFO L93 Difference]: Finished difference Result 180 states and 275 transitions. [2020-10-19 20:09:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 275 transitions. [2020-10-19 20:09:15,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2020-10-19 20:09:15,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 275 transitions. [2020-10-19 20:09:15,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2020-10-19 20:09:15,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2020-10-19 20:09:15,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 275 transitions. [2020-10-19 20:09:15,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,200 INFO L691 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2020-10-19 20:09:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 275 transitions. [2020-10-19 20:09:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2020-10-19 20:09:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-19 20:09:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2020-10-19 20:09:15,204 INFO L714 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2020-10-19 20:09:15,204 INFO L594 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2020-10-19 20:09:15,204 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:09:15,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 275 transitions. [2020-10-19 20:09:15,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2020-10-19 20:09:15,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,207 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,207 INFO L853 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, 1] [2020-10-19 20:09:15,207 INFO L794 eck$LassoCheckResult]: Stem: 2835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2746#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2747#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2826#L204 assume 1 == ~b0_req_up~0; 2830#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2844#L129-2 ~b0_req_up~0 := 0; 2829#L204-1 assume 1 == ~b1_req_up~0; 2783#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2784#L144-2 ~b1_req_up~0 := 0; 2804#L211 assume 1 == ~d0_req_up~0; 2855#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2843#L159-2 ~d0_req_up~0 := 0; 2808#L218 assume 1 == ~d1_req_up~0; 2809#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2818#L174-2 ~d1_req_up~0 := 0; 2819#L225 assume !(1 == ~z_req_up~0); 2790#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2791#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2850#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2753#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2754#L323-1 assume !(0 == ~d1_ev~0); 2786#L328-1 assume !(0 == ~z_ev~0); 2820#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2832#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2769#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2781#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2782#L382 assume !(0 != activate_threads_~tmp~1); 2845#L382-2 assume !(1 == ~b0_ev~0); 2846#L346-1 assume !(1 == ~b1_ev~0); 2751#L351-1 assume !(1 == ~d0_ev~0); 2752#L356-1 assume !(1 == ~d1_ev~0); 2785#L361-1 assume !(1 == ~z_ev~0); 2811#L424-1 [2020-10-19 20:09:15,207 INFO L796 eck$LassoCheckResult]: Loop: 2811#L424-1 assume !false; 2773#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2774#L287 assume !false; 2815#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2778#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2779#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2799#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2762#L282 assume !(0 != eval_~tmp___0~0); 2764#L303 start_simulation_~kernel_st~0 := 2; 2825#L204-2 assume !(1 == ~b0_req_up~0); 2828#L204-3 assume !(1 == ~b1_req_up~0); 2898#L211-1 assume !(1 == ~d0_req_up~0); 2875#L218-1 assume !(1 == ~d1_req_up~0); 2873#L225-1 assume !(1 == ~z_req_up~0); 2868#L232-1 start_simulation_~kernel_st~0 := 3; 2865#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2862#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2861#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2761#L323-3 assume !(0 == ~d1_ev~0); 2792#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2822#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2834#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2766#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2806#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2807#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2838#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2839#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2758#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2759#L356-3 assume !(1 == ~d1_ev~0); 2789#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2821#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 2775#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2776#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2797#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2798#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2771#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2772#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2810#L441 assume !(0 != start_simulation_~tmp~3); 2811#L424-1 [2020-10-19 20:09:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1399992971, now seen corresponding path program 1 times [2020-10-19 20:09:15,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788945982] [2020-10-19 20:09:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788945982] [2020-10-19 20:09:15,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395731268] [2020-10-19 20:09:15,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 12 times [2020-10-19 20:09:15,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271302676] [2020-10-19 20:09:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271302676] [2020-10-19 20:09:15,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079431132] [2020-10-19 20:09:15,258 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,258 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. cyclomatic complexity: 96 Second operand 3 states. [2020-10-19 20:09:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,293 INFO L93 Difference]: Finished difference Result 235 states and 352 transitions. [2020-10-19 20:09:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 352 transitions. [2020-10-19 20:09:15,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2020-10-19 20:09:15,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 352 transitions. [2020-10-19 20:09:15,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2020-10-19 20:09:15,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2020-10-19 20:09:15,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 352 transitions. [2020-10-19 20:09:15,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,303 INFO L691 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2020-10-19 20:09:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 352 transitions. [2020-10-19 20:09:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2020-10-19 20:09:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-10-19 20:09:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 352 transitions. [2020-10-19 20:09:15,311 INFO L714 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2020-10-19 20:09:15,311 INFO L594 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2020-10-19 20:09:15,311 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:09:15,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 352 transitions. [2020-10-19 20:09:15,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2020-10-19 20:09:15,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,316 INFO L853 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, 1] [2020-10-19 20:09:15,317 INFO L794 eck$LassoCheckResult]: Stem: 3262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3170#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 3171#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 3253#L204 assume 1 == ~b0_req_up~0; 3257#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3270#L129-2 ~b0_req_up~0 := 0; 3256#L204-1 assume 1 == ~b1_req_up~0; 3207#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3208#L144-2 ~b1_req_up~0 := 0; 3229#L211 assume 1 == ~d0_req_up~0; 3280#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3269#L159-2 ~d0_req_up~0 := 0; 3234#L218 assume 1 == ~d1_req_up~0; 3235#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 3244#L174-2 ~d1_req_up~0 := 0; 3245#L225 assume !(1 == ~z_req_up~0); 3214#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3215#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3276#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3177#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3178#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3210#L328-1 assume !(0 == ~z_ev~0); 3246#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3259#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3193#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3205#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3206#L382 assume !(0 != activate_threads_~tmp~1); 3271#L382-2 assume !(1 == ~b0_ev~0); 3272#L346-1 assume !(1 == ~b1_ev~0); 3175#L351-1 assume !(1 == ~d0_ev~0); 3176#L356-1 assume !(1 == ~d1_ev~0); 3209#L361-1 assume !(1 == ~z_ev~0); 3233#L424-1 [2020-10-19 20:09:15,317 INFO L796 eck$LassoCheckResult]: Loop: 3233#L424-1 assume !false; 3197#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 3198#L287 assume !false; 3240#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3202#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3203#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3223#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 3186#L282 assume !(0 != eval_~tmp___0~0); 3188#L303 start_simulation_~kernel_st~0 := 2; 3252#L204-2 assume !(1 == ~b0_req_up~0); 3255#L204-3 assume !(1 == ~b1_req_up~0); 3310#L211-1 assume !(1 == ~d0_req_up~0); 3304#L218-1 assume !(1 == ~d1_req_up~0); 3298#L225-1 assume !(1 == ~z_req_up~0); 3295#L232-1 start_simulation_~kernel_st~0 := 3; 3292#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3288#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3286#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3284#L323-3 assume !(0 == ~d1_ev~0); 3216#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3248#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3261#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3190#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3230#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3231#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 3264#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3265#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3182#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3183#L356-3 assume !(1 == ~d1_ev~0); 3213#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3247#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 3199#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3200#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3219#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 3220#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3195#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 3196#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 3232#L441 assume !(0 != start_simulation_~tmp~3); 3233#L424-1 [2020-10-19 20:09:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1658158409, now seen corresponding path program 1 times [2020-10-19 20:09:15,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373183880] [2020-10-19 20:09:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373183880] [2020-10-19 20:09:15,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 20:09:15,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78844093] [2020-10-19 20:09:15,369 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 13 times [2020-10-19 20:09:15,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762494196] [2020-10-19 20:09:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762494196] [2020-10-19 20:09:15,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471411520] [2020-10-19 20:09:15,400 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:09:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:09:15,401 INFO L87 Difference]: Start difference. First operand 235 states and 352 transitions. cyclomatic complexity: 118 Second operand 6 states. [2020-10-19 20:09:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,510 INFO L93 Difference]: Finished difference Result 633 states and 958 transitions. [2020-10-19 20:09:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:09:15,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 633 states and 958 transitions. [2020-10-19 20:09:15,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 583 [2020-10-19 20:09:15,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 633 states to 633 states and 958 transitions. [2020-10-19 20:09:15,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 633 [2020-10-19 20:09:15,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 633 [2020-10-19 20:09:15,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 633 states and 958 transitions. [2020-10-19 20:09:15,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,571 INFO L691 BuchiCegarLoop]: Abstraction has 633 states and 958 transitions. [2020-10-19 20:09:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states and 958 transitions. [2020-10-19 20:09:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 241. [2020-10-19 20:09:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-19 20:09:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2020-10-19 20:09:15,582 INFO L714 BuchiCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-10-19 20:09:15,582 INFO L594 BuchiCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-10-19 20:09:15,583 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 20:09:15,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 358 transitions. [2020-10-19 20:09:15,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 201 [2020-10-19 20:09:15,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,585 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,585 INFO L853 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, 1] [2020-10-19 20:09:15,586 INFO L794 eck$LassoCheckResult]: Stem: 4148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 4054#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 4055#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4139#L204 assume 1 == ~b0_req_up~0; 4143#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4158#L129-2 ~b0_req_up~0 := 0; 4142#L204-1 assume 1 == ~b1_req_up~0; 4092#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4093#L144-2 ~b1_req_up~0 := 0; 4113#L211 assume 1 == ~d0_req_up~0; 4171#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4157#L159-2 ~d0_req_up~0 := 0; 4118#L218 assume 1 == ~d1_req_up~0; 4119#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4130#L174-2 ~d1_req_up~0 := 0; 4131#L225 assume !(1 == ~z_req_up~0); 4099#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4100#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4166#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4061#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4062#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4095#L328-1 assume !(0 == ~z_ev~0); 4132#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4145#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4077#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4151#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4159#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4160#L382-2 assume !(1 == ~b0_ev~0); 4161#L346-1 assume !(1 == ~b1_ev~0); 4059#L351-1 assume !(1 == ~d0_ev~0); 4060#L356-1 assume !(1 == ~d1_ev~0); 4094#L361-1 assume !(1 == ~z_ev~0); 4121#L424-1 [2020-10-19 20:09:15,586 INFO L796 eck$LassoCheckResult]: Loop: 4121#L424-1 assume !false; 4081#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4082#L287 assume !false; 4126#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4086#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4087#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4108#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 4070#L282 assume !(0 != eval_~tmp___0~0); 4072#L303 start_simulation_~kernel_st~0 := 2; 4138#L204-2 assume !(1 == ~b0_req_up~0); 4141#L204-3 assume !(1 == ~b1_req_up~0); 4202#L211-1 assume !(1 == ~d0_req_up~0); 4196#L218-1 assume !(1 == ~d1_req_up~0); 4190#L225-1 assume !(1 == ~z_req_up~0); 4187#L232-1 start_simulation_~kernel_st~0 := 3; 4184#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4180#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4178#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4176#L323-3 assume !(0 == ~d1_ev~0); 4101#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4134#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4147#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4074#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4150#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4162#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4153#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4154#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4066#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4067#L356-3 assume !(1 == ~d1_ev~0); 4098#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4133#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 4083#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4084#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4106#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 4107#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4079#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 4080#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 4120#L441 assume !(0 != start_simulation_~tmp~3); 4121#L424-1 [2020-10-19 20:09:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1715416711, now seen corresponding path program 1 times [2020-10-19 20:09:15,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682682054] [2020-10-19 20:09:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682682054] [2020-10-19 20:09:15,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183844995] [2020-10-19 20:09:15,622 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 14 times [2020-10-19 20:09:15,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118519527] [2020-10-19 20:09:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118519527] [2020-10-19 20:09:15,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590105749] [2020-10-19 20:09:15,661 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,661 INFO L87 Difference]: Start difference. First operand 241 states and 358 transitions. cyclomatic complexity: 118 Second operand 3 states. [2020-10-19 20:09:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,687 INFO L93 Difference]: Finished difference Result 256 states and 375 transitions. [2020-10-19 20:09:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 375 transitions. [2020-10-19 20:09:15,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2020-10-19 20:09:15,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 256 states and 375 transitions. [2020-10-19 20:09:15,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2020-10-19 20:09:15,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2020-10-19 20:09:15,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 375 transitions. [2020-10-19 20:09:15,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,692 INFO L691 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2020-10-19 20:09:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 375 transitions. [2020-10-19 20:09:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-10-19 20:09:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-19 20:09:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2020-10-19 20:09:15,697 INFO L714 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2020-10-19 20:09:15,697 INFO L594 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2020-10-19 20:09:15,697 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-19 20:09:15,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 375 transitions. [2020-10-19 20:09:15,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2020-10-19 20:09:15,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,700 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,700 INFO L853 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, 1] [2020-10-19 20:09:15,700 INFO L794 eck$LassoCheckResult]: Stem: 4649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 4560#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 4561#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4640#L204 assume 1 == ~b0_req_up~0; 4644#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4661#L129-2 ~b0_req_up~0 := 0; 4643#L204-1 assume 1 == ~b1_req_up~0; 4593#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4594#L144-2 ~b1_req_up~0 := 0; 4615#L211 assume 1 == ~d0_req_up~0; 4672#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4660#L159-2 ~d0_req_up~0 := 0; 4620#L218 assume 1 == ~d1_req_up~0; 4621#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4632#L174-2 ~d1_req_up~0 := 0; 4633#L225 assume !(1 == ~z_req_up~0); 4600#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4601#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4667#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4567#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4568#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4596#L328-1 assume !(0 == ~z_ev~0); 4634#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4646#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4653#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4591#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4592#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4662#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4663#L346-1 assume !(1 == ~b1_ev~0); 4565#L351-1 assume !(1 == ~d0_ev~0); 4566#L356-1 assume !(1 == ~d1_ev~0); 4595#L361-1 assume !(1 == ~z_ev~0); 4623#L424-1 [2020-10-19 20:09:15,700 INFO L796 eck$LassoCheckResult]: Loop: 4623#L424-1 assume !false; 4584#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4585#L287 assume !false; 4628#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4589#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4590#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4609#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 4576#L282 assume !(0 != eval_~tmp___0~0); 4578#L303 start_simulation_~kernel_st~0 := 2; 4639#L204-2 assume !(1 == ~b0_req_up~0); 4642#L204-3 assume !(1 == ~b1_req_up~0); 4723#L211-1 assume !(1 == ~d0_req_up~0); 4719#L218-1 assume !(1 == ~d1_req_up~0); 4714#L225-1 assume !(1 == ~z_req_up~0); 4708#L232-1 start_simulation_~kernel_st~0 := 3; 4706#L313-2 assume !(0 == ~b0_ev~0); 4705#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4703#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4701#L323-3 assume !(0 == ~d1_ev~0); 4602#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4636#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4648#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4652#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4618#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4619#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4655#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4656#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4572#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4573#L356-3 assume !(1 == ~d1_ev~0); 4599#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4635#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 4586#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4587#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4607#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 4608#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4582#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 4583#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 4622#L441 assume !(0 != start_simulation_~tmp~3); 4623#L424-1 [2020-10-19 20:09:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1717263753, now seen corresponding path program 1 times [2020-10-19 20:09:15,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669606559] [2020-10-19 20:09:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669606559] [2020-10-19 20:09:15,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300667213] [2020-10-19 20:09:15,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash 763502474, now seen corresponding path program 1 times [2020-10-19 20:09:15,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847438814] [2020-10-19 20:09:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847438814] [2020-10-19 20:09:15,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817643867] [2020-10-19 20:09:15,757 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,758 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. cyclomatic complexity: 120 Second operand 3 states. [2020-10-19 20:09:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,789 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2020-10-19 20:09:15,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 412 transitions. [2020-10-19 20:09:15,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2020-10-19 20:09:15,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 284 states and 412 transitions. [2020-10-19 20:09:15,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2020-10-19 20:09:15,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2020-10-19 20:09:15,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 412 transitions. [2020-10-19 20:09:15,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,796 INFO L691 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2020-10-19 20:09:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 412 transitions. [2020-10-19 20:09:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2020-10-19 20:09:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-10-19 20:09:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2020-10-19 20:09:15,801 INFO L714 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2020-10-19 20:09:15,801 INFO L594 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2020-10-19 20:09:15,801 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-19 20:09:15,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 412 transitions. [2020-10-19 20:09:15,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2020-10-19 20:09:15,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,804 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,804 INFO L853 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, 1] [2020-10-19 20:09:15,804 INFO L794 eck$LassoCheckResult]: Stem: 5195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 5109#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 5110#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5186#L204 assume 1 == ~b0_req_up~0; 5190#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5206#L129-2 ~b0_req_up~0 := 0; 5189#L204-1 assume 1 == ~b1_req_up~0; 5141#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5142#L144-2 ~b1_req_up~0 := 0; 5162#L211 assume 1 == ~d0_req_up~0; 5217#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5205#L159-2 ~d0_req_up~0 := 0; 5168#L218 assume 1 == ~d1_req_up~0; 5169#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5179#L174-2 ~d1_req_up~0 := 0; 5180#L225 assume !(1 == ~z_req_up~0); 5148#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5149#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5214#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5116#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5117#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5144#L328-1 assume !(0 == ~z_ev~0); 5181#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5192#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5199#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5139#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5140#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5208#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5209#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5114#L351-1 assume !(1 == ~d0_ev~0); 5115#L356-1 assume !(1 == ~d1_ev~0); 5143#L361-1 assume !(1 == ~z_ev~0); 5171#L424-1 [2020-10-19 20:09:15,804 INFO L796 eck$LassoCheckResult]: Loop: 5171#L424-1 assume !false; 5132#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 5133#L287 assume !false; 5176#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5137#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5138#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5157#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 5125#L282 assume !(0 != eval_~tmp___0~0); 5127#L303 start_simulation_~kernel_st~0 := 2; 5185#L204-2 assume !(1 == ~b0_req_up~0); 5188#L204-3 assume !(1 == ~b1_req_up~0); 5293#L211-1 assume !(1 == ~d0_req_up~0); 5265#L218-1 assume !(1 == ~d1_req_up~0); 5260#L225-1 assume !(1 == ~z_req_up~0); 5257#L232-1 start_simulation_~kernel_st~0 := 3; 5241#L313-2 assume !(0 == ~b0_ev~0); 5235#L313-4 assume !(0 == ~b1_ev~0); 5232#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5228#L323-3 assume !(0 == ~d1_ev~0); 5226#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5223#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5222#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5198#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5329#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5327#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5324#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5323#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5121#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5122#L356-3 assume !(1 == ~d1_ev~0); 5147#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5182#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 5134#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5135#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5155#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 5156#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5130#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 5131#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 5170#L441 assume !(0 != start_simulation_~tmp~3); 5171#L424-1 [2020-10-19 20:09:15,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1717323335, now seen corresponding path program 1 times [2020-10-19 20:09:15,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967151220] [2020-10-19 20:09:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967151220] [2020-10-19 20:09:15,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080717923] [2020-10-19 20:09:15,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,830 INFO L82 PathProgramCache]: Analyzing trace with hash 982357192, now seen corresponding path program 1 times [2020-10-19 20:09:15,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356267542] [2020-10-19 20:09:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356267542] [2020-10-19 20:09:15,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140643958] [2020-10-19 20:09:15,852 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,852 INFO L87 Difference]: Start difference. First operand 284 states and 412 transitions. cyclomatic complexity: 129 Second operand 3 states. [2020-10-19 20:09:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,874 INFO L93 Difference]: Finished difference Result 326 states and 467 transitions. [2020-10-19 20:09:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 467 transitions. [2020-10-19 20:09:15,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 292 [2020-10-19 20:09:15,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 326 states and 467 transitions. [2020-10-19 20:09:15,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2020-10-19 20:09:15,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2020-10-19 20:09:15,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 467 transitions. [2020-10-19 20:09:15,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,881 INFO L691 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2020-10-19 20:09:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 467 transitions. [2020-10-19 20:09:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-10-19 20:09:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-10-19 20:09:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 467 transitions. [2020-10-19 20:09:15,887 INFO L714 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2020-10-19 20:09:15,887 INFO L594 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2020-10-19 20:09:15,888 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-19 20:09:15,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 467 transitions. [2020-10-19 20:09:15,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 292 [2020-10-19 20:09:15,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,891 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,891 INFO L853 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, 1] [2020-10-19 20:09:15,891 INFO L794 eck$LassoCheckResult]: Stem: 5816#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 5728#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 5729#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5807#L204 assume 1 == ~b0_req_up~0; 5811#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5827#L129-2 ~b0_req_up~0 := 0; 5810#L204-1 assume 1 == ~b1_req_up~0; 5760#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5761#L144-2 ~b1_req_up~0 := 0; 5785#L211 assume 1 == ~d0_req_up~0; 5839#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5826#L159-2 ~d0_req_up~0 := 0; 5790#L218 assume 1 == ~d1_req_up~0; 5791#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5799#L174-2 ~d1_req_up~0 := 0; 5800#L225 assume !(1 == ~z_req_up~0); 5767#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5768#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5835#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5735#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5736#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5763#L328-1 assume !(0 == ~z_ev~0); 5801#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5813#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5820#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5758#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5759#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5830#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5831#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5733#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5734#L356-1 assume !(1 == ~d1_ev~0); 5762#L361-1 assume !(1 == ~z_ev~0); 5789#L424-1 [2020-10-19 20:09:15,891 INFO L796 eck$LassoCheckResult]: Loop: 5789#L424-1 assume !false; 5751#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 5752#L287 assume !false; 5796#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5756#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5757#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5777#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 5744#L282 assume !(0 != eval_~tmp___0~0); 5746#L303 start_simulation_~kernel_st~0 := 2; 5806#L204-2 assume !(1 == ~b0_req_up~0); 5809#L204-3 assume !(1 == ~b1_req_up~0); 5894#L211-1 assume !(1 == ~d0_req_up~0); 5892#L218-1 assume !(1 == ~d1_req_up~0); 5890#L225-1 assume !(1 == ~z_req_up~0); 5886#L232-1 start_simulation_~kernel_st~0 := 3; 5883#L313-2 assume !(0 == ~b0_ev~0); 5878#L313-4 assume !(0 == ~b1_ev~0); 5875#L318-3 assume !(0 == ~d0_ev~0); 5866#L323-3 assume !(0 == ~d1_ev~0); 5865#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5864#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5861#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5862#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5918#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5916#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5845#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5844#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5842#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5741#L356-3 assume !(1 == ~d1_ev~0); 5766#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5802#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 5753#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5754#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5773#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 5774#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5749#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 5750#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 5788#L441 assume !(0 != start_simulation_~tmp~3); 5789#L424-1 [2020-10-19 20:09:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325257, now seen corresponding path program 1 times [2020-10-19 20:09:15,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747552757] [2020-10-19 20:09:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747552757] [2020-10-19 20:09:15,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:15,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099121327] [2020-10-19 20:09:15,911 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1405059018, now seen corresponding path program 1 times [2020-10-19 20:09:15,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056953470] [2020-10-19 20:09:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:15,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056953470] [2020-10-19 20:09:15,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:15,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:15,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864979646] [2020-10-19 20:09:15,932 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:15,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:15,933 INFO L87 Difference]: Start difference. First operand 326 states and 467 transitions. cyclomatic complexity: 142 Second operand 3 states. [2020-10-19 20:09:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:15,957 INFO L93 Difference]: Finished difference Result 393 states and 555 transitions. [2020-10-19 20:09:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:15,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 555 transitions. [2020-10-19 20:09:15,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2020-10-19 20:09:15,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 393 states and 555 transitions. [2020-10-19 20:09:15,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2020-10-19 20:09:15,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 393 [2020-10-19 20:09:15,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 393 states and 555 transitions. [2020-10-19 20:09:15,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:15,965 INFO L691 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2020-10-19 20:09:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states and 555 transitions. [2020-10-19 20:09:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2020-10-19 20:09:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-19 20:09:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 555 transitions. [2020-10-19 20:09:15,972 INFO L714 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2020-10-19 20:09:15,972 INFO L594 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2020-10-19 20:09:15,972 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-19 20:09:15,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 555 transitions. [2020-10-19 20:09:15,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2020-10-19 20:09:15,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:15,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:15,976 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:15,976 INFO L853 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, 1] [2020-10-19 20:09:15,976 INFO L794 eck$LassoCheckResult]: Stem: 6544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 6456#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 6457#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6534#L204 assume 1 == ~b0_req_up~0; 6538#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 6556#L129-2 ~b0_req_up~0 := 0; 6537#L204-1 assume 1 == ~b1_req_up~0; 6488#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 6489#L144-2 ~b1_req_up~0 := 0; 6511#L211 assume 1 == ~d0_req_up~0; 6569#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 6555#L159-2 ~d0_req_up~0 := 0; 6516#L218 assume 1 == ~d1_req_up~0; 6517#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 6526#L174-2 ~d1_req_up~0 := 0; 6527#L225 assume !(1 == ~z_req_up~0); 6495#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 6496#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 6564#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 6463#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 6464#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 6491#L328-1 assume !(0 == ~z_ev~0); 6528#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 6540#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6548#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6486#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6487#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6559#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6560#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6461#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6462#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 6490#L361-1 assume !(1 == ~z_ev~0); 6515#L424-1 [2020-10-19 20:09:15,976 INFO L796 eck$LassoCheckResult]: Loop: 6515#L424-1 assume !false; 6479#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 6480#L287 assume !false; 6522#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 6484#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6485#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6504#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 6472#L282 assume !(0 != eval_~tmp___0~0); 6474#L303 start_simulation_~kernel_st~0 := 2; 6533#L204-2 assume !(1 == ~b0_req_up~0); 6536#L204-3 assume !(1 == ~b1_req_up~0); 6626#L211-1 assume !(1 == ~d0_req_up~0); 6623#L218-1 assume !(1 == ~d1_req_up~0); 6619#L225-1 assume !(1 == ~z_req_up~0); 6616#L232-1 start_simulation_~kernel_st~0 := 3; 6613#L313-2 assume !(0 == ~b0_ev~0); 6610#L313-4 assume !(0 == ~b1_ev~0); 6608#L318-3 assume !(0 == ~d0_ev~0); 6606#L323-3 assume !(0 == ~d1_ev~0); 6604#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 6602#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 6598#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6599#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6646#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6644#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6580#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6577#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6575#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6573#L356-3 assume !(1 == ~d1_ev~0); 6494#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 6529#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 6481#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6482#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6500#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 6501#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6477#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 6478#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 6514#L441 assume !(0 != start_simulation_~tmp~3); 6515#L424-1 [2020-10-19 20:09:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 1 times [2020-10-19 20:09:15,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:15,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749714090] [2020-10-19 20:09:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:15,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:15,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:16,024 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1405059018, now seen corresponding path program 2 times [2020-10-19 20:09:16,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:16,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860941916] [2020-10-19 20:09:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:16,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860941916] [2020-10-19 20:09:16,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:16,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:16,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773400177] [2020-10-19 20:09:16,051 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:16,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:09:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:09:16,052 INFO L87 Difference]: Start difference. First operand 393 states and 555 transitions. cyclomatic complexity: 163 Second operand 5 states. [2020-10-19 20:09:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:16,123 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2020-10-19 20:09:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:09:16,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 602 transitions. [2020-10-19 20:09:16,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 392 [2020-10-19 20:09:16,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 426 states and 602 transitions. [2020-10-19 20:09:16,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 426 [2020-10-19 20:09:16,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2020-10-19 20:09:16,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 602 transitions. [2020-10-19 20:09:16,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:16,133 INFO L691 BuchiCegarLoop]: Abstraction has 426 states and 602 transitions. [2020-10-19 20:09:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 602 transitions. [2020-10-19 20:09:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2020-10-19 20:09:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-19 20:09:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 558 transitions. [2020-10-19 20:09:16,140 INFO L714 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2020-10-19 20:09:16,140 INFO L594 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2020-10-19 20:09:16,140 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-19 20:09:16,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 558 transitions. [2020-10-19 20:09:16,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 362 [2020-10-19 20:09:16,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:16,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:16,145 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:16,145 INFO L853 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, 1] [2020-10-19 20:09:16,145 INFO L794 eck$LassoCheckResult]: Stem: 7380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 7291#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 7292#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 7371#L204 assume 1 == ~b0_req_up~0; 7375#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 7391#L129-2 ~b0_req_up~0 := 0; 7374#L204-1 assume 1 == ~b1_req_up~0; 7323#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 7324#L144-2 ~b1_req_up~0 := 0; 7346#L211 assume 1 == ~d0_req_up~0; 7403#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 7390#L159-2 ~d0_req_up~0 := 0; 7351#L218 assume 1 == ~d1_req_up~0; 7352#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 7361#L174-2 ~d1_req_up~0 := 0; 7362#L225 assume !(1 == ~z_req_up~0); 7330#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 7331#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7399#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 7298#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7299#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7326#L328-1 assume !(0 == ~z_ev~0); 7363#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 7377#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7384#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7321#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 7322#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7394#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7395#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7296#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7297#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7325#L361-1 assume !(1 == ~z_ev~0); 7350#L424-1 [2020-10-19 20:09:16,146 INFO L796 eck$LassoCheckResult]: Loop: 7350#L424-1 assume !false; 7313#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 7314#L287 assume !false; 7357#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 7318#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 7320#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7381#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 7537#L282 assume !(0 != eval_~tmp___0~0); 7369#L303 start_simulation_~kernel_st~0 := 2; 7370#L204-2 assume !(1 == ~b0_req_up~0); 7373#L204-3 assume !(1 == ~b1_req_up~0); 7488#L211-1 assume !(1 == ~d0_req_up~0); 7481#L218-1 assume !(1 == ~d1_req_up~0); 7475#L225-1 assume !(1 == ~z_req_up~0); 7472#L232-1 start_simulation_~kernel_st~0 := 3; 7467#L313-2 assume !(0 == ~b0_ev~0); 7461#L313-4 assume !(0 == ~b1_ev~0); 7458#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7456#L323-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7457#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 7643#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 7644#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7595#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7593#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 7591#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7588#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7585#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7303#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7304#L356-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7329#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 7364#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 7315#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 7316#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7335#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 7336#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7311#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 7312#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 7349#L441 assume !(0 != start_simulation_~tmp~3); 7350#L424-1 [2020-10-19 20:09:16,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 2 times [2020-10-19 20:09:16,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:16,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843035142] [2020-10-19 20:09:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:16,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:16,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:16,175 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:16,176 INFO L82 PathProgramCache]: Analyzing trace with hash -50950646, now seen corresponding path program 1 times [2020-10-19 20:09:16,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:16,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748398521] [2020-10-19 20:09:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:16,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:16,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:16,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1472395774, now seen corresponding path program 1 times [2020-10-19 20:09:16,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:16,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639353271] [2020-10-19 20:09:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:16,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639353271] [2020-10-19 20:09:16,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:16,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:16,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024976334] [2020-10-19 20:09:16,438 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2020-10-19 20:09:16,562 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:09:16,563 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:09:16,563 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:09:16,563 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:09:16,563 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:09:16,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:16,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:09:16,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:09:16,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration20_Loop [2020-10-19 20:09:16,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:09:16,565 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:09:16,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:16,951 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:09:16,952 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:16,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:16,959 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:16,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:16,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:17,017 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:09:17,065 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,071 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 20:09:17,109 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:09:17,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:09:17,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:09:17,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:09:17,109 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:09:17,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:09:17,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:09:17,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration20_Loop [2020-10-19 20:09:17,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:09:17,110 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:09:17,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:17,452 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:09:17,458 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:17,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:17,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:17,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:17,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:17,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:17,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:17,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:17,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:17,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:17,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:17,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:17,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:17,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:17,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:17,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:17,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:17,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:17,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:17,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:17,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:17,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:17,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:17,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:17,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:17,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:17,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:17,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:17,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:17,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:17,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:17,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:17,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:17,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:17,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:17,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:17,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:09:17,645 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 20:09:17,646 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:17,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:09:17,663 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:09:17,663 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:09:17,664 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b0_ev~0) = -2*~b0_ev~0 + 3 Supporting invariants [] Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:17,700 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:09:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:17,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:09:17,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:09:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:17,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:09:17,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:09:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:17,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 20:09:17,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163 Second operand 5 states. [2020-10-19 20:09:18,075 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163. Second operand 5 states. Result 1350 states and 1928 transitions. Complement of second has 7 states. [2020-10-19 20:09:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:09:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:09:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2020-10-19 20:09:18,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 256 transitions. Stem has 32 letters. Loop has 38 letters. [2020-10-19 20:09:18,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:09:18,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 256 transitions. Stem has 70 letters. Loop has 38 letters. [2020-10-19 20:09:18,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:09:18,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 256 transitions. Stem has 32 letters. Loop has 76 letters. [2020-10-19 20:09:18,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:09:18,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1350 states and 1928 transitions. [2020-10-19 20:09:18,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 937 [2020-10-19 20:09:18,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1350 states to 1278 states and 1828 transitions. [2020-10-19 20:09:18,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 972 [2020-10-19 20:09:18,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 977 [2020-10-19 20:09:18,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1278 states and 1828 transitions. [2020-10-19 20:09:18,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:18,114 INFO L691 BuchiCegarLoop]: Abstraction has 1278 states and 1828 transitions. [2020-10-19 20:09:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states and 1828 transitions. [2020-10-19 20:09:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 911. [2020-10-19 20:09:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2020-10-19 20:09:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1301 transitions. [2020-10-19 20:09:18,136 INFO L714 BuchiCegarLoop]: Abstraction has 911 states and 1301 transitions. [2020-10-19 20:09:18,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:18,137 INFO L87 Difference]: Start difference. First operand 911 states and 1301 transitions. Second operand 3 states. [2020-10-19 20:09:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:18,256 INFO L93 Difference]: Finished difference Result 969 states and 1379 transitions. [2020-10-19 20:09:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:18,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 969 states and 1379 transitions. [2020-10-19 20:09:18,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2020-10-19 20:09:18,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 969 states to 969 states and 1379 transitions. [2020-10-19 20:09:18,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 648 [2020-10-19 20:09:18,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2020-10-19 20:09:18,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 969 states and 1379 transitions. [2020-10-19 20:09:18,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:18,283 INFO L691 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2020-10-19 20:09:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states and 1379 transitions. [2020-10-19 20:09:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2020-10-19 20:09:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-10-19 20:09:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1379 transitions. [2020-10-19 20:09:18,304 INFO L714 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2020-10-19 20:09:18,305 INFO L594 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2020-10-19 20:09:18,305 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-19 20:09:18,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 969 states and 1379 transitions. [2020-10-19 20:09:18,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2020-10-19 20:09:18,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:18,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:18,312 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,312 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,312 INFO L794 eck$LassoCheckResult]: Stem: 11317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 11160#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 11161#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 11299#L204 assume 1 == ~b0_req_up~0; 11306#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 11338#L129-2 ~b0_req_up~0 := 0; 11304#L204-1 assume 1 == ~b1_req_up~0; 11210#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 11211#L144-2 ~b1_req_up~0 := 0; 11252#L211 assume 1 == ~d0_req_up~0; 11362#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 11337#L159-2 ~d0_req_up~0 := 0; 11261#L218 assume 1 == ~d1_req_up~0; 11262#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 11283#L174-2 ~d1_req_up~0 := 0; 11284#L225 assume !(1 == ~z_req_up~0); 11221#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 11222#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 11352#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 11168#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 11169#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 11213#L328-1 assume !(0 == ~z_ev~0); 11285#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 11309#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11324#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11208#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 11209#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11343#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11344#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11162#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11163#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 11212#L361-1 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11281#L424-1 [2020-10-19 20:09:18,321 INFO L796 eck$LassoCheckResult]: Loop: 11281#L424-1 assume !false; 11764#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 11368#L287 assume !false; 11763#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11762#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11416#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11761#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 11759#L282 assume 0 != eval_~tmp___0~0; 11201#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 11202#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 11319#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 11241#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 11275#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 11171#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 11336#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 11263#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 11264#L287 assume !false; 11418#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11415#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 11413#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11411#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 11384#L282 assume !(0 != eval_~tmp___0~0); 11295#L303 start_simulation_~kernel_st~0 := 2; 11296#L204-2 assume !(1 == ~b0_req_up~0); 11693#L204-3 assume !(1 == ~b1_req_up~0); 11688#L211-1 assume !(1 == ~d0_req_up~0); 11684#L218-1 assume !(1 == ~d1_req_up~0); 11679#L225-1 assume !(1 == ~z_req_up~0); 11675#L232-1 start_simulation_~kernel_st~0 := 3; 11671#L313-2 assume !(0 == ~b0_ev~0); 11668#L313-4 assume !(0 == ~b1_ev~0); 11665#L318-3 assume !(0 == ~d0_ev~0); 11662#L323-3 assume !(0 == ~d1_ev~0); 11659#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 11656#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 11655#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11633#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11632#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 11631#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11618#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11615#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11614#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11773#L356-3 assume !(1 == ~d1_ev~0); 11772#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11771#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 11770#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11586#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11769#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 11768#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11767#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 11766#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 11765#L441 assume !(0 != start_simulation_~tmp~3); 11281#L424-1 [2020-10-19 20:09:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325321, now seen corresponding path program 1 times [2020-10-19 20:09:18,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320321748] [2020-10-19 20:09:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:18,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320321748] [2020-10-19 20:09:18,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:18,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:09:18,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308956065] [2020-10-19 20:09:18,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash -696899428, now seen corresponding path program 1 times [2020-10-19 20:09:18,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948471918] [2020-10-19 20:09:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:18,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948471918] [2020-10-19 20:09:18,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:18,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:18,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986464948] [2020-10-19 20:09:18,398 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:18,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:18,398 INFO L87 Difference]: Start difference. First operand 969 states and 1379 transitions. cyclomatic complexity: 413 Second operand 3 states. [2020-10-19 20:09:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:18,437 INFO L93 Difference]: Finished difference Result 1921 states and 2691 transitions. [2020-10-19 20:09:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:18,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1921 states and 2691 transitions. [2020-10-19 20:09:18,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2020-10-19 20:09:18,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1921 states to 1921 states and 2691 transitions. [2020-10-19 20:09:18,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2020-10-19 20:09:18,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2020-10-19 20:09:18,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1921 states and 2691 transitions. [2020-10-19 20:09:18,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:18,469 INFO L691 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2020-10-19 20:09:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states and 2691 transitions. [2020-10-19 20:09:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2020-10-19 20:09:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2020-10-19 20:09:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2691 transitions. [2020-10-19 20:09:18,510 INFO L714 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2020-10-19 20:09:18,510 INFO L594 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2020-10-19 20:09:18,511 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-19 20:09:18,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1921 states and 2691 transitions. [2020-10-19 20:09:18,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2020-10-19 20:09:18,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:18,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:18,523 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,523 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,523 INFO L794 eck$LassoCheckResult]: Stem: 14225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 14057#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 14058#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 14200#L204 assume 1 == ~b0_req_up~0; 14210#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 14252#L129-2 ~b0_req_up~0 := 0; 14206#L204-1 assume 1 == ~b1_req_up~0; 14106#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 14107#L144-2 ~b1_req_up~0 := 0; 14151#L211 assume 1 == ~d0_req_up~0; 14280#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 14251#L159-2 ~d0_req_up~0 := 0; 14160#L218 assume 1 == ~d1_req_up~0; 14161#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 14182#L174-2 ~d1_req_up~0 := 0; 14183#L225 assume !(1 == ~z_req_up~0); 14118#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 14119#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 14297#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 14295#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 14294#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 14184#L328-1 assume !(0 == ~z_ev~0); 14185#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 14213#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 14236#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 14104#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 14105#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 14257#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 14258#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 14541#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14108#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 14109#L361-1 assume !(1 == ~z_ev~0); 14181#L424-1 assume !false; 14307#L425 [2020-10-19 20:09:18,524 INFO L796 eck$LassoCheckResult]: Loop: 14307#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 14855#L287 assume !false; 15081#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 15079#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 14853#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15076#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 15075#L282 assume 0 != eval_~tmp___0~0; 15073#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 14857#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 15071#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 15064#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 15062#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 15061#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 15057#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 14162#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 14091#L287 assume !false; 14854#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 14852#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 14226#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 14227#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 14313#L282 assume !(0 != eval_~tmp___0~0); 15012#L303 start_simulation_~kernel_st~0 := 2; 14999#L204-2 assume !(1 == ~b0_req_up~0); 14986#L204-3 assume !(1 == ~b1_req_up~0); 14982#L211-1 assume !(1 == ~d0_req_up~0); 14979#L218-1 assume !(1 == ~d1_req_up~0); 14973#L225-1 assume !(1 == ~z_req_up~0); 14974#L232-1 start_simulation_~kernel_st~0 := 3; 15194#L313-2 assume !(0 == ~b0_ev~0); 15192#L313-4 assume !(0 == ~b1_ev~0); 15189#L318-3 assume !(0 == ~d0_ev~0); 15187#L323-3 assume !(0 == ~d1_ev~0); 15186#L328-3 assume !(0 == ~z_ev~0); 15184#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 15183#L99-1 assume !(1 == ~b0_ev~0); 15180#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 15181#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 15202#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 15201#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 15200#L382-5 assume !(1 == ~b0_ev~0); 15197#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 15196#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14874#L356-3 assume !(1 == ~d1_ev~0); 14870#L361-3 assume !(1 == ~z_ev~0); 14866#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 14094#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 14095#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 14223#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 14861#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 14862#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 14249#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 14156#L441 assume !(0 != start_simulation_~tmp~3); 14157#L424-1 assume !false; 14307#L425 [2020-10-19 20:09:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 1 times [2020-10-19 20:09:18,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298514587] [2020-10-19 20:09:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:18,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:18,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:18,558 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 100562712, now seen corresponding path program 1 times [2020-10-19 20:09:18,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089425139] [2020-10-19 20:09:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:18,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089425139] [2020-10-19 20:09:18,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:18,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:18,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412617010] [2020-10-19 20:09:18,578 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:18,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:18,579 INFO L87 Difference]: Start difference. First operand 1921 states and 2691 transitions. cyclomatic complexity: 773 Second operand 3 states. [2020-10-19 20:09:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:18,620 INFO L93 Difference]: Finished difference Result 3753 states and 5233 transitions. [2020-10-19 20:09:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:18,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3753 states and 5233 transitions. [2020-10-19 20:09:18,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2428 [2020-10-19 20:09:18,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3753 states to 3753 states and 5233 transitions. [2020-10-19 20:09:18,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2481 [2020-10-19 20:09:18,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2481 [2020-10-19 20:09:18,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3753 states and 5233 transitions. [2020-10-19 20:09:18,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:18,689 INFO L691 BuchiCegarLoop]: Abstraction has 3753 states and 5233 transitions. [2020-10-19 20:09:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states and 5233 transitions. [2020-10-19 20:09:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 1939. [2020-10-19 20:09:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2020-10-19 20:09:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2709 transitions. [2020-10-19 20:09:18,741 INFO L714 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2020-10-19 20:09:18,741 INFO L594 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2020-10-19 20:09:18,742 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-19 20:09:18,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2709 transitions. [2020-10-19 20:09:18,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2020-10-19 20:09:18,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:18,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:18,758 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,758 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,758 INFO L794 eck$LassoCheckResult]: Stem: 19910#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 19735#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 19736#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 19888#L204 assume 1 == ~b0_req_up~0; 19894#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 19939#L129-2 ~b0_req_up~0 := 0; 19893#L204-1 assume 1 == ~b1_req_up~0; 19787#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 19788#L144-2 ~b1_req_up~0 := 0; 19831#L211 assume 1 == ~d0_req_up~0; 19969#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 19938#L159-2 ~d0_req_up~0 := 0; 19840#L218 assume 1 == ~d1_req_up~0; 19841#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 19869#L174-2 ~d1_req_up~0 := 0; 19870#L225 assume !(1 == ~z_req_up~0); 19958#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 19972#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 19973#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 19980#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 19979#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 19871#L328-1 assume !(0 == ~z_ev~0); 19872#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 19920#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 19921#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 19785#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 19786#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 19945#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 19946#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 19737#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 19738#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 19867#L361-1 assume !(1 == ~z_ev~0); 19868#L424-1 assume !false; 20417#L425 [2020-10-19 20:09:18,759 INFO L796 eck$LassoCheckResult]: Loop: 20417#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 20730#L287 assume !false; 20805#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 20803#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 20712#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20737#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 20735#L282 assume 0 != eval_~tmp___0~0; 20732#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 20717#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 20729#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 20727#L44-1 assume 0 != ~d0_val~0; 20725#L54 assume 0 != ~b1_val~0;method1_~s2~0 := 0; 20723#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 20722#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 20720#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 20715#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 20714#L287 assume !false; 20713#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 20711#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 20710#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20709#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 20707#L282 assume !(0 != eval_~tmp___0~0); 20706#L303 start_simulation_~kernel_st~0 := 2; 20686#L204-2 assume !(1 == ~b0_req_up~0); 20680#L204-3 assume !(1 == ~b1_req_up~0); 20681#L211-1 assume !(1 == ~d0_req_up~0); 21030#L218-1 assume !(1 == ~d1_req_up~0); 21031#L225-1 assume !(1 == ~z_req_up~0); 21169#L232-1 start_simulation_~kernel_st~0 := 3; 21167#L313-2 assume !(0 == ~b0_ev~0); 21165#L313-4 assume !(0 == ~b1_ev~0); 21162#L318-3 assume !(0 == ~d0_ev~0); 21160#L323-3 assume !(0 == ~d1_ev~0); 21158#L328-3 assume !(0 == ~z_ev~0); 21156#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 21154#L99-1 assume !(1 == ~b0_ev~0); 21151#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 21152#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 21354#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 21351#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 21349#L382-5 assume !(1 == ~b0_ev~0); 21347#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 20949#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 20944#L356-3 assume !(1 == ~d1_ev~0); 20943#L361-3 assume !(1 == ~z_ev~0); 20872#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 20941#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 20860#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20940#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 20937#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 20880#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 20541#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 20542#L441 assume !(0 != start_simulation_~tmp~3); 20811#L424-1 assume !false; 20417#L425 [2020-10-19 20:09:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 2 times [2020-10-19 20:09:18,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478076625] [2020-10-19 20:09:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:18,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:18,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:18,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -614486231, now seen corresponding path program 1 times [2020-10-19 20:09:18,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466363869] [2020-10-19 20:09:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:18,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466363869] [2020-10-19 20:09:18,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:18,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:18,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007763624] [2020-10-19 20:09:18,804 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:18,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:18,805 INFO L87 Difference]: Start difference. First operand 1939 states and 2709 transitions. cyclomatic complexity: 773 Second operand 3 states. [2020-10-19 20:09:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:18,850 INFO L93 Difference]: Finished difference Result 3747 states and 5203 transitions. [2020-10-19 20:09:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:18,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3747 states and 5203 transitions. [2020-10-19 20:09:18,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2424 [2020-10-19 20:09:18,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3747 states to 3747 states and 5203 transitions. [2020-10-19 20:09:18,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2477 [2020-10-19 20:09:18,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2477 [2020-10-19 20:09:18,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3747 states and 5203 transitions. [2020-10-19 20:09:18,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:18,900 INFO L691 BuchiCegarLoop]: Abstraction has 3747 states and 5203 transitions. [2020-10-19 20:09:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states and 5203 transitions. [2020-10-19 20:09:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 1939. [2020-10-19 20:09:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2020-10-19 20:09:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2691 transitions. [2020-10-19 20:09:18,945 INFO L714 BuchiCegarLoop]: Abstraction has 1939 states and 2691 transitions. [2020-10-19 20:09:18,945 INFO L594 BuchiCegarLoop]: Abstraction has 1939 states and 2691 transitions. [2020-10-19 20:09:18,945 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-19 20:09:18,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2691 transitions. [2020-10-19 20:09:18,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2020-10-19 20:09:18,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:18,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:18,954 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,954 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:18,955 INFO L794 eck$LassoCheckResult]: Stem: 25609#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 25427#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 25428#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 25585#L204 assume 1 == ~b0_req_up~0; 25592#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 25643#L129-2 ~b0_req_up~0 := 0; 25590#L204-1 assume 1 == ~b1_req_up~0; 25479#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 25480#L144-2 ~b1_req_up~0 := 0; 25524#L211 assume 1 == ~d0_req_up~0; 25674#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 25642#L159-2 ~d0_req_up~0 := 0; 25533#L218 assume 1 == ~d1_req_up~0; 25534#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 25567#L174-2 ~d1_req_up~0 := 0; 25568#L225 assume !(1 == ~z_req_up~0); 25661#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 25679#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 25680#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 25689#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 25688#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 25569#L328-1 assume !(0 == ~z_ev~0); 25570#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 25595#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 25622#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 25623#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 25648#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 25649#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 25658#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 25659#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 25481#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 25482#L361-1 assume !(1 == ~z_ev~0); 25798#L424-1 assume !false; 25799#L425 [2020-10-19 20:09:18,955 INFO L796 eck$LassoCheckResult]: Loop: 25799#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 26496#L287 assume !false; 26501#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 26500#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 26468#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26499#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 26498#L282 assume 0 != eval_~tmp___0~0; 26497#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 26479#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 26495#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 26492#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 26490#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 26488#L65-2 assume 0 != method1_~s2~0; 26486#L72 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 26484#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 26477#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 26474#L287 assume !false; 26471#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 26467#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 26464#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26462#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 26460#L282 assume !(0 != eval_~tmp___0~0); 26458#L303 start_simulation_~kernel_st~0 := 2; 26453#L204-2 assume !(1 == ~b0_req_up~0); 26454#L204-3 assume !(1 == ~b1_req_up~0); 26451#L211-1 assume !(1 == ~d0_req_up~0); 26445#L218-1 assume !(1 == ~d1_req_up~0); 26440#L225-1 assume !(1 == ~z_req_up~0); 26435#L232-1 start_simulation_~kernel_st~0 := 3; 26433#L313-2 assume !(0 == ~b0_ev~0); 26426#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 26292#L318-3 assume !(0 == ~d0_ev~0); 26287#L323-3 assume !(0 == ~d1_ev~0); 26283#L328-3 assume !(0 == ~z_ev~0); 26280#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 26277#L99-1 assume !(1 == ~b0_ev~0); 26273#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 26271#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 26269#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 26267#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 26264#L382-5 assume !(1 == ~b0_ev~0); 26265#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 26259#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 26248#L356-3 assume !(1 == ~d1_ev~0); 26244#L361-3 assume !(1 == ~z_ev~0); 26243#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 26535#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 26531#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26527#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 26523#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 26519#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 26514#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 26510#L441 assume !(0 != start_simulation_~tmp~3); 26506#L424-1 assume !false; 25799#L425 [2020-10-19 20:09:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:18,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 3 times [2020-10-19 20:09:18,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:18,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19567589] [2020-10-19 20:09:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:18,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:18,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:19,003 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1673186692, now seen corresponding path program 1 times [2020-10-19 20:09:19,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:19,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017973169] [2020-10-19 20:09:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:19,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017973169] [2020-10-19 20:09:19,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:19,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:19,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135218928] [2020-10-19 20:09:19,038 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:19,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:19,039 INFO L87 Difference]: Start difference. First operand 1939 states and 2691 transitions. cyclomatic complexity: 755 Second operand 3 states. [2020-10-19 20:09:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:19,078 INFO L93 Difference]: Finished difference Result 2427 states and 3367 transitions. [2020-10-19 20:09:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:19,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2427 states and 3367 transitions. [2020-10-19 20:09:19,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1588 [2020-10-19 20:09:19,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2427 states to 2427 states and 3367 transitions. [2020-10-19 20:09:19,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2020-10-19 20:09:19,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2020-10-19 20:09:19,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2427 states and 3367 transitions. [2020-10-19 20:09:19,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:19,129 INFO L691 BuchiCegarLoop]: Abstraction has 2427 states and 3367 transitions. [2020-10-19 20:09:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states and 3367 transitions. [2020-10-19 20:09:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2295. [2020-10-19 20:09:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2020-10-19 20:09:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3187 transitions. [2020-10-19 20:09:19,187 INFO L714 BuchiCegarLoop]: Abstraction has 2295 states and 3187 transitions. [2020-10-19 20:09:19,187 INFO L594 BuchiCegarLoop]: Abstraction has 2295 states and 3187 transitions. [2020-10-19 20:09:19,187 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-19 20:09:19,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2295 states and 3187 transitions. [2020-10-19 20:09:19,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1500 [2020-10-19 20:09:19,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:19,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:19,201 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:19,202 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:19,202 INFO L794 eck$LassoCheckResult]: Stem: 29975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 29799#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 29800#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 29955#L204 assume 1 == ~b0_req_up~0; 29960#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 30008#L129-2 ~b0_req_up~0 := 0; 29959#L204-1 assume 1 == ~b1_req_up~0; 29851#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 29852#L144-2 ~b1_req_up~0 := 0; 29896#L211 assume 1 == ~d0_req_up~0; 30041#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 30007#L159-2 ~d0_req_up~0 := 0; 29905#L218 assume 1 == ~d1_req_up~0; 29906#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 29934#L174-2 ~d1_req_up~0 := 0; 29935#L225 assume !(1 == ~z_req_up~0); 29864#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 29865#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 30028#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 30029#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 30051#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 29936#L328-1 assume !(0 == ~z_ev~0); 29937#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 29983#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 29984#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 29849#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 29850#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 30015#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 30016#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 29801#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 29802#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 29932#L361-1 assume !(1 == ~z_ev~0); 29933#L424-1 assume !false; 30664#L425 [2020-10-19 20:09:19,203 INFO L796 eck$LassoCheckResult]: Loop: 30664#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 32062#L287 assume !false; 32087#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 29845#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 29846#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 29976#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 32064#L282 assume 0 != eval_~tmp___0~0; 32063#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 30973#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 32061#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 32059#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 32058#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 30697#L65-2 assume 0 != method1_~s2~0; 29911#L72 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 29912#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 29917#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 30974#L287 assume !false; 30971#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 30969#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 30967#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 30965#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 30962#L282 assume !(0 != eval_~tmp___0~0); 30959#L303 start_simulation_~kernel_st~0 := 2; 30942#L204-2 assume !(1 == ~b0_req_up~0); 30937#L204-3 assume !(1 == ~b1_req_up~0); 30938#L211-1 assume !(1 == ~d0_req_up~0); 30910#L218-1 assume !(1 == ~d1_req_up~0); 30908#L225-1 assume 1 == ~z_req_up~0; 30881#L189-3 assume !(~z_val~0 != ~z_val_t~0); 30879#L189-5 ~z_req_up~0 := 0; 30872#L232-1 start_simulation_~kernel_st~0 := 3; 30867#L313-2 assume !(0 == ~b0_ev~0); 30862#L313-4 assume !(0 == ~b1_ev~0); 30854#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 30850#L323-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 30773#L328-3 assume !(0 == ~z_ev~0); 30765#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 30766#L99-1 assume !(1 == ~b0_ev~0); 31421#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 30735#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 30733#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 30731#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 30729#L382-5 assume !(1 == ~b0_ev~0); 30723#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 30712#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 30713#L356-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 29938#L361-3 assume !(1 == ~z_ev~0); 29939#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 29966#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 30983#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 29873#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 29874#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 29830#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 29831#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 32089#L441 assume !(0 != start_simulation_~tmp~3); 32088#L424-1 assume !false; 30664#L425 [2020-10-19 20:09:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 4 times [2020-10-19 20:09:19,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:19,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135628282] [2020-10-19 20:09:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:19,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:19,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:19,259 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -677586128, now seen corresponding path program 1 times [2020-10-19 20:09:19,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:19,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859885086] [2020-10-19 20:09:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:19,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:19,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:19,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 425213967, now seen corresponding path program 1 times [2020-10-19 20:09:19,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:19,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303116354] [2020-10-19 20:09:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:09:19,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303116354] [2020-10-19 20:09:19,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:19,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:19,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905833539] [2020-10-19 20:09:19,881 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-19 20:09:19,994 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:09:19,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:09:19,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:09:19,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:09:19,994 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:09:19,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:19,995 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:09:19,995 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:09:19,995 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration25_Loop [2020-10-19 20:09:19,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:09:19,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:09:19,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,494 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:09:20,494 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:09:20,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,503 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret11=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,545 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,550 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~b0_ev~0=3} Honda state: {~b0_ev~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,590 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,593 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,593 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret9=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,640 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,643 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,644 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,694 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,701 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,701 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z_ev~0=3} Honda state: {~z_ev~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,745 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,749 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,749 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~3=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,794 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,798 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:09:20,798 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z_req_up~0=0} Honda state: {~z_req_up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:09:20,842 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:20,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:09:20,889 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,894 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 20:09:20,926 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:09:20,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:09:20,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:09:20,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:09:20,927 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:09:20,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:20,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:09:20,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:09:20,927 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration25_Loop [2020-10-19 20:09:20,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:09:20,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:09:20,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:20,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:09:21,430 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:09:21,430 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:21,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:21,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:21,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:21,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:21,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:21,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:21,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,517 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 20:09:21,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,518 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 20:09:21,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:09:21,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,553 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 20:09:21,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,555 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 20:09:21,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:21,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:21,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:21,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:21,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:21,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:21,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:21,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:21,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:21,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:09:21,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:09:21,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:09:21,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:09:21,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:09:21,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:09:21,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:09:21,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:09:21,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:09:21,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 20:09:21,667 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:09:21,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:09:21,671 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:09:21,671 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:09:21,671 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b1_ev~0) = -2*~b1_ev~0 + 3 Supporting invariants [] [2020-10-19 20:09:21,701 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:09:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:21,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:09:21,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:09:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:21,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:09:21,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:09:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-19 20:09:21,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 20:09:21,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2295 states and 3187 transitions. cyclomatic complexity: 895 Second operand 5 states. [2020-10-19 20:09:21,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2295 states and 3187 transitions. cyclomatic complexity: 895. Second operand 5 states. Result 5962 states and 8267 transitions. Complement of second has 7 states. [2020-10-19 20:09:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:09:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:09:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2020-10-19 20:09:21,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 33 letters. Loop has 56 letters. [2020-10-19 20:09:21,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:09:21,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 89 letters. Loop has 56 letters. [2020-10-19 20:09:21,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:09:21,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 33 letters. Loop has 112 letters. [2020-10-19 20:09:21,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:09:21,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5962 states and 8267 transitions. [2020-10-19 20:09:21,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2428 [2020-10-19 20:09:21,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5962 states to 5570 states and 7767 transitions. [2020-10-19 20:09:21,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2505 [2020-10-19 20:09:21,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2520 [2020-10-19 20:09:21,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 7767 transitions. [2020-10-19 20:09:21,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:21,944 INFO L691 BuchiCegarLoop]: Abstraction has 5570 states and 7767 transitions. [2020-10-19 20:09:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 7767 transitions. [2020-10-19 20:09:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5539. [2020-10-19 20:09:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2020-10-19 20:09:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 7720 transitions. [2020-10-19 20:09:22,031 INFO L714 BuchiCegarLoop]: Abstraction has 5539 states and 7720 transitions. [2020-10-19 20:09:22,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:09:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:09:22,032 INFO L87 Difference]: Start difference. First operand 5539 states and 7720 transitions. Second operand 4 states. [2020-10-19 20:09:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:22,090 INFO L93 Difference]: Finished difference Result 8355 states and 11527 transitions. [2020-10-19 20:09:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:09:22,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8355 states and 11527 transitions. [2020-10-19 20:09:22,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4288 [2020-10-19 20:09:22,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8355 states to 8355 states and 11527 transitions. [2020-10-19 20:09:22,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4365 [2020-10-19 20:09:22,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4365 [2020-10-19 20:09:22,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8355 states and 11527 transitions. [2020-10-19 20:09:22,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:09:22,176 INFO L691 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2020-10-19 20:09:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states and 11527 transitions. [2020-10-19 20:09:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 8355. [2020-10-19 20:09:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8355 states. [2020-10-19 20:09:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 11527 transitions. [2020-10-19 20:09:22,337 INFO L714 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2020-10-19 20:09:22,337 INFO L594 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2020-10-19 20:09:22,337 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-10-19 20:09:22,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8355 states and 11527 transitions. [2020-10-19 20:09:22,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4288 [2020-10-19 20:09:22,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:22,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:22,376 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:22,377 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:22,377 INFO L794 eck$LassoCheckResult]: Stem: 52421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 52241#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 52242#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 52398#L204 assume 1 == ~b0_req_up~0; 52407#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 52448#L129-2 ~b0_req_up~0 := 0; 52405#L204-1 assume 1 == ~b1_req_up~0; 52298#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 52299#L144-2 ~b1_req_up~0 := 0; 52343#L211 assume 1 == ~d0_req_up~0; 52479#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 52447#L159-2 ~d0_req_up~0 := 0; 52352#L218 assume 1 == ~d1_req_up~0; 52353#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 52382#L174-2 ~d1_req_up~0 := 0; 52383#L225 assume !(1 == ~z_req_up~0); 52309#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 52310#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 52464#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 52465#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 52492#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 52384#L328-1 assume !(0 == ~z_ev~0); 52385#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 53451#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 53450#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 53449#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 53448#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 53447#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 52461#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 52247#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 52248#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 52300#L361-1 assume !(1 == ~z_ev~0); 52381#L424-1 assume !false; 53963#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 54439#L287 [2020-10-19 20:09:22,377 INFO L796 eck$LassoCheckResult]: Loop: 54439#L287 assume !false; 59753#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 59752#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 56802#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 59748#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 59745#L282 assume 0 != eval_~tmp___0~0; 57185#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 57182#L291 assume !(0 != eval_~tmp~0); 54439#L287 [2020-10-19 20:09:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1082183973, now seen corresponding path program 1 times [2020-10-19 20:09:22,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:22,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005763570] [2020-10-19 20:09:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:22,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:22,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:22,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1768213899, now seen corresponding path program 1 times [2020-10-19 20:09:22,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:22,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796239904] [2020-10-19 20:09:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:22,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:22,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:22,410 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash -937655707, now seen corresponding path program 1 times [2020-10-19 20:09:22,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:22,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806456546] [2020-10-19 20:09:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:22,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:22,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:22,435 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:23,711 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 213 DAG size of output: 189 [2020-10-19 20:09:23,921 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-19 20:09:23,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:09:23 BoogieIcfgContainer [2020-10-19 20:09:23,956 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:09:23,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:09:23,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:09:23,957 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:09:23,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:09:13" (3/4) ... [2020-10-19 20:09:23,960 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 20:09:24,018 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 20:09:24,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:09:24,019 INFO L168 Benchmark]: Toolchain (without parser) took 11887.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -363.8 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:24,020 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:09:24,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:24,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:09:24,021 INFO L168 Benchmark]: Boogie Preprocessor took 33.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:24,021 INFO L168 Benchmark]: RCFGBuilder took 633.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:24,022 INFO L168 Benchmark]: BuchiAutomizer took 10679.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -240.8 MB). Peak memory consumption was 461.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:24,022 INFO L168 Benchmark]: Witness Printer took 61.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:09:24,024 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 633.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10679.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -240.8 MB). Peak memory consumption was 461.1 MB. Max. memory is 11.5 GB. * Witness Printer took 61.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 27 terminating modules (25 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * b0_ev + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * b1_ev + 3 and consists of 4 locations. 25 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 8355 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 26 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 19. Minimization of nondet autom 8. Automata minimization 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 4574 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 8355 states and ocurred in iteration 25. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/6 HoareTripleCheckerStatistics: 4476 SDtfs, 1821 SDslu, 5083 SDs, 0 SdLazy, 378 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT2 SILN0 SILU0 SILI19 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital105 mio100 ax100 hnf100 lsp10 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf155 smp76 tf109 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 277]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65c81b2c=0, b1_val_t=1, NULL=4, NULL=0, \result=0, d0_val=1, NULL=1, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8c8f089=0, z_val=0, tmp=0, b0_val_t=1, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cdeba5d=0, d1_ev=2, comp_m1_i=0, b1_val=1, d1_req_up=0, tmp___0=1, NULL=2, z_val_t=0, b1_req_up=0, __retres1=1, d0_ev=2, NULL=0, NULL=0, NULL=0, z_ev=2, tmp=0, b1_ev=2, NULL=3, comp_m1_st=0, b0_req_up=0, z_req_up=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f8bf2fe=0, d1_val=1, b0_ev=2, NULL=0, tmp=1, d0_val_t=1, d1_val_t=1, b0_val=1, __retres1=0, d0_req_up=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 277]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int b0_val ; [L17] int b0_val_t ; [L18] int b0_ev ; [L19] int b0_req_up ; [L20] int b1_val ; [L21] int b1_val_t ; [L22] int b1_ev ; [L23] int b1_req_up ; [L24] int d0_val ; [L25] int d0_val_t ; [L26] int d0_ev ; [L27] int d0_req_up ; [L28] int d1_val ; [L29] int d1_val_t ; [L30] int d1_ev ; [L31] int d1_req_up ; [L32] int z_val ; [L33] int z_val_t ; [L34] int z_ev ; [L35] int z_req_up ; [L36] int comp_m1_st ; [L37] int comp_m1_i ; [L486] int __retres1 ; [L457] b0_val = 0 [L458] b0_ev = 2 [L459] b0_req_up = 0 [L460] b1_val = 0 [L461] b1_ev = 2 [L462] b1_req_up = 0 [L463] d0_val = 0 [L464] d0_ev = 2 [L465] d0_req_up = 0 [L466] d1_val = 0 [L467] d1_ev = 2 [L468] d1_req_up = 0 [L469] z_val = 0 [L470] z_ev = 2 [L471] z_req_up = 0 [L472] b0_val_t = 1 [L473] b0_req_up = 1 [L474] b1_val_t = 1 [L475] b1_req_up = 1 [L476] d0_val_t = 1 [L477] d0_req_up = 1 [L478] d1_val_t = 1 [L479] d1_req_up = 1 [L480] comp_m1_i = 0 [L411] int kernel_st ; [L412] int tmp ; [L416] kernel_st = 0 [L204] COND TRUE (int )b0_req_up == 1 [L129] COND TRUE (int )b0_val != (int )b0_val_t [L130] b0_val = b0_val_t [L131] b0_ev = 0 [L135] b0_req_up = 0 [L211] COND TRUE (int )b1_req_up == 1 [L144] COND TRUE (int )b1_val != (int )b1_val_t [L145] b1_val = b1_val_t [L146] b1_ev = 0 [L150] b1_req_up = 0 [L218] COND TRUE (int )d0_req_up == 1 [L159] COND TRUE (int )d0_val != (int )d0_val_t [L160] d0_val = d0_val_t [L161] d0_ev = 0 [L165] d0_req_up = 0 [L225] COND TRUE (int )d1_req_up == 1 [L174] COND TRUE (int )d1_val != (int )d1_val_t [L175] d1_val = d1_val_t [L176] d1_ev = 0 [L180] d1_req_up = 0 [L232] COND FALSE !((int )z_req_up == 1) [L247] COND FALSE !((int )comp_m1_i == 1) [L250] comp_m1_st = 2 [L313] COND TRUE (int )b0_ev == 0 [L314] b0_ev = 1 [L318] COND TRUE (int )b1_ev == 0 [L319] b1_ev = 1 [L323] COND TRUE (int )d0_ev == 0 [L324] d0_ev = 1 [L328] COND TRUE (int )d1_ev == 0 [L329] d1_ev = 1 [L333] COND FALSE !((int )z_ev == 0) [L376] int tmp ; [L96] int __retres1 ; [L99] COND TRUE (int )b0_ev == 1 [L100] __retres1 = 1 [L122] return (__retres1); [L380] tmp = is_method1_triggered() [L382] COND TRUE \read(tmp) [L383] comp_m1_st = 0 [L346] COND TRUE (int )b0_ev == 1 [L347] b0_ev = 2 [L351] COND TRUE (int )b1_ev == 1 [L352] b1_ev = 2 [L356] COND TRUE (int )d0_ev == 1 [L357] d0_ev = 2 [L361] COND TRUE (int )d1_ev == 1 [L362] d1_ev = 2 [L366] COND FALSE !((int )z_ev == 1) [L424] COND TRUE 1 [L427] kernel_st = 1 [L272] int tmp ; [L273] int tmp___0 ; Loop: [L277] COND TRUE 1 [L257] int __retres1 ; [L260] COND TRUE (int )comp_m1_st == 0 [L261] __retres1 = 1 [L268] return (__retres1); [L280] tmp___0 = exists_runnable_thread() [L282] COND TRUE \read(tmp___0) [L287] COND TRUE (int )comp_m1_st == 0 [L289] tmp = __VERIFIER_nondet_int() [L291] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...