./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/kundu.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/kundu.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 658e28af3337d6aa1794123f8e81f0b77fdcdb8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-26 05:45:59,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:45:59,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:45:59,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:45:59,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:45:59,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:45:59,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:45:59,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:45:59,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:45:59,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:45:59,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:45:59,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:45:59,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:45:59,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:45:59,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:45:59,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:45:59,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:45:59,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:45:59,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:45:59,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:45:59,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:45:59,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:45:59,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:45:59,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:45:59,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:45:59,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:45:59,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:45:59,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:45:59,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:45:59,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:45:59,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:45:59,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:45:59,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:45:59,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:45:59,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:45:59,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:45:59,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:45:59,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:45:59,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:45:59,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:45:59,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:45:59,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:45:59,349 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:45:59,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:45:59,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:45:59,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:45:59,351 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:45:59,351 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:45:59,351 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:45:59,352 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:45:59,352 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:45:59,352 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:45:59,352 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:45:59,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:45:59,353 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:45:59,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:45:59,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:45:59,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:45:59,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:45:59,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:45:59,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:45:59,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:45:59,354 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:45:59,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:45:59,355 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:45:59,355 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:45:59,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:45:59,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:45:59,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:45:59,356 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:45:59,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:45:59,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:45:59,356 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:45:59,356 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:45:59,358 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:45:59,358 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 658e28af3337d6aa1794123f8e81f0b77fdcdb8f [2020-10-26 05:45:59,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:45:59,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:45:59,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:45:59,767 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:45:59,767 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:45:59,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu.cil.c [2020-10-26 05:45:59,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03e89877/488e2b463c8b47e38ede955900bbd6e0/FLAGdf4f28c7c [2020-10-26 05:46:00,466 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:46:00,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c [2020-10-26 05:46:00,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03e89877/488e2b463c8b47e38ede955900bbd6e0/FLAGdf4f28c7c [2020-10-26 05:46:00,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03e89877/488e2b463c8b47e38ede955900bbd6e0 [2020-10-26 05:46:00,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:46:00,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:46:00,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:46:00,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:46:00,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:46:00,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:46:00" (1/1) ... [2020-10-26 05:46:00,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4a6804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:00, skipping insertion in model container [2020-10-26 05:46:00,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:46:00" (1/1) ... [2020-10-26 05:46:00,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:46:00,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:46:01,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:46:01,148 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:46:01,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:46:01,240 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:46:01,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01 WrapperNode [2020-10-26 05:46:01,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:46:01,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:46:01,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:46:01,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:46:01,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:46:01,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:46:01,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:46:01,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:46:01,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:01,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:46:01,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:46:01,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:46:01,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:46:01,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (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-26 05:46:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:46:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:46:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:46:01,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:46:02,504 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:46:02,504 INFO L298 CfgBuilder]: Removed 103 assume(true) statements. [2020-10-26 05:46:02,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:02 BoogieIcfgContainer [2020-10-26 05:46:02,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:46:02,508 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:46:02,508 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:46:02,512 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:46:02,513 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:02,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:46:00" (1/3) ... [2020-10-26 05:46:02,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fccd726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:46:02, skipping insertion in model container [2020-10-26 05:46:02,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:02,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:01" (2/3) ... [2020-10-26 05:46:02,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fccd726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:46:02, skipping insertion in model container [2020-10-26 05:46:02,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:02,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:02" (3/3) ... [2020-10-26 05:46:02,517 INFO L373 chiAutomizerObserver]: Analyzing ICFG kundu.cil.c [2020-10-26 05:46:02,571 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:46:02,572 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:46:02,572 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:46:02,572 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:46:02,572 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:46:02,572 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:46:02,573 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:46:02,573 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:46:02,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states. [2020-10-26 05:46:02,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 148 [2020-10-26 05:46:02,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:02,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:02,635 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-26 05:46:02,636 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] [2020-10-26 05:46:02,636 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:46:02,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states. [2020-10-26 05:46:02,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 148 [2020-10-26 05:46:02,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:02,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:02,648 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-26 05:46:02,648 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] [2020-10-26 05:46:02,657 INFO L794 eck$LassoCheckResult]: Stem: 139#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 12#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 158#L605true havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 73#L290true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 134#L297-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 181#L302-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 16#L307-1true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 149#L110true assume !(1 == ~P_1_pc~0); 144#L110-2true is_P_1_triggered_~__retres1~0 := 0; 150#L121true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 56#L122true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 24#L483true assume !(0 != activate_threads_~tmp~1); 27#L483-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 177#L178true assume 1 == ~P_2_pc~0; 109#L179true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 178#L189true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 111#L190true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 62#L491true assume !(0 != activate_threads_~tmp___0~1); 34#L491-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 52#L260true assume 1 == ~C_1_pc~0; 151#L261true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 128#L281true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 23#L282true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 67#L499true assume !(0 != activate_threads_~tmp___1~1); 140#L553-1true [2020-10-26 05:46:02,658 INFO L796 eck$LassoCheckResult]: Loop: 140#L553-1true assume !false; 90#L554true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 81#L389true assume !true; 112#L405true start_simulation_~kernel_st~0 := 2; 69#L290-1true start_simulation_~kernel_st~0 := 3; 110#L416true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 106#L110-6true assume !(1 == ~P_1_pc~0); 101#L110-8true is_P_1_triggered_~__retres1~0 := 0; 146#L121-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 79#L122-2true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 15#L483-6true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 19#L483-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 180#L178-6true assume !(1 == ~P_2_pc~0); 179#L178-8true is_P_2_triggered_~__retres1~1 := 0; 173#L189-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 103#L190-2true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 49#L491-6true assume !(0 != activate_threads_~tmp___0~1); 25#L491-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10#L260-6true assume 1 == ~C_1_pc~0; 164#L261-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 120#L281-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 47#L282-2true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 60#L499-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 63#L499-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 92#L320-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 48#L337-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 161#L338-1true start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 160#L572true assume !(0 == start_simulation_~tmp~3); 163#L572-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 66#L320-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 53#L337-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 165#L338-2true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 54#L527true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 133#L534true stop_simulation_#res := stop_simulation_~__retres2~0; 61#L535true start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 13#L585true assume !(0 != start_simulation_~tmp___0~2); 140#L553-1true [2020-10-26 05:46:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2020-10-26 05:46:02,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:02,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838906575] [2020-10-26 05:46:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:02,886 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-26 05:46:02,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838906575] [2020-10-26 05:46:02,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:02,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:02,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606919327] [2020-10-26 05:46:02,903 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1411034995, now seen corresponding path program 1 times [2020-10-26 05:46:02,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:02,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335495878] [2020-10-26 05:46:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:02,952 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-26 05:46:02,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335495878] [2020-10-26 05:46:02,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:02,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:02,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515265489] [2020-10-26 05:46:02,960 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:02,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:02,985 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 3 states. [2020-10-26 05:46:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:03,078 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2020-10-26 05:46:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:03,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2020-10-26 05:46:03,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2020-10-26 05:46:03,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 168 states and 251 transitions. [2020-10-26 05:46:03,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2020-10-26 05:46:03,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2020-10-26 05:46:03,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 251 transitions. [2020-10-26 05:46:03,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:03,114 INFO L691 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2020-10-26 05:46:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 251 transitions. [2020-10-26 05:46:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-10-26 05:46:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-26 05:46:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2020-10-26 05:46:03,176 INFO L714 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2020-10-26 05:46:03,177 INFO L594 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2020-10-26 05:46:03,178 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:46:03,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 251 transitions. [2020-10-26 05:46:03,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2020-10-26 05:46:03,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:03,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:03,187 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-26 05:46:03,187 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, 1, 1, 1] [2020-10-26 05:46:03,190 INFO L794 eck$LassoCheckResult]: Stem: 530#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 387#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 388#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 479#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 480#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 528#L302-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 395#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 396#L110 assume !(1 == ~P_1_pc~0); 455#L110-2 is_P_1_triggered_~__retres1~0 := 0; 454#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 456#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 410#L483 assume !(0 != activate_threads_~tmp~1); 411#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 414#L178 assume 1 == ~P_2_pc~0; 519#L179 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 520#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 522#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 463#L491 assume !(0 != activate_threads_~tmp___0~1); 421#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 422#L260 assume 1 == ~C_1_pc~0; 452#L261 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 405#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 407#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 408#L499 assume !(0 != activate_threads_~tmp___1~1); 390#L553-1 [2020-10-26 05:46:03,191 INFO L796 eck$LassoCheckResult]: Loop: 390#L553-1 assume !false; 499#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 482#L389 assume !false; 491#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 497#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 436#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 437#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 375#L354 assume !(0 != eval_~tmp___2~0); 377#L405 start_simulation_~kernel_st~0 := 2; 468#L290-1 start_simulation_~kernel_st~0 := 3; 469#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 518#L110-6 assume 1 == ~P_1_pc~0; 484#L111-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 485#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 487#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 393#L483-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 394#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 400#L178-6 assume 1 == ~P_2_pc~0; 509#L179-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 510#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 512#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 444#L491-6 assume !(0 != activate_threads_~tmp___0~1); 409#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 383#L260-6 assume 1 == ~C_1_pc~0; 384#L261-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 438#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 440#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 441#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 459#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 462#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 442#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 443#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 533#L572 assume !(0 == start_simulation_~tmp~3); 517#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 465#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 448#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 449#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 450#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 451#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 461#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 389#L585 assume !(0 != start_simulation_~tmp___0~2); 390#L553-1 [2020-10-26 05:46:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2020-10-26 05:46:03,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179862504] [2020-10-26 05:46:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,305 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-26 05:46:03,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179862504] [2020-10-26 05:46:03,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:03,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591753058] [2020-10-26 05:46:03,309 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:03,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1150374479, now seen corresponding path program 1 times [2020-10-26 05:46:03,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721983292] [2020-10-26 05:46:03,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,399 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-26 05:46:03,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721983292] [2020-10-26 05:46:03,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:03,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562052300] [2020-10-26 05:46:03,401 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:03,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:03,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:03,402 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-10-26 05:46:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:03,418 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2020-10-26 05:46:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:03,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 250 transitions. [2020-10-26 05:46:03,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2020-10-26 05:46:03,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 250 transitions. [2020-10-26 05:46:03,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2020-10-26 05:46:03,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2020-10-26 05:46:03,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 250 transitions. [2020-10-26 05:46:03,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:03,427 INFO L691 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2020-10-26 05:46:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 250 transitions. [2020-10-26 05:46:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-10-26 05:46:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-26 05:46:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2020-10-26 05:46:03,451 INFO L714 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2020-10-26 05:46:03,451 INFO L594 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2020-10-26 05:46:03,452 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:46:03,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 250 transitions. [2020-10-26 05:46:03,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2020-10-26 05:46:03,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:03,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:03,460 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-26 05:46:03,461 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, 1, 1, 1] [2020-10-26 05:46:03,462 INFO L794 eck$LassoCheckResult]: Stem: 875#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 732#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 733#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 820#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 821#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 873#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 740#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 741#L110 assume !(1 == ~P_1_pc~0); 800#L110-2 is_P_1_triggered_~__retres1~0 := 0; 799#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 801#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 754#L483 assume !(0 != activate_threads_~tmp~1); 755#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 759#L178 assume 1 == ~P_2_pc~0; 864#L179 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 865#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 867#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 807#L491 assume !(0 != activate_threads_~tmp___0~1); 766#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 767#L260 assume 1 == ~C_1_pc~0; 793#L261 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 750#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 752#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 753#L499 assume !(0 != activate_threads_~tmp___1~1); 735#L553-1 [2020-10-26 05:46:03,462 INFO L796 eck$LassoCheckResult]: Loop: 735#L553-1 assume !false; 844#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 830#L389 assume !false; 833#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 842#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 781#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 782#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 720#L354 assume !(0 != eval_~tmp___2~0); 722#L405 start_simulation_~kernel_st~0 := 2; 813#L290-1 start_simulation_~kernel_st~0 := 3; 814#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 862#L110-6 assume 1 == ~P_1_pc~0; 826#L111-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 827#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 832#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 738#L483-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 739#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 745#L178-6 assume 1 == ~P_2_pc~0; 854#L179-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 855#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 857#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 789#L491-6 assume !(0 != activate_threads_~tmp___0~1); 756#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 728#L260-6 assume 1 == ~C_1_pc~0; 729#L261-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 784#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 785#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 786#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 805#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 808#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 787#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 788#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 878#L572 assume !(0 == start_simulation_~tmp~3); 863#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 810#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 794#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 795#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 796#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 797#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 806#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 734#L585 assume !(0 != start_simulation_~tmp___0~2); 735#L553-1 [2020-10-26 05:46:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2020-10-26 05:46:03,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913808725] [2020-10-26 05:46:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,575 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-26 05:46:03,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913808725] [2020-10-26 05:46:03,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 05:46:03,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064682123] [2020-10-26 05:46:03,577 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1150374479, now seen corresponding path program 2 times [2020-10-26 05:46:03,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512345830] [2020-10-26 05:46:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,622 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-26 05:46:03,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512345830] [2020-10-26 05:46:03,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:03,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851428698] [2020-10-26 05:46:03,624 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:03,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:03,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 05:46:03,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 05:46:03,625 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. cyclomatic complexity: 83 Second operand 4 states. [2020-10-26 05:46:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:03,793 INFO L93 Difference]: Finished difference Result 435 states and 632 transitions. [2020-10-26 05:46:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 05:46:03,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 435 states and 632 transitions. [2020-10-26 05:46:03,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 377 [2020-10-26 05:46:03,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 435 states to 435 states and 632 transitions. [2020-10-26 05:46:03,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2020-10-26 05:46:03,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 435 [2020-10-26 05:46:03,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 435 states and 632 transitions. [2020-10-26 05:46:03,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:03,807 INFO L691 BuchiCegarLoop]: Abstraction has 435 states and 632 transitions. [2020-10-26 05:46:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states and 632 transitions. [2020-10-26 05:46:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2020-10-26 05:46:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-26 05:46:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 578 transitions. [2020-10-26 05:46:03,826 INFO L714 BuchiCegarLoop]: Abstraction has 395 states and 578 transitions. [2020-10-26 05:46:03,826 INFO L594 BuchiCegarLoop]: Abstraction has 395 states and 578 transitions. [2020-10-26 05:46:03,826 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:46:03,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 578 transitions. [2020-10-26 05:46:03,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 362 [2020-10-26 05:46:03,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:03,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:03,830 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-26 05:46:03,831 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, 1, 1, 1] [2020-10-26 05:46:03,831 INFO L794 eck$LassoCheckResult]: Stem: 1494#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1348#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1349#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1441#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1442#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1492#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1356#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1357#L110 assume !(1 == ~P_1_pc~0); 1496#L110-2 is_P_1_triggered_~__retres1~0 := 0; 1497#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1416#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1371#L483 assume !(0 != activate_threads_~tmp~1); 1372#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1375#L178 assume !(1 == ~P_2_pc~0); 1503#L178-2 is_P_2_triggered_~__retres1~1 := 0; 1504#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1484#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1423#L491 assume !(0 != activate_threads_~tmp___0~1); 1382#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1383#L260 assume 1 == ~C_1_pc~0; 1415#L261 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1366#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1368#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1369#L499 assume !(0 != activate_threads_~tmp___1~1); 1351#L553-1 [2020-10-26 05:46:03,831 INFO L796 eck$LassoCheckResult]: Loop: 1351#L553-1 assume !false; 1461#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1444#L389 assume !false; 1455#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1459#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1397#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1398#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1336#L354 assume !(0 != eval_~tmp___2~0); 1338#L405 start_simulation_~kernel_st~0 := 2; 1429#L290-1 start_simulation_~kernel_st~0 := 3; 1430#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1482#L110-6 assume !(1 == ~P_1_pc~0); 1472#L110-8 is_P_1_triggered_~__retres1~0 := 0; 1473#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1449#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1354#L483-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1355#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1361#L178-6 assume !(1 == ~P_2_pc~0); 1508#L178-8 is_P_2_triggered_~__retres1~1 := 0; 1505#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1477#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1408#L491-6 assume !(0 != activate_threads_~tmp___0~1); 1370#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1344#L260-6 assume 1 == ~C_1_pc~0; 1345#L261-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1400#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1403#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1404#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1419#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1422#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1405#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1406#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 1502#L572 assume !(0 == start_simulation_~tmp~3); 1483#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 1425#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1411#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1412#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 1413#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1414#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 1421#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1350#L585 assume !(0 != start_simulation_~tmp___0~2); 1351#L553-1 [2020-10-26 05:46:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2020-10-26 05:46:03,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161524337] [2020-10-26 05:46:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,874 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-26 05:46:03,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161524337] [2020-10-26 05:46:03,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 05:46:03,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977628319] [2020-10-26 05:46:03,875 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1497053615, now seen corresponding path program 1 times [2020-10-26 05:46:03,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739042663] [2020-10-26 05:46:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,935 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-26 05:46:03,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739042663] [2020-10-26 05:46:03,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:03,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053529666] [2020-10-26 05:46:03,936 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:03,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 05:46:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 05:46:03,938 INFO L87 Difference]: Start difference. First operand 395 states and 578 transitions. cyclomatic complexity: 185 Second operand 4 states. [2020-10-26 05:46:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:04,179 INFO L93 Difference]: Finished difference Result 1091 states and 1558 transitions. [2020-10-26 05:46:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 05:46:04,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1091 states and 1558 transitions. [2020-10-26 05:46:04,189 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2020-10-26 05:46:04,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1091 states to 1091 states and 1558 transitions. [2020-10-26 05:46:04,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1091 [2020-10-26 05:46:04,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1091 [2020-10-26 05:46:04,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1091 states and 1558 transitions. [2020-10-26 05:46:04,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,205 INFO L691 BuchiCegarLoop]: Abstraction has 1091 states and 1558 transitions. [2020-10-26 05:46:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states and 1558 transitions. [2020-10-26 05:46:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1032. [2020-10-26 05:46:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2020-10-26 05:46:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1486 transitions. [2020-10-26 05:46:04,239 INFO L714 BuchiCegarLoop]: Abstraction has 1032 states and 1486 transitions. [2020-10-26 05:46:04,239 INFO L594 BuchiCegarLoop]: Abstraction has 1032 states and 1486 transitions. [2020-10-26 05:46:04,239 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:46:04,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1032 states and 1486 transitions. [2020-10-26 05:46:04,246 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 994 [2020-10-26 05:46:04,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:04,247 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] [2020-10-26 05:46:04,247 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, 1, 1, 1, 1] [2020-10-26 05:46:04,248 INFO L794 eck$LassoCheckResult]: Stem: 3001#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2845#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2846#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 2937#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2938#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2997#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2853#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2854#L110 assume !(1 == ~P_1_pc~0); 3003#L110-2 is_P_1_triggered_~__retres1~0 := 0; 3004#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2912#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2869#L483 assume !(0 != activate_threads_~tmp~1); 2870#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2873#L178 assume !(1 == ~P_2_pc~0); 3020#L178-2 is_P_2_triggered_~__retres1~1 := 0; 3021#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2986#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2919#L491 assume !(0 != activate_threads_~tmp___0~1); 2880#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2881#L260 assume !(1 == ~C_1_pc~0); 2896#L260-2 assume 2 == ~C_1_pc~0; 2863#L271 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 2864#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2866#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2867#L499 assume !(0 != activate_threads_~tmp___1~1); 2923#L553-1 [2020-10-26 05:46:04,248 INFO L796 eck$LassoCheckResult]: Loop: 2923#L553-1 assume !false; 3641#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3594#L389 assume !false; 3636#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3634#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3632#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3624#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 3618#L354 assume !(0 != eval_~tmp___2~0); 2984#L405 start_simulation_~kernel_st~0 := 2; 2985#L290-1 start_simulation_~kernel_st~0 := 3; 3838#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3796#L110-6 assume !(1 == ~P_1_pc~0); 3761#L110-8 is_P_1_triggered_~__retres1~0 := 0; 3760#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3759#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3758#L483-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 3744#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3742#L178-6 assume !(1 == ~P_2_pc~0); 3740#L178-8 is_P_2_triggered_~__retres1~1 := 0; 3738#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3735#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 3731#L491-6 assume !(0 != activate_threads_~tmp___0~1); 3727#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3723#L260-6 assume !(1 == ~C_1_pc~0); 3719#L260-8 assume 2 == ~C_1_pc~0; 3714#L271-2 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 3710#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3706#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 3701#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3697#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3692#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3687#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3683#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 3678#L572 assume !(0 == start_simulation_~tmp~3); 3675#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 3672#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3668#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3665#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 3662#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3659#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 3656#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 3642#L585 assume !(0 != start_simulation_~tmp___0~2); 2923#L553-1 [2020-10-26 05:46:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1720008278, now seen corresponding path program 1 times [2020-10-26 05:46:04,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960668700] [2020-10-26 05:46:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,306 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-26 05:46:04,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960668700] [2020-10-26 05:46:04,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:04,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341144282] [2020-10-26 05:46:04,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1739039387, now seen corresponding path program 1 times [2020-10-26 05:46:04,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326240963] [2020-10-26 05:46:04,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,359 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-26 05:46:04,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326240963] [2020-10-26 05:46:04,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:04,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242317484] [2020-10-26 05:46:04,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:04,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:04,362 INFO L87 Difference]: Start difference. First operand 1032 states and 1486 transitions. cyclomatic complexity: 458 Second operand 3 states. [2020-10-26 05:46:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:04,438 INFO L93 Difference]: Finished difference Result 1366 states and 1936 transitions. [2020-10-26 05:46:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:04,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1366 states and 1936 transitions. [2020-10-26 05:46:04,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1323 [2020-10-26 05:46:04,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1366 states to 1366 states and 1936 transitions. [2020-10-26 05:46:04,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1366 [2020-10-26 05:46:04,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1366 [2020-10-26 05:46:04,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1366 states and 1936 transitions. [2020-10-26 05:46:04,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,487 INFO L691 BuchiCegarLoop]: Abstraction has 1366 states and 1936 transitions. [2020-10-26 05:46:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states and 1936 transitions. [2020-10-26 05:46:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1342. [2020-10-26 05:46:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2020-10-26 05:46:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1906 transitions. [2020-10-26 05:46:04,514 INFO L714 BuchiCegarLoop]: Abstraction has 1342 states and 1906 transitions. [2020-10-26 05:46:04,514 INFO L594 BuchiCegarLoop]: Abstraction has 1342 states and 1906 transitions. [2020-10-26 05:46:04,515 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 05:46:04,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1342 states and 1906 transitions. [2020-10-26 05:46:04,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1299 [2020-10-26 05:46:04,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:04,525 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] [2020-10-26 05:46:04,525 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, 1, 1, 1, 1] [2020-10-26 05:46:04,525 INFO L794 eck$LassoCheckResult]: Stem: 5417#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5252#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 5253#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5350#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5351#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 5414#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5260#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5261#L110 assume !(1 == ~P_1_pc~0); 5421#L110-2 is_P_1_triggered_~__retres1~0 := 0; 5422#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5321#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5272#L483 assume !(0 != activate_threads_~tmp~1); 5273#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5276#L178 assume !(1 == ~P_2_pc~0); 5443#L178-2 is_P_2_triggered_~__retres1~1 := 0; 5444#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5402#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5330#L491 assume !(0 != activate_threads_~tmp___0~1); 5282#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5283#L260 assume !(1 == ~C_1_pc~0); 5301#L260-2 assume !(2 == ~C_1_pc~0); 5302#L270-1 is_C_1_triggered_~__retres1~2 := 0; 5406#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5268#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 5269#L499 assume !(0 != activate_threads_~tmp___1~1); 5335#L553-1 [2020-10-26 05:46:04,525 INFO L796 eck$LassoCheckResult]: Loop: 5335#L553-1 assume !false; 6514#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 6499#L389 assume !false; 6513#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6510#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6508#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6507#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 5241#L354 assume !(0 != eval_~tmp___2~0); 5243#L405 start_simulation_~kernel_st~0 := 2; 5338#L290-1 start_simulation_~kernel_st~0 := 3; 5339#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5399#L110-6 assume !(1 == ~P_1_pc~0); 5388#L110-8 is_P_1_triggered_~__retres1~0 := 0; 5389#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5359#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5258#L483-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 5259#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5265#L178-6 assume !(1 == ~P_2_pc~0); 5447#L178-8 is_P_2_triggered_~__retres1~1 := 0; 5448#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6494#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5311#L491-6 assume !(0 != activate_threads_~tmp___0~1); 5270#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5271#L260-6 assume !(1 == ~C_1_pc~0); 6542#L260-8 assume !(2 == ~C_1_pc~0); 6540#L270-5 is_C_1_triggered_~__retres1~2 := 0; 5405#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5307#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 5308#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5328#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5329#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5309#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5310#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 5429#L572 assume !(0 == start_simulation_~tmp~3); 5401#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 5333#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5317#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5318#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 5319#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5320#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 5413#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 6515#L585 assume !(0 != start_simulation_~tmp___0~2); 5335#L553-1 [2020-10-26 05:46:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2020-10-26 05:46:04,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120026549] [2020-10-26 05:46:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:04,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:04,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:04,588 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1415576198, now seen corresponding path program 1 times [2020-10-26 05:46:04,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655187092] [2020-10-26 05:46:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,644 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-26 05:46:04,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655187092] [2020-10-26 05:46:04,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:04,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487131510] [2020-10-26 05:46:04,646 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:04,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:46:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:46:04,648 INFO L87 Difference]: Start difference. First operand 1342 states and 1906 transitions. cyclomatic complexity: 568 Second operand 5 states. [2020-10-26 05:46:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:04,816 INFO L93 Difference]: Finished difference Result 2379 states and 3348 transitions. [2020-10-26 05:46:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 05:46:04,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2379 states and 3348 transitions. [2020-10-26 05:46:04,840 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2318 [2020-10-26 05:46:04,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2379 states to 2379 states and 3348 transitions. [2020-10-26 05:46:04,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2379 [2020-10-26 05:46:04,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2379 [2020-10-26 05:46:04,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2379 states and 3348 transitions. [2020-10-26 05:46:04,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,868 INFO L691 BuchiCegarLoop]: Abstraction has 2379 states and 3348 transitions. [2020-10-26 05:46:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states and 3348 transitions. [2020-10-26 05:46:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1378. [2020-10-26 05:46:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2020-10-26 05:46:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1942 transitions. [2020-10-26 05:46:04,902 INFO L714 BuchiCegarLoop]: Abstraction has 1378 states and 1942 transitions. [2020-10-26 05:46:04,902 INFO L594 BuchiCegarLoop]: Abstraction has 1378 states and 1942 transitions. [2020-10-26 05:46:04,902 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 05:46:04,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1378 states and 1942 transitions. [2020-10-26 05:46:04,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1335 [2020-10-26 05:46:04,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:04,913 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] [2020-10-26 05:46:04,913 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, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:04,914 INFO L794 eck$LassoCheckResult]: Stem: 9169#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 8988#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 8989#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 9085#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 9086#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 9167#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 8996#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8997#L110 assume !(1 == ~P_1_pc~0); 9171#L110-2 is_P_1_triggered_~__retres1~0 := 0; 9172#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 9059#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 9007#L483 assume !(0 != activate_threads_~tmp~1); 9008#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 9013#L178 assume !(1 == ~P_2_pc~0); 9196#L178-2 is_P_2_triggered_~__retres1~1 := 0; 9197#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 9147#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9068#L491 assume !(0 != activate_threads_~tmp___0~1); 9019#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 9020#L260 assume !(1 == ~C_1_pc~0); 9035#L260-2 assume !(2 == ~C_1_pc~0); 9036#L270-1 is_C_1_triggered_~__retres1~2 := 0; 9156#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 9005#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 9006#L499 assume !(0 != activate_threads_~tmp___1~1); 8991#L553-1 [2020-10-26 05:46:04,914 INFO L796 eck$LassoCheckResult]: Loop: 8991#L553-1 assume !false; 9114#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 9098#L389 assume !false; 9099#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9111#L320 assume !(0 == ~P_1_st~0); 9113#L324 assume !(0 == ~P_2_st~0); 9193#L328 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 10245#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 10244#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 10219#L354 assume !(0 != eval_~tmp___2~0); 10220#L405 start_simulation_~kernel_st~0 := 2; 9075#L290-1 start_simulation_~kernel_st~0 := 3; 9076#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 9143#L110-6 assume !(1 == ~P_1_pc~0); 9144#L110-8 is_P_1_triggered_~__retres1~0 := 0; 9174#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 9175#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8994#L483-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8995#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 9205#L178-6 assume !(1 == ~P_2_pc~0); 9206#L178-8 is_P_2_triggered_~__retres1~1 := 0; 9198#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 9199#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9048#L491-6 assume !(0 != activate_threads_~tmp___0~1); 9049#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8984#L260-6 assume !(1 == ~C_1_pc~0); 8985#L260-8 assume !(2 == ~C_1_pc~0); 9115#L270-5 is_C_1_triggered_~__retres1~2 := 0; 9116#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 9044#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 9045#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 9066#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9067#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 9046#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 9047#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 9182#L572 assume !(0 == start_simulation_~tmp~3); 9142#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 10326#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 10323#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 10322#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 10321#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 10320#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 9065#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 8990#L585 assume !(0 != start_simulation_~tmp___0~2); 8991#L553-1 [2020-10-26 05:46:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2020-10-26 05:46:04,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998397643] [2020-10-26 05:46:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:04,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:04,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:04,969 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2009211725, now seen corresponding path program 1 times [2020-10-26 05:46:04,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361990373] [2020-10-26 05:46:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,047 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-26 05:46:05,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361990373] [2020-10-26 05:46:05,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:05,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420741575] [2020-10-26 05:46:05,048 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:05,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:46:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:46:05,050 INFO L87 Difference]: Start difference. First operand 1378 states and 1942 transitions. cyclomatic complexity: 568 Second operand 5 states. [2020-10-26 05:46:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,223 INFO L93 Difference]: Finished difference Result 2688 states and 3781 transitions. [2020-10-26 05:46:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:46:05,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2688 states and 3781 transitions. [2020-10-26 05:46:05,250 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2645 [2020-10-26 05:46:05,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2688 states to 2688 states and 3781 transitions. [2020-10-26 05:46:05,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2688 [2020-10-26 05:46:05,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2688 [2020-10-26 05:46:05,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2688 states and 3781 transitions. [2020-10-26 05:46:05,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,281 INFO L691 BuchiCegarLoop]: Abstraction has 2688 states and 3781 transitions. [2020-10-26 05:46:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states and 3781 transitions. [2020-10-26 05:46:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 1432. [2020-10-26 05:46:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2020-10-26 05:46:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1981 transitions. [2020-10-26 05:46:05,318 INFO L714 BuchiCegarLoop]: Abstraction has 1432 states and 1981 transitions. [2020-10-26 05:46:05,318 INFO L594 BuchiCegarLoop]: Abstraction has 1432 states and 1981 transitions. [2020-10-26 05:46:05,318 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 05:46:05,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1432 states and 1981 transitions. [2020-10-26 05:46:05,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1389 [2020-10-26 05:46:05,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:05,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:05,335 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] [2020-10-26 05:46:05,336 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, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:05,336 INFO L794 eck$LassoCheckResult]: Stem: 13230#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 13066#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 13067#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 13161#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 13162#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 13226#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 13074#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 13075#L110 assume !(1 == ~P_1_pc~0); 13233#L110-2 is_P_1_triggered_~__retres1~0 := 0; 13234#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13134#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 13084#L483 assume !(0 != activate_threads_~tmp~1); 13085#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 13089#L178 assume !(1 == ~P_2_pc~0); 13252#L178-2 is_P_2_triggered_~__retres1~1 := 0; 13253#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 13216#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 13140#L491 assume !(0 != activate_threads_~tmp___0~1); 13096#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13097#L260 assume !(1 == ~C_1_pc~0); 13114#L260-2 assume !(2 == ~C_1_pc~0); 13115#L270-1 is_C_1_triggered_~__retres1~2 := 0; 13218#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13082#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 13083#L499 assume !(0 != activate_threads_~tmp___1~1); 13146#L553-1 [2020-10-26 05:46:05,336 INFO L796 eck$LassoCheckResult]: Loop: 13146#L553-1 assume !false; 13632#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 13408#L389 assume !false; 14172#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 14167#L320 assume !(0 == ~P_1_st~0); 14168#L324 assume !(0 == ~P_2_st~0); 14169#L328 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 14170#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13542#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 13543#L354 assume !(0 != eval_~tmp___2~0); 14163#L405 start_simulation_~kernel_st~0 := 2; 13721#L290-1 start_simulation_~kernel_st~0 := 3; 13722#L416 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 13717#L110-6 assume !(1 == ~P_1_pc~0); 13718#L110-8 is_P_1_triggered_~__retres1~0 := 0; 13712#L121-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13713#L122-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 13706#L483-6 assume !(0 != activate_threads_~tmp~1); 13707#L483-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 13700#L178-6 assume !(1 == ~P_2_pc~0); 13701#L178-8 is_P_2_triggered_~__retres1~1 := 0; 13694#L189-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 13695#L190-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 13688#L491-6 assume !(0 != activate_threads_~tmp___0~1); 13689#L491-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13682#L260-6 assume !(1 == ~C_1_pc~0); 13683#L260-8 assume !(2 == ~C_1_pc~0); 13675#L270-5 is_C_1_triggered_~__retres1~2 := 0; 13676#L281-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13668#L282-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 13669#L499-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 13661#L499-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13662#L320-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13653#L337-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13654#L338-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 13646#L572 assume !(0 == start_simulation_~tmp~3); 13644#L572-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 13643#L320-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13640#L337-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13639#L338-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 13638#L527 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 13637#L534 stop_simulation_#res := stop_simulation_~__retres2~0; 13636#L535 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 13635#L585 assume !(0 != start_simulation_~tmp___0~2); 13146#L553-1 [2020-10-26 05:46:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2020-10-26 05:46:05,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950554252] [2020-10-26 05:46:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,365 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash -85983691, now seen corresponding path program 1 times [2020-10-26 05:46:05,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857628624] [2020-10-26 05:46:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,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-26 05:46:05,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857628624] [2020-10-26 05:46:05,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:05,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810354922] [2020-10-26 05:46:05,399 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:05,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:05,400 INFO L87 Difference]: Start difference. First operand 1432 states and 1981 transitions. cyclomatic complexity: 553 Second operand 3 states. [2020-10-26 05:46:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,458 INFO L93 Difference]: Finished difference Result 2217 states and 3028 transitions. [2020-10-26 05:46:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:05,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2217 states and 3028 transitions. [2020-10-26 05:46:05,480 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2130 [2020-10-26 05:46:05,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2217 states to 2217 states and 3028 transitions. [2020-10-26 05:46:05,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2217 [2020-10-26 05:46:05,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2217 [2020-10-26 05:46:05,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2217 states and 3028 transitions. [2020-10-26 05:46:05,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,508 INFO L691 BuchiCegarLoop]: Abstraction has 2217 states and 3028 transitions. [2020-10-26 05:46:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states and 3028 transitions. [2020-10-26 05:46:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2020-10-26 05:46:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2020-10-26 05:46:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3028 transitions. [2020-10-26 05:46:05,556 INFO L714 BuchiCegarLoop]: Abstraction has 2217 states and 3028 transitions. [2020-10-26 05:46:05,556 INFO L594 BuchiCegarLoop]: Abstraction has 2217 states and 3028 transitions. [2020-10-26 05:46:05,556 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 05:46:05,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2217 states and 3028 transitions. [2020-10-26 05:46:05,571 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2130 [2020-10-26 05:46:05,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:05,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:05,572 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] [2020-10-26 05:46:05,572 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:05,573 INFO L794 eck$LassoCheckResult]: Stem: 16881#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 16720#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 16721#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 16812#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 16813#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16878#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 16728#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 16729#L110 assume !(1 == ~P_1_pc~0); 16883#L110-2 is_P_1_triggered_~__retres1~0 := 0; 16884#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 16788#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 16738#L483 assume !(0 != activate_threads_~tmp~1); 16739#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 16743#L178 assume !(1 == ~P_2_pc~0); 16910#L178-2 is_P_2_triggered_~__retres1~1 := 0; 16911#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 16865#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 16794#L491 assume !(0 != activate_threads_~tmp___0~1); 16749#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 16750#L260 assume !(1 == ~C_1_pc~0); 16766#L260-2 assume !(2 == ~C_1_pc~0); 16767#L270-1 is_C_1_triggered_~__retres1~2 := 0; 16870#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 16736#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 16737#L499 assume !(0 != activate_threads_~tmp___1~1); 16800#L553-1 assume !false; 18332#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 18295#L389 [2020-10-26 05:46:05,573 INFO L796 eck$LassoCheckResult]: Loop: 18295#L389 assume !false; 18286#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 18224#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 18217#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18211#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 18203#L354 assume 0 != eval_~tmp___2~0; 18204#L354-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 18464#L363 assume !(0 != eval_~tmp~0); 18462#L359 assume !(0 == ~P_2_st~0); 18334#L374 assume !(0 == ~C_1_st~0); 18295#L389 [2020-10-26 05:46:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2020-10-26 05:46:05,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572705783] [2020-10-26 05:46:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,602 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1012948955, now seen corresponding path program 1 times [2020-10-26 05:46:05,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850890614] [2020-10-26 05:46:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1596401401, now seen corresponding path program 1 times [2020-10-26 05:46:05,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662027069] [2020-10-26 05:46:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,664 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-26 05:46:05,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662027069] [2020-10-26 05:46:05,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:05,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344213231] [2020-10-26 05:46:05,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:05,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:05,762 INFO L87 Difference]: Start difference. First operand 2217 states and 3028 transitions. cyclomatic complexity: 818 Second operand 3 states. [2020-10-26 05:46:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,861 INFO L93 Difference]: Finished difference Result 3686 states and 4965 transitions. [2020-10-26 05:46:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:05,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3686 states and 4965 transitions. [2020-10-26 05:46:05,891 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3553 [2020-10-26 05:46:05,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3686 states to 3686 states and 4965 transitions. [2020-10-26 05:46:05,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3686 [2020-10-26 05:46:05,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3686 [2020-10-26 05:46:05,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3686 states and 4965 transitions. [2020-10-26 05:46:05,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,932 INFO L691 BuchiCegarLoop]: Abstraction has 3686 states and 4965 transitions. [2020-10-26 05:46:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states and 4965 transitions. [2020-10-26 05:46:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3610. [2020-10-26 05:46:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2020-10-26 05:46:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4871 transitions. [2020-10-26 05:46:06,021 INFO L714 BuchiCegarLoop]: Abstraction has 3610 states and 4871 transitions. [2020-10-26 05:46:06,022 INFO L594 BuchiCegarLoop]: Abstraction has 3610 states and 4871 transitions. [2020-10-26 05:46:06,022 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 05:46:06,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3610 states and 4871 transitions. [2020-10-26 05:46:06,041 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3477 [2020-10-26 05:46:06,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:06,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:06,042 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] [2020-10-26 05:46:06,043 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:06,043 INFO L794 eck$LassoCheckResult]: Stem: 22807#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 22632#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 22633#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 22731#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 22732#L297-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 22804#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 22845#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 22813#L110 assume !(1 == ~P_1_pc~0); 22814#L110-2 is_P_1_triggered_~__retres1~0 := 0; 22815#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 22816#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 22650#L483 assume !(0 != activate_threads_~tmp~1); 22651#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 24984#L178 assume !(1 == ~P_2_pc~0); 24980#L178-2 is_P_2_triggered_~__retres1~1 := 0; 24978#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 22789#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 22712#L491 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 22662#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 22663#L260 assume !(1 == ~C_1_pc~0); 22679#L260-2 assume !(2 == ~C_1_pc~0); 22680#L270-1 is_C_1_triggered_~__retres1~2 := 0; 22798#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 22799#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 22719#L499 assume !(0 != activate_threads_~tmp___1~1); 22720#L553-1 assume !false; 24820#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 24776#L389 [2020-10-26 05:46:06,043 INFO L796 eck$LassoCheckResult]: Loop: 24776#L389 assume !false; 24769#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 24768#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 24765#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 24764#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 24722#L354 assume 0 != eval_~tmp___2~0; 24723#L354-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 24759#L363 assume !(0 != eval_~tmp~0); 24216#L359 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 23795#L378 assume !(0 != eval_~tmp___0~0); 24778#L374 assume !(0 == ~C_1_st~0); 24776#L389 [2020-10-26 05:46:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1311379569, now seen corresponding path program 1 times [2020-10-26 05:46:06,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212978521] [2020-10-26 05:46:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:06,064 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-26 05:46:06,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212978521] [2020-10-26 05:46:06,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:06,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:06,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971001061] [2020-10-26 05:46:06,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1336506855, now seen corresponding path program 1 times [2020-10-26 05:46:06,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246849303] [2020-10-26 05:46:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,077 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:06,144 INFO L87 Difference]: Start difference. First operand 3610 states and 4871 transitions. cyclomatic complexity: 1268 Second operand 3 states. [2020-10-26 05:46:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:06,168 INFO L93 Difference]: Finished difference Result 3588 states and 4846 transitions. [2020-10-26 05:46:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:06,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3588 states and 4846 transitions. [2020-10-26 05:46:06,229 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3477 [2020-10-26 05:46:06,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3588 states to 3588 states and 4846 transitions. [2020-10-26 05:46:06,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3588 [2020-10-26 05:46:06,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3588 [2020-10-26 05:46:06,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3588 states and 4846 transitions. [2020-10-26 05:46:06,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:06,268 INFO L691 BuchiCegarLoop]: Abstraction has 3588 states and 4846 transitions. [2020-10-26 05:46:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states and 4846 transitions. [2020-10-26 05:46:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3588. [2020-10-26 05:46:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-26 05:46:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4846 transitions. [2020-10-26 05:46:06,345 INFO L714 BuchiCegarLoop]: Abstraction has 3588 states and 4846 transitions. [2020-10-26 05:46:06,346 INFO L594 BuchiCegarLoop]: Abstraction has 3588 states and 4846 transitions. [2020-10-26 05:46:06,346 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 05:46:06,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3588 states and 4846 transitions. [2020-10-26 05:46:06,365 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3477 [2020-10-26 05:46:06,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:06,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:06,366 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] [2020-10-26 05:46:06,367 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:06,367 INFO L794 eck$LassoCheckResult]: Stem: 30003#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 29835#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 29836#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 29930#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 29931#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 30000#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 29843#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 29844#L110 assume !(1 == ~P_1_pc~0); 30005#L110-2 is_P_1_triggered_~__retres1~0 := 0; 30006#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 29905#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 29853#L483 assume !(0 != activate_threads_~tmp~1); 29854#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 29858#L178 assume !(1 == ~P_2_pc~0); 30032#L178-2 is_P_2_triggered_~__retres1~1 := 0; 30033#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 29985#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 29912#L491 assume !(0 != activate_threads_~tmp___0~1); 29864#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 29865#L260 assume !(1 == ~C_1_pc~0); 29881#L260-2 assume !(2 == ~C_1_pc~0); 29882#L270-1 is_C_1_triggered_~__retres1~2 := 0; 29990#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 29851#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 29852#L499 assume !(0 != activate_threads_~tmp___1~1); 29918#L553-1 assume !false; 32494#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 32491#L389 [2020-10-26 05:46:06,367 INFO L796 eck$LassoCheckResult]: Loop: 32491#L389 assume !false; 32489#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 32486#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 32484#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 32482#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 32480#L354 assume 0 != eval_~tmp___2~0; 32475#L354-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 32469#L363 assume !(0 != eval_~tmp~0); 32462#L359 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 31163#L378 assume !(0 != eval_~tmp___0~0); 31164#L374 assume !(0 == ~C_1_st~0); 32491#L389 [2020-10-26 05:46:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2020-10-26 05:46:06,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460924689] [2020-10-26 05:46:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,395 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1336506855, now seen corresponding path program 2 times [2020-10-26 05:46:06,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715175083] [2020-10-26 05:46:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,406 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2051024443, now seen corresponding path program 1 times [2020-10-26 05:46:06,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437929934] [2020-10-26 05:46:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:06,460 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-26 05:46:06,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437929934] [2020-10-26 05:46:06,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:06,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:06,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568230529] [2020-10-26 05:46:06,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:06,530 INFO L87 Difference]: Start difference. First operand 3588 states and 4846 transitions. cyclomatic complexity: 1265 Second operand 3 states. [2020-10-26 05:46:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:06,594 INFO L93 Difference]: Finished difference Result 6270 states and 8396 transitions. [2020-10-26 05:46:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:06,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6270 states and 8396 transitions. [2020-10-26 05:46:06,632 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6075 [2020-10-26 05:46:06,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6270 states to 6270 states and 8396 transitions. [2020-10-26 05:46:06,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6270 [2020-10-26 05:46:06,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6270 [2020-10-26 05:46:06,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6270 states and 8396 transitions. [2020-10-26 05:46:06,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:06,717 INFO L691 BuchiCegarLoop]: Abstraction has 6270 states and 8396 transitions. [2020-10-26 05:46:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6270 states and 8396 transitions. [2020-10-26 05:46:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6270 to 6270. [2020-10-26 05:46:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6270 states. [2020-10-26 05:46:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8396 transitions. [2020-10-26 05:46:06,892 INFO L714 BuchiCegarLoop]: Abstraction has 6270 states and 8396 transitions. [2020-10-26 05:46:06,892 INFO L594 BuchiCegarLoop]: Abstraction has 6270 states and 8396 transitions. [2020-10-26 05:46:06,892 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 05:46:06,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6270 states and 8396 transitions. [2020-10-26 05:46:06,921 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6075 [2020-10-26 05:46:06,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:06,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:06,922 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] [2020-10-26 05:46:06,922 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:06,923 INFO L794 eck$LassoCheckResult]: Stem: 39869#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 39702#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 39703#L605 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 39795#L290 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 39796#L297-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 39866#L302-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 39710#L307-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 39711#L110 assume !(1 == ~P_1_pc~0); 39873#L110-2 is_P_1_triggered_~__retres1~0 := 0; 39874#L121 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 39770#L122 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 39721#L483 assume !(0 != activate_threads_~tmp~1); 39722#L483-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 39726#L178 assume !(1 == ~P_2_pc~0); 39899#L178-2 is_P_2_triggered_~__retres1~1 := 0; 39900#L189 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 39853#L190 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 39778#L491 assume !(0 != activate_threads_~tmp___0~1); 39733#L491-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 39734#L260 assume !(1 == ~C_1_pc~0); 39748#L260-2 assume !(2 == ~C_1_pc~0); 39749#L270-1 is_C_1_triggered_~__retres1~2 := 0; 39857#L281 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 39719#L282 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 39720#L499 assume !(0 != activate_threads_~tmp___1~1); 39784#L553-1 assume !false; 40626#L554 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 40627#L389 [2020-10-26 05:46:06,923 INFO L796 eck$LassoCheckResult]: Loop: 40627#L389 assume !false; 41858#L350 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 41856#L320 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 41855#L337 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 41854#L338 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 41853#L354 assume 0 != eval_~tmp___2~0; 40565#L354-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 40554#L363 assume !(0 != eval_~tmp~0); 40556#L359 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 41809#L378 assume !(0 != eval_~tmp___0~0); 41808#L374 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 41807#L393 assume !(0 != eval_~tmp___1~0); 40627#L389 [2020-10-26 05:46:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2020-10-26 05:46:06,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510393185] [2020-10-26 05:46:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,960 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1517962496, now seen corresponding path program 1 times [2020-10-26 05:46:06,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756175510] [2020-10-26 05:46:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,982 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash -842753748, now seen corresponding path program 1 times [2020-10-26 05:46:06,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988320722] [2020-10-26 05:46:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:07,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:07,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:07,271 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-10-26 05:46:08,102 WARN L193 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 145 [2020-10-26 05:46:08,373 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-10-26 05:46:08,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:46:08 BoogieIcfgContainer [2020-10-26 05:46:08,439 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:46:08,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:46:08,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:46:08,442 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:46:08,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:02" (3/4) ... [2020-10-26 05:46:08,447 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 05:46:08,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 05:46:08,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:46:08,508 INFO L168 Benchmark]: Toolchain (without parser) took 7692.69 ms. Allocated memory was 39.8 MB in the beginning and 274.7 MB in the end (delta: 234.9 MB). Free memory was 15.5 MB in the beginning and 210.4 MB in the end (delta: -194.9 MB). Peak memory consumption was 41.7 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,509 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 39.8 MB. Free memory was 25.0 MB in the beginning and 25.0 MB in the end (delta: 21.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:46:08,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.83 ms. Allocated memory is still 50.3 MB. Free memory was 34.4 MB in the beginning and 31.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.74 ms. Allocated memory is still 50.3 MB. Free memory was 31.8 MB in the beginning and 28.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,510 INFO L168 Benchmark]: Boogie Preprocessor took 102.90 ms. Allocated memory is still 50.3 MB. Free memory was 28.9 MB in the beginning and 26.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,511 INFO L168 Benchmark]: RCFGBuilder took 1034.81 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.7 MB in the beginning and 27.3 MB in the end (delta: -674.1 kB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,512 INFO L168 Benchmark]: BuchiAutomizer took 5931.53 ms. Allocated memory was 60.8 MB in the beginning and 274.7 MB in the end (delta: 213.9 MB). Free memory was 27.3 MB in the beginning and 212.5 MB in the end (delta: -185.1 MB). Peak memory consumption was 130.8 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,513 INFO L168 Benchmark]: Witness Printer took 66.50 ms. Allocated memory is still 274.7 MB. Free memory was 212.5 MB in the beginning and 210.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:08,516 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.19 ms. Allocated memory is still 39.8 MB. Free memory was 25.0 MB in the beginning and 25.0 MB in the end (delta: 21.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 405.83 ms. Allocated memory is still 50.3 MB. Free memory was 34.4 MB in the beginning and 31.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 124.74 ms. Allocated memory is still 50.3 MB. Free memory was 31.8 MB in the beginning and 28.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 102.90 ms. Allocated memory is still 50.3 MB. Free memory was 28.9 MB in the beginning and 26.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1034.81 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.7 MB in the beginning and 27.3 MB in the end (delta: -674.1 kB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5931.53 ms. Allocated memory was 60.8 MB in the beginning and 274.7 MB in the end (delta: 213.9 MB). Free memory was 27.3 MB in the beginning and 212.5 MB in the end (delta: -185.1 MB). Peak memory consumption was 130.8 MB. Max. memory is 16.1 GB. * Witness Printer took 66.50 ms. Allocated memory is still 274.7 MB. Free memory was 212.5 MB in the beginning and 210.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 6270 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2456 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 6270 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2679 SDtfs, 3795 SDslu, 3297 SDs, 0 SdLazy, 276 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN1 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 349]: 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 {count=0, NULL=0, \result=0, P_1_pc=0, NULL=1, C_1_i=1, tmp=0, C_1_st=0, data_0=0, kernel_st=1, tmp___2=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60703a36=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ea04dfd=0, NULL=0, NULL=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, clk=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@292ba01a=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ef3b392=0, tmp___0=0, num=0, NULL=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f8cc9ed=0, NULL=3, \result=0, __retres1=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=8, NULL=5, NULL=0, tmp=0, NULL=4, C_1_pr=0, P_1_st=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49c4361=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d95391c=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c87ec8c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d0132a4=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 349]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int max_loop ; [L18] int clk ; [L19] int num ; [L20] int i ; [L21] int e ; [L22] int timer ; [L23] char data_0 ; [L24] char data_1 ; [L67] int P_1_pc; [L68] int P_1_st ; [L69] int P_1_i ; [L70] int P_1_ev ; [L125] int P_2_pc ; [L126] int P_2_st ; [L127] int P_2_i ; [L128] int P_2_ev ; [L193] int C_1_pc ; [L194] int C_1_st ; [L195] int C_1_i ; [L196] int C_1_ev ; [L197] int C_1_pr ; [L609] int count ; [L610] int __retres2 ; [L614] num = 0 [L615] i = 0 [L616] clk = 0 [L617] max_loop = 8 [L619] timer = 0 [L620] P_1_pc = 0 [L621] P_2_pc = 0 [L622] C_1_pc = 0 [L624] count = 0 [L601] P_1_i = 1 [L602] P_2_i = 1 [L603] C_1_i = 1 [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] kernel_st = 0 [L297] COND TRUE (int )P_1_i == 1 [L298] P_1_st = 0 [L302] COND TRUE (int )P_2_i == 1 [L303] P_2_st = 0 [L307] COND TRUE (int )C_1_i == 1 [L308] C_1_st = 0 [L475] int tmp ; [L476] int tmp___0 ; [L477] int tmp___1 ; [L107] int __retres1 ; [L110] COND FALSE !((int )P_1_pc == 1) [L120] __retres1 = 0 [L122] return (__retres1); [L481] tmp = is_P_1_triggered() [L483] COND FALSE !(\read(tmp)) [L175] int __retres1 ; [L178] COND FALSE !((int )P_2_pc == 1) [L188] __retres1 = 0 [L190] return (__retres1); [L489] tmp___0 = is_P_2_triggered() [L491] COND FALSE !(\read(tmp___0)) [L257] int __retres1 ; [L260] COND FALSE !((int )C_1_pc == 1) [L270] COND FALSE !((int )C_1_pc == 2) [L280] __retres1 = 0 [L282] return (__retres1); [L497] tmp___1 = is_C_1_triggered() [L499] COND FALSE !(\read(tmp___1)) [L553] COND TRUE 1 [L556] kernel_st = 1 [L342] int tmp ; [L343] int tmp___0 ; [L344] int tmp___1 ; [L345] int tmp___2 ; Loop: [L349] COND TRUE 1 [L317] int __retres1 ; [L320] COND TRUE (int )P_1_st == 0 [L321] __retres1 = 1 [L338] return (__retres1); [L352] tmp___2 = exists_runnable_thread() [L354] COND TRUE \read(tmp___2) [L359] COND TRUE (int )P_1_st == 0 [L361] tmp = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp)) [L374] COND TRUE (int )P_2_st == 0 [L376] tmp___0 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___0)) [L389] COND TRUE (int )C_1_st == 0 [L391] tmp___1 = __VERIFIER_nondet_int() [L393] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...