./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/kundu1.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/kundu1.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 296e273b1c19d017b7d3722a7c74d29ba546c812 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46:00,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:46:00,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:46:00,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:46:00,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:46:00,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:46:00,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:46:00,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:46:00,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:46:00,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:46:00,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:46:00,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:46:00,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:46:00,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:46:00,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:46:00,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:46:00,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:46:00,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:46:00,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:46:00,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:46:00,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:46:00,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:46:00,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:46:00,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:46:00,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:46:00,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:46:00,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:46:00,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:46:00,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:46:00,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:46:00,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:46:00,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:46:00,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:46:00,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:46:00,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:46:00,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:46:00,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:46:00,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:46:00,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:46:00,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:46:00,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:46:00,278 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:46:00,334 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:46:00,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:46:00,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:46:00,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:46:00,339 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:46:00,339 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:46:00,339 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:46:00,340 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:46:00,340 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:46:00,340 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:46:00,341 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:46:00,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:46:00,342 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:46:00,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:46:00,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:46:00,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:46:00,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:46:00,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:46:00,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:46:00,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:46:00,345 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:46:00,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:46:00,345 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:46:00,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:46:00,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:46:00,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:46:00,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:46:00,347 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:46:00,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:46:00,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:46:00,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:46:00,348 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:46:00,349 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:46:00,350 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 -> 296e273b1c19d017b7d3722a7c74d29ba546c812 [2020-10-26 05:46:00,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:46:00,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:46:00,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:46:00,808 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:46:00,811 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:46:00,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2020-10-26 05:46:00,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e2741cf/07b9fb77e20849de9f150a9913c8c70b/FLAG986d37a11 [2020-10-26 05:46:01,615 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:46:01,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2020-10-26 05:46:01,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e2741cf/07b9fb77e20849de9f150a9913c8c70b/FLAG986d37a11 [2020-10-26 05:46:01,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e2741cf/07b9fb77e20849de9f150a9913c8c70b [2020-10-26 05:46:01,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:46:01,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:46:01,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:46:01,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:46:02,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:46:02,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:02,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44552978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:02, skipping insertion in model container [2020-10-26 05:46:02,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:46:01" (1/1) ... [2020-10-26 05:46:02,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:46:02,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:46:02,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:46:02,356 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:46:02,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:46:02,448 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:46:02,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:02 WrapperNode [2020-10-26 05:46:02,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:46:02,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:46:02,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:46:02,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:46:02,459 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:02" (1/1) ... [2020-10-26 05:46:02,469 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:02" (1/1) ... [2020-10-26 05:46:02,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:46:02,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:46:02,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:46:02,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:46:02,513 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:02" (1/1) ... [2020-10-26 05:46:02,513 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:02" (1/1) ... [2020-10-26 05:46:02,516 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:02" (1/1) ... [2020-10-26 05:46:02,516 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:02" (1/1) ... [2020-10-26 05:46:02,531 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:02" (1/1) ... [2020-10-26 05:46:02,552 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:02" (1/1) ... [2020-10-26 05:46:02,558 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:02" (1/1) ... [2020-10-26 05:46:02,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:46:02,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:46:02,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:46:02,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:46:02,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:02" (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:02,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:46:02,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:46:02,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:46:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:46:03,544 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:46:03,544 INFO L298 CfgBuilder]: Removed 78 assume(true) statements. [2020-10-26 05:46:03,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:03 BoogieIcfgContainer [2020-10-26 05:46:03,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:46:03,548 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:46:03,548 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:46:03,553 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:46:03,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:03,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:46:01" (1/3) ... [2020-10-26 05:46:03,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f2741e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:46:03, skipping insertion in model container [2020-10-26 05:46:03,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:03,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:02" (2/3) ... [2020-10-26 05:46:03,556 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f2741e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:46:03, skipping insertion in model container [2020-10-26 05:46:03,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:03,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:03" (3/3) ... [2020-10-26 05:46:03,558 INFO L373 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2020-10-26 05:46:03,619 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:46:03,619 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:46:03,619 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:46:03,619 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:46:03,620 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:46:03,620 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:46:03,620 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:46:03,620 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:46:03,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2020-10-26 05:46:03,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-10-26 05:46:03,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:03,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:03,681 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:03,681 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] [2020-10-26 05:46:03,681 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:46:03,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2020-10-26 05:46:03,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-10-26 05:46:03,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:03,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:03,691 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:03,691 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] [2020-10-26 05:46:03,701 INFO L794 eck$LassoCheckResult]: Stem: 87#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 49#L488true havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 38#L221true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 110#L228-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 114#L233-1true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 14#L109true assume 1 == ~P_1_pc~0; 97#L110true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 15#L120true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 98#L121true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 59#L375true assume !(0 != activate_threads_~tmp~1); 61#L375-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 42#L191true assume 1 == ~C_1_pc~0; 117#L192true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 73#L212true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 46#L213true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 74#L383true assume !(0 != activate_threads_~tmp___1~1); 104#L437-1true [2020-10-26 05:46:03,702 INFO L796 eck$LassoCheckResult]: Loop: 104#L437-1true assume !false; 68#L438true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 5#L296true assume false; 36#L312true start_simulation_~kernel_st~0 := 2; 37#L221-1true start_simulation_~kernel_st~0 := 3; 35#L323true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 8#L109-3true assume !(1 == ~P_1_pc~0); 115#L109-5true is_P_1_triggered_~__retres1~0 := 0; 13#L120-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 96#L121-1true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 43#L375-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 51#L375-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 18#L191-3true assume 1 == ~C_1_pc~0; 116#L192-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 71#L212-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 24#L213-1true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 64#L383-3true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 65#L383-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 48#L246-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 80#L259-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 30#L260-1true start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 118#L456true assume !(0 == start_simulation_~tmp~3); 119#L456-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 25#L246-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 77#L259-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 29#L260-2true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 54#L411true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 101#L418true stop_simulation_#res := stop_simulation_~__retres2~0; 58#L419true start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 40#L469true assume !(0 != start_simulation_~tmp___0~2); 104#L437-1true [2020-10-26 05:46:03,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2020-10-26 05:46:03,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382379867] [2020-10-26 05:46:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,912 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,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382379867] [2020-10-26 05:46:03,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:03,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179756153] [2020-10-26 05:46:03,920 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash 330099143, now seen corresponding path program 1 times [2020-10-26 05:46:03,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:03,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127292044] [2020-10-26 05:46:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:03,940 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,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127292044] [2020-10-26 05:46:03,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:03,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:03,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846534449] [2020-10-26 05:46:03,943 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:03,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:03,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:03,965 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2020-10-26 05:46:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:03,996 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2020-10-26 05:46:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:04,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2020-10-26 05:46:04,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2020-10-26 05:46:04,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2020-10-26 05:46:04,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2020-10-26 05:46:04,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2020-10-26 05:46:04,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2020-10-26 05:46:04,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,023 INFO L691 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2020-10-26 05:46:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2020-10-26 05:46:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-26 05:46:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-26 05:46:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2020-10-26 05:46:04,063 INFO L714 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2020-10-26 05:46:04,063 INFO L594 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2020-10-26 05:46:04,063 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:46:04,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2020-10-26 05:46:04,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2020-10-26 05:46:04,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:04,067 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:04,067 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] [2020-10-26 05:46:04,068 INFO L794 eck$LassoCheckResult]: Stem: 338#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 250#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 251#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 304#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 305#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 344#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 262#L109 assume 1 == ~P_1_pc~0; 263#L110 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 256#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 264#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 330#L375 assume !(0 != activate_threads_~tmp~1); 331#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 309#L191 assume 1 == ~C_1_pc~0; 310#L192 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 313#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 314#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 315#L383 assume !(0 != activate_threads_~tmp___1~1); 308#L437-1 [2020-10-26 05:46:04,068 INFO L796 eck$LassoCheckResult]: Loop: 308#L437-1 assume !false; 334#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 245#L296 assume !false; 246#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 319#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 320#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 296#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 297#L276 assume !(0 != eval_~tmp___2~0); 302#L312 start_simulation_~kernel_st~0 := 2; 303#L221-1 start_simulation_~kernel_st~0 := 3; 301#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 252#L109-3 assume 1 == ~P_1_pc~0; 253#L110-1 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 260#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 261#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 311#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 312#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 268#L191-3 assume 1 == ~C_1_pc~0; 269#L192-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 281#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 282#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 283#L383-3 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 333#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 316#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 317#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 292#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 293#L456 assume !(0 == start_simulation_~tmp~3); 342#L456-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 284#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 285#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 290#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 291#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 324#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 329#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 307#L469 assume !(0 != start_simulation_~tmp___0~2); 308#L437-1 [2020-10-26 05:46:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2020-10-26 05:46:04,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890320339] [2020-10-26 05:46:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,133 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,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890320339] [2020-10-26 05:46:04,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:04,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169875946] [2020-10-26 05:46:04,135 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1962119694, now seen corresponding path program 1 times [2020-10-26 05:46:04,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204499868] [2020-10-26 05:46:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,212 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,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204499868] [2020-10-26 05:46:04,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:04,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210885729] [2020-10-26 05:46:04,214 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:04,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:04,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:04,218 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. cyclomatic complexity: 51 Second operand 3 states. [2020-10-26 05:46:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:04,303 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2020-10-26 05:46:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:04,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 270 transitions. [2020-10-26 05:46:04,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2020-10-26 05:46:04,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 187 states and 270 transitions. [2020-10-26 05:46:04,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2020-10-26 05:46:04,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2020-10-26 05:46:04,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 270 transitions. [2020-10-26 05:46:04,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,313 INFO L691 BuchiCegarLoop]: Abstraction has 187 states and 270 transitions. [2020-10-26 05:46:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 270 transitions. [2020-10-26 05:46:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2020-10-26 05:46:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-26 05:46:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2020-10-26 05:46:04,326 INFO L714 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2020-10-26 05:46:04,326 INFO L594 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2020-10-26 05:46:04,327 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:46:04,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 265 transitions. [2020-10-26 05:46:04,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 163 [2020-10-26 05:46:04,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:04,344 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:04,344 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] [2020-10-26 05:46:04,345 INFO L794 eck$LassoCheckResult]: Stem: 640#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 552#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 553#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 604#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 605#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 650#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 563#L109 assume !(1 == ~P_1_pc~0); 556#L109-2 is_P_1_triggered_~__retres1~0 := 0; 557#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 564#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 632#L375 assume !(0 != activate_threads_~tmp~1); 633#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 609#L191 assume 1 == ~C_1_pc~0; 610#L192 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 613#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 614#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 615#L383 assume !(0 != activate_threads_~tmp___1~1); 637#L437-1 [2020-10-26 05:46:04,345 INFO L796 eck$LassoCheckResult]: Loop: 637#L437-1 assume !false; 635#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 547#L296 assume !false; 548#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 619#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 620#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 596#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 597#L276 assume !(0 != eval_~tmp___2~0); 602#L312 start_simulation_~kernel_st~0 := 2; 603#L221-1 start_simulation_~kernel_st~0 := 3; 601#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 554#L109-3 assume !(1 == ~P_1_pc~0); 555#L109-5 is_P_1_triggered_~__retres1~0 := 0; 695#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 694#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 693#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 692#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 689#L191-3 assume 1 == ~C_1_pc~0; 680#L192-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 676#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 674#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 671#L383-3 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 669#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 667#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 663#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 660#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 656#L456 assume !(0 == start_simulation_~tmp~3); 657#L456-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 709#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 707#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 706#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 705#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 704#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 703#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 702#L469 assume !(0 != start_simulation_~tmp___0~2); 637#L437-1 [2020-10-26 05:46:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2020-10-26 05:46:04,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372649317] [2020-10-26 05:46:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,410 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,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372649317] [2020-10-26 05:46:04,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 05:46:04,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142566293] [2020-10-26 05:46:04,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 742452625, now seen corresponding path program 1 times [2020-10-26 05:46:04,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838620244] [2020-10-26 05:46:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,461 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,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838620244] [2020-10-26 05:46:04,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:04,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297323742] [2020-10-26 05:46:04,463 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:04,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 05:46:04,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 05:46:04,465 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. cyclomatic complexity: 83 Second operand 4 states. [2020-10-26 05:46:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:04,651 INFO L93 Difference]: Finished difference Result 409 states and 574 transitions. [2020-10-26 05:46:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 05:46:04,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 574 transitions. [2020-10-26 05:46:04,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 378 [2020-10-26 05:46:04,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 574 transitions. [2020-10-26 05:46:04,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2020-10-26 05:46:04,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2020-10-26 05:46:04,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 574 transitions. [2020-10-26 05:46:04,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,666 INFO L691 BuchiCegarLoop]: Abstraction has 409 states and 574 transitions. [2020-10-26 05:46:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 574 transitions. [2020-10-26 05:46:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 315. [2020-10-26 05:46:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-26 05:46:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 448 transitions. [2020-10-26 05:46:04,690 INFO L714 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2020-10-26 05:46:04,690 INFO L594 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2020-10-26 05:46:04,691 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:46:04,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 448 transitions. [2020-10-26 05:46:04,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 296 [2020-10-26 05:46:04,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:04,695 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:04,695 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:04,695 INFO L794 eck$LassoCheckResult]: Stem: 1242#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1157#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1158#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 1207#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1208#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1256#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 1168#L109 assume !(1 == ~P_1_pc~0); 1161#L109-2 is_P_1_triggered_~__retres1~0 := 0; 1162#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1169#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1234#L375 assume !(0 != activate_threads_~tmp~1); 1235#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1212#L191 assume !(1 == ~C_1_pc~0); 1174#L191-2 assume !(2 == ~C_1_pc~0); 1175#L201-1 is_C_1_triggered_~__retres1~1 := 0; 1215#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1219#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1220#L383 assume !(0 != activate_threads_~tmp___1~1); 1211#L437-1 [2020-10-26 05:46:04,695 INFO L796 eck$LassoCheckResult]: Loop: 1211#L437-1 assume !false; 1237#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 1152#L296 assume !false; 1153#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1221#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1222#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1199#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1200#L276 assume !(0 != eval_~tmp___2~0); 1205#L312 start_simulation_~kernel_st~0 := 2; 1206#L221-1 start_simulation_~kernel_st~0 := 3; 1204#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 1159#L109-3 assume !(1 == ~P_1_pc~0); 1160#L109-5 is_P_1_triggered_~__retres1~0 := 0; 1166#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1167#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1213#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1214#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1173#L191-3 assume !(1 == ~C_1_pc~0); 1170#L191-5 assume 2 == ~C_1_pc~0; 1171#L202-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 1184#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1188#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1189#L383-3 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1236#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1216#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1217#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1196#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1197#L456 assume !(0 == start_simulation_~tmp~3); 1254#L456-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1185#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1186#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1194#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 1195#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1227#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 1232#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1210#L469 assume !(0 != start_simulation_~tmp___0~2); 1211#L437-1 [2020-10-26 05:46:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2020-10-26 05:46:04,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141994102] [2020-10-26 05:46:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:04,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:04,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:04,765 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1973795747, now seen corresponding path program 1 times [2020-10-26 05:46:04,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:04,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69631825] [2020-10-26 05:46:04,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:04,806 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,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69631825] [2020-10-26 05:46:04,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:04,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:04,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542021327] [2020-10-26 05:46:04,808 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:04,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:46:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:46:04,809 INFO L87 Difference]: Start difference. First operand 315 states and 448 transitions. cyclomatic complexity: 134 Second operand 5 states. [2020-10-26 05:46:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:04,917 INFO L93 Difference]: Finished difference Result 549 states and 768 transitions. [2020-10-26 05:46:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 05:46:04,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 768 transitions. [2020-10-26 05:46:04,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 530 [2020-10-26 05:46:04,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 549 states and 768 transitions. [2020-10-26 05:46:04,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 549 [2020-10-26 05:46:04,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 549 [2020-10-26 05:46:04,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 768 transitions. [2020-10-26 05:46:04,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:04,944 INFO L691 BuchiCegarLoop]: Abstraction has 549 states and 768 transitions. [2020-10-26 05:46:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 768 transitions. [2020-10-26 05:46:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 327. [2020-10-26 05:46:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-10-26 05:46:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 460 transitions. [2020-10-26 05:46:04,991 INFO L714 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2020-10-26 05:46:04,991 INFO L594 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2020-10-26 05:46:04,991 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:46:04,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 460 transitions. [2020-10-26 05:46:04,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2020-10-26 05:46:04,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:04,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:05,003 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:05,003 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] [2020-10-26 05:46:05,003 INFO L794 eck$LassoCheckResult]: Stem: 2144#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2037#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 2038#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 2092#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2093#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2166#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 2048#L109 assume !(1 == ~P_1_pc~0); 2041#L109-2 is_P_1_triggered_~__retres1~0 := 0; 2042#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2049#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2121#L375 assume !(0 != activate_threads_~tmp~1); 2122#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2098#L191 assume !(1 == ~C_1_pc~0); 2055#L191-2 assume !(2 == ~C_1_pc~0); 2056#L201-1 is_C_1_triggered_~__retres1~1 := 0; 2101#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2102#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2103#L383 assume !(0 != activate_threads_~tmp___1~1); 2138#L437-1 [2020-10-26 05:46:05,004 INFO L796 eck$LassoCheckResult]: Loop: 2138#L437-1 assume !false; 2292#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 2136#L296 assume !false; 2262#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2260#L246 assume !(0 == ~P_1_st~0); 2255#L250 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2253#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2206#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2190#L276 assume !(0 != eval_~tmp___2~0); 2191#L312 start_simulation_~kernel_st~0 := 2; 2182#L221-1 start_simulation_~kernel_st~0 := 3; 2183#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 2039#L109-3 assume !(1 == ~P_1_pc~0); 2040#L109-5 is_P_1_triggered_~__retres1~0 := 0; 2046#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2047#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2099#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2100#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2053#L191-3 assume !(1 == ~C_1_pc~0); 2054#L191-5 assume 2 == ~C_1_pc~0; 2065#L202-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 2066#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2137#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2127#L383-3 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2128#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2129#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2347#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2079#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2080#L456 assume !(0 == start_simulation_~tmp~3); 2161#L456-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2171#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2334#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2309#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 2307#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2295#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 2294#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2293#L469 assume !(0 != start_simulation_~tmp___0~2); 2138#L437-1 [2020-10-26 05:46:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2020-10-26 05:46:05,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464738050] [2020-10-26 05:46:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,083 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1259139019, now seen corresponding path program 1 times [2020-10-26 05:46:05,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344457597] [2020-10-26 05:46:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,208 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,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344457597] [2020-10-26 05:46:05,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:05,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477094808] [2020-10-26 05:46:05,209 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:05,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:46:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:46:05,210 INFO L87 Difference]: Start difference. First operand 327 states and 460 transitions. cyclomatic complexity: 134 Second operand 5 states. [2020-10-26 05:46:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,312 INFO L93 Difference]: Finished difference Result 723 states and 1015 transitions. [2020-10-26 05:46:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:46:05,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 723 states and 1015 transitions. [2020-10-26 05:46:05,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 704 [2020-10-26 05:46:05,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 723 states to 723 states and 1015 transitions. [2020-10-26 05:46:05,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 723 [2020-10-26 05:46:05,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 723 [2020-10-26 05:46:05,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 723 states and 1015 transitions. [2020-10-26 05:46:05,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,336 INFO L691 BuchiCegarLoop]: Abstraction has 723 states and 1015 transitions. [2020-10-26 05:46:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states and 1015 transitions. [2020-10-26 05:46:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 339. [2020-10-26 05:46:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-10-26 05:46:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 467 transitions. [2020-10-26 05:46:05,351 INFO L714 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2020-10-26 05:46:05,351 INFO L594 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2020-10-26 05:46:05,351 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 05:46:05,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 467 transitions. [2020-10-26 05:46:05,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2020-10-26 05:46:05,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:05,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:05,355 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:05,355 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] [2020-10-26 05:46:05,355 INFO L794 eck$LassoCheckResult]: Stem: 3191#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3100#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3101#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 3154#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3155#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3213#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3111#L109 assume !(1 == ~P_1_pc~0); 3104#L109-2 is_P_1_triggered_~__retres1~0 := 0; 3105#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3112#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3180#L375 assume !(0 != activate_threads_~tmp~1); 3181#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3160#L191 assume !(1 == ~C_1_pc~0); 3117#L191-2 assume !(2 == ~C_1_pc~0); 3118#L201-1 is_C_1_triggered_~__retres1~1 := 0; 3163#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3164#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3165#L383 assume !(0 != activate_threads_~tmp___1~1); 3186#L437-1 [2020-10-26 05:46:05,356 INFO L796 eck$LassoCheckResult]: Loop: 3186#L437-1 assume !false; 3311#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 3303#L296 assume !false; 3300#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3298#L246 assume !(0 == ~P_1_st~0); 3294#L250 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3284#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3279#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 3274#L276 assume !(0 != eval_~tmp___2~0); 3271#L312 start_simulation_~kernel_st~0 := 2; 3267#L221-1 start_simulation_~kernel_st~0 := 3; 3264#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3102#L109-3 assume !(1 == ~P_1_pc~0); 3103#L109-5 is_P_1_triggered_~__retres1~0 := 0; 3308#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3307#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3306#L375-3 assume !(0 != activate_threads_~tmp~1); 3305#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3304#L191-3 assume !(1 == ~C_1_pc~0); 3258#L191-5 assume 2 == ~C_1_pc~0; 3127#L202-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 3128#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3130#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3131#L383-3 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3183#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3166#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3167#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3141#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 3142#L456 assume !(0 == start_simulation_~tmp~3); 3219#L456-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3320#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3318#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3317#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 3316#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3315#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 3314#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 3313#L469 assume !(0 != start_simulation_~tmp___0~2); 3186#L437-1 [2020-10-26 05:46:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2020-10-26 05:46:05,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012893484] [2020-10-26 05:46:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,425 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash -836437193, now seen corresponding path program 1 times [2020-10-26 05:46:05,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452046450] [2020-10-26 05:46:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,475 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,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452046450] [2020-10-26 05:46:05,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:05,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97375033] [2020-10-26 05:46:05,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:05,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:05,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:05,483 INFO L87 Difference]: Start difference. First operand 339 states and 467 transitions. cyclomatic complexity: 129 Second operand 3 states. [2020-10-26 05:46:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,535 INFO L93 Difference]: Finished difference Result 493 states and 667 transitions. [2020-10-26 05:46:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:05,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 667 transitions. [2020-10-26 05:46:05,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2020-10-26 05:46:05,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 493 states and 667 transitions. [2020-10-26 05:46:05,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2020-10-26 05:46:05,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 493 [2020-10-26 05:46:05,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 667 transitions. [2020-10-26 05:46:05,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,547 INFO L691 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2020-10-26 05:46:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 667 transitions. [2020-10-26 05:46:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2020-10-26 05:46:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-26 05:46:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 667 transitions. [2020-10-26 05:46:05,558 INFO L714 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2020-10-26 05:46:05,559 INFO L594 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2020-10-26 05:46:05,559 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 05:46:05,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states and 667 transitions. [2020-10-26 05:46:05,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2020-10-26 05:46:05,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:05,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:05,563 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] [2020-10-26 05:46:05,564 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:05,564 INFO L794 eck$LassoCheckResult]: Stem: 4029#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3938#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3939#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 3988#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3989#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4049#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3949#L109 assume !(1 == ~P_1_pc~0); 3942#L109-2 is_P_1_triggered_~__retres1~0 := 0; 3943#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3950#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4013#L375 assume !(0 != activate_threads_~tmp~1); 4014#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3994#L191 assume !(1 == ~C_1_pc~0); 3955#L191-2 assume !(2 == ~C_1_pc~0); 3956#L201-1 is_C_1_triggered_~__retres1~1 := 0; 3997#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3998#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3999#L383 assume !(0 != activate_threads_~tmp___1~1); 4021#L437-1 assume !false; 4139#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 4129#L296 [2020-10-26 05:46:05,564 INFO L796 eck$LassoCheckResult]: Loop: 4129#L296 assume !false; 4127#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4125#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 4112#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4107#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 4108#L276 assume 0 != eval_~tmp___2~0; 4088#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 4089#L285 assume !(0 != eval_~tmp~0); 4137#L281 assume !(0 == ~C_1_st~0); 4129#L296 [2020-10-26 05:46:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2020-10-26 05:46:05,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062052866] [2020-10-26 05:46:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,594 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1487904259, now seen corresponding path program 1 times [2020-10-26 05:46:05,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66087932] [2020-10-26 05:46:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,600 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 L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,606 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 489258557, now seen corresponding path program 1 times [2020-10-26 05:46:05,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607899015] [2020-10-26 05:46:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,659 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,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607899015] [2020-10-26 05:46:05,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:05,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405907787] [2020-10-26 05:46:05,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:05,741 INFO L87 Difference]: Start difference. First operand 493 states and 667 transitions. cyclomatic complexity: 177 Second operand 3 states. [2020-10-26 05:46:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,796 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2020-10-26 05:46:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:05,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 801 states and 1061 transitions. [2020-10-26 05:46:05,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2020-10-26 05:46:05,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 801 states to 801 states and 1061 transitions. [2020-10-26 05:46:05,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 801 [2020-10-26 05:46:05,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2020-10-26 05:46:05,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 801 states and 1061 transitions. [2020-10-26 05:46:05,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,815 INFO L691 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2020-10-26 05:46:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states and 1061 transitions. [2020-10-26 05:46:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2020-10-26 05:46:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-10-26 05:46:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1061 transitions. [2020-10-26 05:46:05,833 INFO L714 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2020-10-26 05:46:05,833 INFO L594 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2020-10-26 05:46:05,833 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 05:46:05,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 1061 transitions. [2020-10-26 05:46:05,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2020-10-26 05:46:05,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:05,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:05,840 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] [2020-10-26 05:46:05,840 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:05,840 INFO L794 eck$LassoCheckResult]: Stem: 5347#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5240#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 5241#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 5296#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5297#L228-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 5370#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 5251#L109 assume !(1 == ~P_1_pc~0); 5244#L109-2 is_P_1_triggered_~__retres1~0 := 0; 5245#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5252#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5325#L375 assume !(0 != activate_threads_~tmp~1); 5326#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5860#L191 assume !(1 == ~C_1_pc~0); 5858#L191-2 assume !(2 == ~C_1_pc~0); 5856#L201-1 is_C_1_triggered_~__retres1~1 := 0; 5854#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5852#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5850#L383 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5338#L437-1 assume !false; 5980#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 5839#L296 [2020-10-26 05:46:05,841 INFO L796 eck$LassoCheckResult]: Loop: 5839#L296 assume !false; 5979#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5977#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5974#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5972#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 5970#L276 assume 0 != eval_~tmp___2~0; 5969#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 5229#L285 assume !(0 != eval_~tmp~0); 5231#L281 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 5796#L300 assume !(0 != eval_~tmp___1~0); 5839#L296 [2020-10-26 05:46:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,841 INFO L82 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2020-10-26 05:46:05,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825989778] [2020-10-26 05:46:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:05,861 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,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825989778] [2020-10-26 05:46:05,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:05,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:05,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709550354] [2020-10-26 05:46:05,863 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:05,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1119610449, now seen corresponding path program 1 times [2020-10-26 05:46:05,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:05,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714463872] [2020-10-26 05:46:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:05,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:05,879 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:05,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:05,955 INFO L87 Difference]: Start difference. First operand 801 states and 1061 transitions. cyclomatic complexity: 263 Second operand 3 states. [2020-10-26 05:46:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:05,979 INFO L93 Difference]: Finished difference Result 785 states and 1041 transitions. [2020-10-26 05:46:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:05,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1041 transitions. [2020-10-26 05:46:05,987 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2020-10-26 05:46:05,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1041 transitions. [2020-10-26 05:46:05,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 785 [2020-10-26 05:46:05,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 785 [2020-10-26 05:46:05,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1041 transitions. [2020-10-26 05:46:05,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:05,999 INFO L691 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2020-10-26 05:46:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1041 transitions. [2020-10-26 05:46:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2020-10-26 05:46:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-10-26 05:46:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1041 transitions. [2020-10-26 05:46:06,015 INFO L714 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2020-10-26 05:46:06,015 INFO L594 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2020-10-26 05:46:06,016 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 05:46:06,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 785 states and 1041 transitions. [2020-10-26 05:46:06,021 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2020-10-26 05:46:06,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:06,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:06,023 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] [2020-10-26 05:46:06,023 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:06,024 INFO L794 eck$LassoCheckResult]: Stem: 6931#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6832#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 6833#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 6886#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6887#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6948#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 6844#L109 assume !(1 == ~P_1_pc~0); 6838#L109-2 is_P_1_triggered_~__retres1~0 := 0; 6839#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6845#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6912#L375 assume !(0 != activate_threads_~tmp~1); 6913#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6895#L191 assume !(1 == ~C_1_pc~0); 6850#L191-2 assume !(2 == ~C_1_pc~0); 6851#L201-1 is_C_1_triggered_~__retres1~1 := 0; 6896#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6899#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6900#L383 assume !(0 != activate_threads_~tmp___1~1); 6921#L437-1 assume !false; 7433#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 7393#L296 [2020-10-26 05:46:06,024 INFO L796 eck$LassoCheckResult]: Loop: 7393#L296 assume !false; 7428#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7423#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 7419#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7414#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 7408#L276 assume 0 != eval_~tmp___2~0; 7403#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 6821#L285 assume !(0 != eval_~tmp~0); 6823#L281 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 7131#L300 assume !(0 != eval_~tmp___1~0); 7393#L296 [2020-10-26 05:46:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2020-10-26 05:46:06,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918731491] [2020-10-26 05:46:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,081 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1119610449, now seen corresponding path program 2 times [2020-10-26 05:46:06,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340009102] [2020-10-26 05:46:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,104 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2012856139, now seen corresponding path program 1 times [2020-10-26 05:46:06,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:06,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293538163] [2020-10-26 05:46:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:06,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:06,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:06,877 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2020-10-26 05:46:07,121 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-26 05:46:07,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:46:07 BoogieIcfgContainer [2020-10-26 05:46:07,184 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:46:07,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:46:07,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:46:07,187 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:46:07,187 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:03" (3/4) ... [2020-10-26 05:46:07,191 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 05:46:07,280 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 05:46:07,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:46:07,283 INFO L168 Benchmark]: Toolchain (without parser) took 5297.56 ms. Allocated memory was 48.2 MB in the beginning and 107.0 MB in the end (delta: 58.7 MB). Free memory was 25.1 MB in the beginning and 69.8 MB in the end (delta: -44.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,285 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 48.2 MB. Free memory was 31.8 MB in the beginning and 31.8 MB in the end (delta: 40.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:46:07,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.90 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 24.5 MB in the end (delta: -584 B). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.80 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 22.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,286 INFO L168 Benchmark]: Boogie Preprocessor took 65.04 ms. Allocated memory is still 48.2 MB. Free memory was 22.1 MB in the beginning and 20.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,287 INFO L168 Benchmark]: RCFGBuilder took 978.13 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 20.2 MB in the beginning and 28.8 MB in the end (delta: -8.7 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,287 INFO L168 Benchmark]: BuchiAutomizer took 3635.57 ms. Allocated memory was 60.8 MB in the beginning and 107.0 MB in the end (delta: 46.1 MB). Free memory was 28.6 MB in the beginning and 71.8 MB in the end (delta: -43.2 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,287 INFO L168 Benchmark]: Witness Printer took 94.46 ms. Allocated memory is still 107.0 MB. Free memory was 71.8 MB in the beginning and 69.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:07,293 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.21 ms. Allocated memory is still 48.2 MB. Free memory was 31.8 MB in the beginning and 31.8 MB in the end (delta: 40.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 451.90 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 24.5 MB in the end (delta: -584 B). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.80 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 22.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.04 ms. Allocated memory is still 48.2 MB. Free memory was 22.1 MB in the beginning and 20.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 978.13 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 20.2 MB in the beginning and 28.8 MB in the end (delta: -8.7 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3635.57 ms. Allocated memory was 60.8 MB in the beginning and 107.0 MB in the end (delta: 46.1 MB). Free memory was 28.6 MB in the beginning and 71.8 MB in the end (delta: -43.2 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * Witness Printer took 94.46 ms. Allocated memory is still 107.0 MB. Free memory was 71.8 MB in the beginning and 69.8 MB in the end (delta: 2.0 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 785 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 704 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 801 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1201 SDtfs, 1659 SDslu, 1640 SDs, 0 SdLazy, 174 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 271]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=2246} State at position 1 is {count=0, NULL=0, \result=0, P_1_pc=0, NULL=2246, 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@24b3a143=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ddd3cc5=0, NULL=0, NULL=0, \result=0, i=0, P_1_i=1, e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20281a3c=0, __retres1=0, tmp___0=0, num=0, NULL=0, P_1_ev=0, tmp=0, C_1_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22be589c=0, NULL=2249, \result=0, __retres1=0, tmp___0=0, tmp___1=0, data_1=0, __retres1=1, max_loop=2, NULL=2248, NULL=0, tmp=0, NULL=2247, C_1_pr=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@182b86f6=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e535b29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c0b5849=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 271]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; [L109] COND FALSE !((int )P_1_pc == 1) [L119] __retres1 = 0 [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) [L188] int __retres1 ; [L191] COND FALSE !((int )C_1_pc == 1) [L201] COND FALSE !((int )C_1_pc == 2) [L211] __retres1 = 0 [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) [L437] COND TRUE 1 [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; Loop: [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...