./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:19,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:19,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:19,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:19,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:19,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:19,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:19,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:19,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:19,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:19,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:19,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:19,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:19,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:19,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:19,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:19,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:19,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:19,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:19,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:19,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:19,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:19,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:19,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:19,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:19,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:19,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:19,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:19,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:19,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:19,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:19,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:19,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:19,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:19,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:19,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:19,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:19,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:19,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:19,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:19,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:19,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:58:19,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:19,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:19,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:19,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:19,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:19,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:19,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:19,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:19,175 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:19,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:19,176 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:19,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:19,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:19,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:19,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:19,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:19,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:19,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:19,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:19,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:19,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:19,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:19,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:19,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:19,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:19,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:19,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:19,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 [2022-02-20 19:58:19,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:19,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:19,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:19,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:19,398 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:19,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2022-02-20 19:58:19,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a501be3e9/1c12fb8505ce48c5834696b7ed98c627/FLAG4301b5b71 [2022-02-20 19:58:19,884 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:19,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2022-02-20 19:58:19,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a501be3e9/1c12fb8505ce48c5834696b7ed98c627/FLAG4301b5b71 [2022-02-20 19:58:19,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a501be3e9/1c12fb8505ce48c5834696b7ed98c627 [2022-02-20 19:58:19,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:19,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:19,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:19,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:19,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:19,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:19" (1/1) ... [2022-02-20 19:58:19,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c66fdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:19, skipping insertion in model container [2022-02-20 19:58:19,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:19" (1/1) ... [2022-02-20 19:58:19,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:19,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:20,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c[914,927] [2022-02-20 19:58:20,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c[7115,7128] [2022-02-20 19:58:20,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:20,221 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:20,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c[914,927] [2022-02-20 19:58:20,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c[7115,7128] [2022-02-20 19:58:20,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:20,303 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:20,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20 WrapperNode [2022-02-20 19:58:20,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:20,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:20,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:20,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:20,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,398 INFO L137 Inliner]: procedures = 79, calls = 96, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1098 [2022-02-20 19:58:20,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:20,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:20,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:20,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:20,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:20,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:20,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:20,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:20,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (1/1) ... [2022-02-20 19:58:20,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:20,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:20,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:58:20,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:58:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:20,554 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:20,554 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:20,558 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:20,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:20,558 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:20,714 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:20,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:21,418 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:21,429 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:21,430 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-02-20 19:58:21,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:21 BoogieIcfgContainer [2022-02-20 19:58:21,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:21,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:21,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:21,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:21,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:19" (1/3) ... [2022-02-20 19:58:21,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b9b4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:21, skipping insertion in model container [2022-02-20 19:58:21,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:20" (2/3) ... [2022-02-20 19:58:21,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b9b4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:21, skipping insertion in model container [2022-02-20 19:58:21,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:21" (3/3) ... [2022-02-20 19:58:21,438 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2022-02-20 19:58:21,442 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:21,442 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:21,492 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:21,498 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:58:21,498 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 508 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 456 states have internal predecessors, (740), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 19:58:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:21,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:21,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:21,606 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1788781248, now seen corresponding path program 1 times [2022-02-20 19:58:21,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:21,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471724057] [2022-02-20 19:58:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:21,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:21,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {513#(= ~q_read_ev~0 2)} #1996#return; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {554#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:21,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {554#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:21,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(= |old(~q_read_ev~0)| 0)} assume true; {554#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:21,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(= |old(~q_read_ev~0)| 0)} {513#(= ~q_read_ev~0 2)} #1998#return; {512#false} is VALID [2022-02-20 19:58:21,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#true} havoc ~__retres1~0; {511#true} is VALID [2022-02-20 19:58:21,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume 1 == ~p_dw_pc~0; {511#true} is VALID [2022-02-20 19:58:21,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {511#true} is VALID [2022-02-20 19:58:21,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} #res := ~__retres1~0; {511#true} is VALID [2022-02-20 19:58:21,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,926 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {511#true} {511#true} #1992#return; {511#true} is VALID [2022-02-20 19:58:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#true} havoc ~__retres1~1; {511#true} is VALID [2022-02-20 19:58:21,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume 1 == ~c_dr_pc~0; {511#true} is VALID [2022-02-20 19:58:21,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {511#true} is VALID [2022-02-20 19:58:21,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} #res := ~__retres1~1; {511#true} is VALID [2022-02-20 19:58:21,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,933 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {511#true} {511#true} #1994#return; {511#true} is VALID [2022-02-20 19:58:21,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {511#true} is VALID [2022-02-20 19:58:21,934 INFO L272 TraceCheckUtils]: 1: Hoare triple {511#true} call #t~ret8 := is_do_write_p_triggered(); {511#true} is VALID [2022-02-20 19:58:21,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} havoc ~__retres1~0; {511#true} is VALID [2022-02-20 19:58:21,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} assume 1 == ~p_dw_pc~0; {511#true} is VALID [2022-02-20 19:58:21,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {511#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {511#true} is VALID [2022-02-20 19:58:21,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {511#true} #res := ~__retres1~0; {511#true} is VALID [2022-02-20 19:58:21,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,936 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {511#true} {511#true} #1992#return; {511#true} is VALID [2022-02-20 19:58:21,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {511#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {511#true} is VALID [2022-02-20 19:58:21,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {511#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {511#true} is VALID [2022-02-20 19:58:21,937 INFO L272 TraceCheckUtils]: 10: Hoare triple {511#true} call #t~ret9 := is_do_read_c_triggered(); {511#true} is VALID [2022-02-20 19:58:21,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {511#true} havoc ~__retres1~1; {511#true} is VALID [2022-02-20 19:58:21,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#true} assume 1 == ~c_dr_pc~0; {511#true} is VALID [2022-02-20 19:58:21,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {511#true} is VALID [2022-02-20 19:58:21,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#true} #res := ~__retres1~1; {511#true} is VALID [2022-02-20 19:58:21,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,938 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {511#true} {511#true} #1994#return; {511#true} is VALID [2022-02-20 19:58:21,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {511#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {511#true} is VALID [2022-02-20 19:58:21,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {511#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {511#true} is VALID [2022-02-20 19:58:21,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,939 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {511#true} {512#false} #2000#return; {512#false} is VALID [2022-02-20 19:58:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {511#true} is VALID [2022-02-20 19:58:21,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {511#true} is VALID [2022-02-20 19:58:21,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {511#true} {512#false} #2002#return; {512#false} is VALID [2022-02-20 19:58:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:21,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#true} havoc ~__retres1~2; {511#true} is VALID [2022-02-20 19:58:21,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {511#true} is VALID [2022-02-20 19:58:21,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} #res := ~__retres1~2; {511#true} is VALID [2022-02-20 19:58:21,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,960 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {511#true} {512#false} #2004#return; {512#false} is VALID [2022-02-20 19:58:21,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {511#true} is VALID [2022-02-20 19:58:21,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {511#true} is VALID [2022-02-20 19:58:21,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {513#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#(= ~q_read_ev~0 2)} call update_channels1(); {551#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:21,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:21,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:21,966 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {552#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {513#(= ~q_read_ev~0 2)} #1996#return; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {513#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {513#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {513#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:21,968 INFO L272 TraceCheckUtils]: 12: Hoare triple {513#(= ~q_read_ev~0 2)} call fire_delta_events1(); {553#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:21,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {553#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {554#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:21,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {554#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:21,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {554#(= |old(~q_read_ev~0)| 0)} assume true; {554#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:21,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {554#(= |old(~q_read_ev~0)| 0)} {513#(= ~q_read_ev~0 2)} #1998#return; {512#false} is VALID [2022-02-20 19:58:21,970 INFO L272 TraceCheckUtils]: 17: Hoare triple {512#false} call activate_threads1(); {555#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:21,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {555#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {511#true} is VALID [2022-02-20 19:58:21,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {511#true} call #t~ret8 := is_do_write_p_triggered(); {511#true} is VALID [2022-02-20 19:58:21,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {511#true} havoc ~__retres1~0; {511#true} is VALID [2022-02-20 19:58:21,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {511#true} assume 1 == ~p_dw_pc~0; {511#true} is VALID [2022-02-20 19:58:21,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {511#true} is VALID [2022-02-20 19:58:21,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {511#true} #res := ~__retres1~0; {511#true} is VALID [2022-02-20 19:58:21,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,973 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {511#true} {511#true} #1992#return; {511#true} is VALID [2022-02-20 19:58:21,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {511#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {511#true} is VALID [2022-02-20 19:58:21,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {511#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {511#true} is VALID [2022-02-20 19:58:21,974 INFO L272 TraceCheckUtils]: 28: Hoare triple {511#true} call #t~ret9 := is_do_read_c_triggered(); {511#true} is VALID [2022-02-20 19:58:21,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {511#true} havoc ~__retres1~1; {511#true} is VALID [2022-02-20 19:58:21,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {511#true} assume 1 == ~c_dr_pc~0; {511#true} is VALID [2022-02-20 19:58:21,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {511#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {511#true} is VALID [2022-02-20 19:58:21,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {511#true} #res := ~__retres1~1; {511#true} is VALID [2022-02-20 19:58:21,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,975 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {511#true} {511#true} #1994#return; {511#true} is VALID [2022-02-20 19:58:21,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {511#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {511#true} is VALID [2022-02-20 19:58:21,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {511#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {511#true} is VALID [2022-02-20 19:58:21,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,976 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {511#true} {512#false} #2000#return; {512#false} is VALID [2022-02-20 19:58:21,976 INFO L272 TraceCheckUtils]: 39: Hoare triple {512#false} call reset_delta_events1(); {553#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:21,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {553#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {511#true} is VALID [2022-02-20 19:58:21,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {511#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {511#true} is VALID [2022-02-20 19:58:21,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,977 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {511#true} {512#false} #2002#return; {512#false} is VALID [2022-02-20 19:58:21,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 19:58:21,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {512#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {512#false} is VALID [2022-02-20 19:58:21,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 19:58:21,977 INFO L272 TraceCheckUtils]: 47: Hoare triple {512#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {511#true} is VALID [2022-02-20 19:58:21,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {511#true} havoc ~__retres1~2; {511#true} is VALID [2022-02-20 19:58:21,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {511#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {511#true} is VALID [2022-02-20 19:58:21,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {511#true} #res := ~__retres1~2; {511#true} is VALID [2022-02-20 19:58:21,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {511#true} assume true; {511#true} is VALID [2022-02-20 19:58:21,980 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {511#true} {512#false} #2004#return; {512#false} is VALID [2022-02-20 19:58:21,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {512#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {512#false} is VALID [2022-02-20 19:58:21,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {512#false} assume 0 != eval1_~tmp___1~0#1; {512#false} is VALID [2022-02-20 19:58:21,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {512#false} assume !(0 == ~p_dw_st~0); {512#false} is VALID [2022-02-20 19:58:21,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {512#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {512#false} is VALID [2022-02-20 19:58:21,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {512#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {512#false} is VALID [2022-02-20 19:58:21,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {512#false} assume 0 == ~c_dr_pc~0; {512#false} is VALID [2022-02-20 19:58:21,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 19:58:21,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {512#false} assume !(1 == ~q_free~0); {512#false} is VALID [2022-02-20 19:58:21,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {512#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {512#false} is VALID [2022-02-20 19:58:21,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {512#false} assume !(~p_last_write~0 == ~c_last_read~0); {512#false} is VALID [2022-02-20 19:58:21,986 INFO L272 TraceCheckUtils]: 63: Hoare triple {512#false} call error1(); {512#false} is VALID [2022-02-20 19:58:21,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 19:58:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:21,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:21,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471724057] [2022-02-20 19:58:21,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471724057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:21,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:21,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:21,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775954676] [2022-02-20 19:58:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:21,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:21,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:22,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:22,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:22,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:22,072 INFO L87 Difference]: Start difference. First operand has 508 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 456 states have internal predecessors, (740), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:25,602 INFO L93 Difference]: Finished difference Result 1122 states and 1800 transitions. [2022-02-20 19:58:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1800 transitions. [2022-02-20 19:58:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1800 transitions. [2022-02-20 19:58:25,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1800 transitions. [2022-02-20 19:58:26,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1800 edges. 1800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:26,769 INFO L225 Difference]: With dead ends: 1122 [2022-02-20 19:58:26,769 INFO L226 Difference]: Without dead ends: 633 [2022-02-20 19:58:26,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:26,782 INFO L933 BasicCegarLoop]: 781 mSDtfsCounter, 890 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:26,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [895 Valid, 2941 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-02-20 19:58:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 594. [2022-02-20 19:58:26,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:26,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand has 594 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 524 states have internal predecessors, (793), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:26,893 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand has 594 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 524 states have internal predecessors, (793), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:26,895 INFO L87 Difference]: Start difference. First operand 633 states. Second operand has 594 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 524 states have internal predecessors, (793), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:27,004 INFO L93 Difference]: Finished difference Result 633 states and 954 transitions. [2022-02-20 19:58:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 954 transitions. [2022-02-20 19:58:27,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:27,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:27,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 524 states have internal predecessors, (793), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 633 states. [2022-02-20 19:58:27,011 INFO L87 Difference]: Start difference. First operand has 594 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 524 states have internal predecessors, (793), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 633 states. [2022-02-20 19:58:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:27,059 INFO L93 Difference]: Finished difference Result 633 states and 954 transitions. [2022-02-20 19:58:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 954 transitions. [2022-02-20 19:58:27,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:27,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:27,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:27,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 524 states have internal predecessors, (793), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:58:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 900 transitions. [2022-02-20 19:58:27,110 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 900 transitions. Word has length 65 [2022-02-20 19:58:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:27,111 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 900 transitions. [2022-02-20 19:58:27,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 900 transitions. [2022-02-20 19:58:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:27,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:27,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:27,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:27,114 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1384995297, now seen corresponding path program 1 times [2022-02-20 19:58:27,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:27,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47695986] [2022-02-20 19:58:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {4146#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {4107#true} is VALID [2022-02-20 19:58:27,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4107#true} {4107#true} #1996#return; {4107#true} is VALID [2022-02-20 19:58:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {4107#true} is VALID [2022-02-20 19:58:27,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume !(0 == ~q_write_ev~0); {4107#true} is VALID [2022-02-20 19:58:27,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4107#true} {4107#true} #1998#return; {4107#true} is VALID [2022-02-20 19:58:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {4107#true} havoc ~__retres1~0; {4107#true} is VALID [2022-02-20 19:58:27,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume !(1 == ~p_dw_pc~0); {4107#true} is VALID [2022-02-20 19:58:27,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} ~__retres1~0 := 0; {4163#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:27,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {4163#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:27,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:27,281 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4107#true} #1992#return; {4155#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {4107#true} havoc ~__retres1~1; {4107#true} is VALID [2022-02-20 19:58:27,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume 1 == ~c_dr_pc~0; {4107#true} is VALID [2022-02-20 19:58:27,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4107#true} is VALID [2022-02-20 19:58:27,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {4107#true} #res := ~__retres1~1; {4107#true} is VALID [2022-02-20 19:58:27,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,287 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4107#true} {4108#false} #1994#return; {4108#false} is VALID [2022-02-20 19:58:27,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {4148#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {4107#true} is VALID [2022-02-20 19:58:27,287 INFO L272 TraceCheckUtils]: 1: Hoare triple {4107#true} call #t~ret8 := is_do_write_p_triggered(); {4107#true} is VALID [2022-02-20 19:58:27,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} havoc ~__retres1~0; {4107#true} is VALID [2022-02-20 19:58:27,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {4107#true} assume !(1 == ~p_dw_pc~0); {4107#true} is VALID [2022-02-20 19:58:27,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {4107#true} ~__retres1~0 := 0; {4163#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:27,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {4163#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:27,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:27,289 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4107#true} #1992#return; {4155#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:27,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {4155#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4156#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:27,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4108#false} is VALID [2022-02-20 19:58:27,290 INFO L272 TraceCheckUtils]: 10: Hoare triple {4108#false} call #t~ret9 := is_do_read_c_triggered(); {4107#true} is VALID [2022-02-20 19:58:27,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {4107#true} havoc ~__retres1~1; {4107#true} is VALID [2022-02-20 19:58:27,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {4107#true} assume 1 == ~c_dr_pc~0; {4107#true} is VALID [2022-02-20 19:58:27,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {4107#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4107#true} is VALID [2022-02-20 19:58:27,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {4107#true} #res := ~__retres1~1; {4107#true} is VALID [2022-02-20 19:58:27,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4107#true} {4108#false} #1994#return; {4108#false} is VALID [2022-02-20 19:58:27,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {4108#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4108#false} is VALID [2022-02-20 19:58:27,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {4108#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4108#false} is VALID [2022-02-20 19:58:27,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {4108#false} assume true; {4108#false} is VALID [2022-02-20 19:58:27,292 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4108#false} {4107#true} #2000#return; {4108#false} is VALID [2022-02-20 19:58:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {4107#true} is VALID [2022-02-20 19:58:27,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4107#true} is VALID [2022-02-20 19:58:27,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4107#true} {4108#false} #2002#return; {4108#false} is VALID [2022-02-20 19:58:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {4107#true} havoc ~__retres1~2; {4107#true} is VALID [2022-02-20 19:58:27,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4107#true} is VALID [2022-02-20 19:58:27,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} #res := ~__retres1~2; {4107#true} is VALID [2022-02-20 19:58:27,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,302 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4107#true} {4108#false} #2004#return; {4108#false} is VALID [2022-02-20 19:58:27,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {4107#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {4107#true} is VALID [2022-02-20 19:58:27,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {4107#true} is VALID [2022-02-20 19:58:27,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {4107#true} is VALID [2022-02-20 19:58:27,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {4107#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {4107#true} is VALID [2022-02-20 19:58:27,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {4107#true} call update_channels1(); {4146#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:27,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {4146#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {4107#true} is VALID [2022-02-20 19:58:27,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,304 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4107#true} {4107#true} #1996#return; {4107#true} is VALID [2022-02-20 19:58:27,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {4107#true} assume { :begin_inline_init_threads1 } true; {4107#true} is VALID [2022-02-20 19:58:27,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {4107#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4107#true} is VALID [2022-02-20 19:58:27,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {4107#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4107#true} is VALID [2022-02-20 19:58:27,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {4107#true} assume { :end_inline_init_threads1 } true; {4107#true} is VALID [2022-02-20 19:58:27,305 INFO L272 TraceCheckUtils]: 12: Hoare triple {4107#true} call fire_delta_events1(); {4147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:27,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {4147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {4107#true} is VALID [2022-02-20 19:58:27,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {4107#true} assume !(0 == ~q_write_ev~0); {4107#true} is VALID [2022-02-20 19:58:27,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,306 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4107#true} {4107#true} #1998#return; {4107#true} is VALID [2022-02-20 19:58:27,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {4107#true} call activate_threads1(); {4148#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:27,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {4148#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {4107#true} is VALID [2022-02-20 19:58:27,307 INFO L272 TraceCheckUtils]: 19: Hoare triple {4107#true} call #t~ret8 := is_do_write_p_triggered(); {4107#true} is VALID [2022-02-20 19:58:27,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {4107#true} havoc ~__retres1~0; {4107#true} is VALID [2022-02-20 19:58:27,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {4107#true} assume !(1 == ~p_dw_pc~0); {4107#true} is VALID [2022-02-20 19:58:27,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {4107#true} ~__retres1~0 := 0; {4163#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:27,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {4163#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:27,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:27,311 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4164#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4107#true} #1992#return; {4155#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:27,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {4155#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4156#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:27,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {4156#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4108#false} is VALID [2022-02-20 19:58:27,312 INFO L272 TraceCheckUtils]: 28: Hoare triple {4108#false} call #t~ret9 := is_do_read_c_triggered(); {4107#true} is VALID [2022-02-20 19:58:27,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {4107#true} havoc ~__retres1~1; {4107#true} is VALID [2022-02-20 19:58:27,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {4107#true} assume 1 == ~c_dr_pc~0; {4107#true} is VALID [2022-02-20 19:58:27,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {4107#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4107#true} is VALID [2022-02-20 19:58:27,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {4107#true} #res := ~__retres1~1; {4107#true} is VALID [2022-02-20 19:58:27,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,313 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4107#true} {4108#false} #1994#return; {4108#false} is VALID [2022-02-20 19:58:27,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {4108#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4108#false} is VALID [2022-02-20 19:58:27,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {4108#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4108#false} is VALID [2022-02-20 19:58:27,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {4108#false} assume true; {4108#false} is VALID [2022-02-20 19:58:27,316 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4108#false} {4107#true} #2000#return; {4108#false} is VALID [2022-02-20 19:58:27,316 INFO L272 TraceCheckUtils]: 39: Hoare triple {4108#false} call reset_delta_events1(); {4147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:27,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {4147#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {4107#true} is VALID [2022-02-20 19:58:27,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {4107#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4107#true} is VALID [2022-02-20 19:58:27,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,317 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4107#true} {4108#false} #2002#return; {4108#false} is VALID [2022-02-20 19:58:27,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2022-02-20 19:58:27,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {4108#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {4108#false} is VALID [2022-02-20 19:58:27,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2022-02-20 19:58:27,318 INFO L272 TraceCheckUtils]: 47: Hoare triple {4108#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4107#true} is VALID [2022-02-20 19:58:27,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {4107#true} havoc ~__retres1~2; {4107#true} is VALID [2022-02-20 19:58:27,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {4107#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4107#true} is VALID [2022-02-20 19:58:27,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {4107#true} #res := ~__retres1~2; {4107#true} is VALID [2022-02-20 19:58:27,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {4107#true} assume true; {4107#true} is VALID [2022-02-20 19:58:27,320 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4107#true} {4108#false} #2004#return; {4108#false} is VALID [2022-02-20 19:58:27,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {4108#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {4108#false} is VALID [2022-02-20 19:58:27,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {4108#false} assume 0 != eval1_~tmp___1~0#1; {4108#false} is VALID [2022-02-20 19:58:27,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {4108#false} assume !(0 == ~p_dw_st~0); {4108#false} is VALID [2022-02-20 19:58:27,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {4108#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {4108#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {4108#false} assume 0 == ~c_dr_pc~0; {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {4108#false} assume !(1 == ~q_free~0); {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {4108#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {4108#false} assume !(~p_last_write~0 == ~c_last_read~0); {4108#false} is VALID [2022-02-20 19:58:27,321 INFO L272 TraceCheckUtils]: 63: Hoare triple {4108#false} call error1(); {4108#false} is VALID [2022-02-20 19:58:27,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2022-02-20 19:58:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:27,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:27,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47695986] [2022-02-20 19:58:27,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47695986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:27,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:27,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:27,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081256308] [2022-02-20 19:58:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:27,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:27,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:27,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:27,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:27,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:27,367 INFO L87 Difference]: Start difference. First operand 594 states and 900 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,516 INFO L93 Difference]: Finished difference Result 808 states and 1194 transitions. [2022-02-20 19:58:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 924 transitions. [2022-02-20 19:58:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 924 transitions. [2022-02-20 19:58:31,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 924 transitions. [2022-02-20 19:58:32,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 924 edges. 924 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:32,304 INFO L225 Difference]: With dead ends: 808 [2022-02-20 19:58:32,304 INFO L226 Difference]: Without dead ends: 631 [2022-02-20 19:58:32,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:58:32,309 INFO L933 BasicCegarLoop]: 755 mSDtfsCounter, 1028 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:32,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 2986 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:58:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-02-20 19:58:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 599. [2022-02-20 19:58:32,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:32,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 631 states. Second operand has 599 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:32,341 INFO L74 IsIncluded]: Start isIncluded. First operand 631 states. Second operand has 599 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:32,342 INFO L87 Difference]: Start difference. First operand 631 states. Second operand has 599 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:32,390 INFO L93 Difference]: Finished difference Result 631 states and 950 transitions. [2022-02-20 19:58:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 950 transitions. [2022-02-20 19:58:32,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:32,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:32,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 599 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 631 states. [2022-02-20 19:58:32,395 INFO L87 Difference]: Start difference. First operand has 599 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 631 states. [2022-02-20 19:58:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:32,411 INFO L93 Difference]: Finished difference Result 631 states and 950 transitions. [2022-02-20 19:58:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 950 transitions. [2022-02-20 19:58:32,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:32,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:32,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:32,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:58:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 904 transitions. [2022-02-20 19:58:32,431 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 904 transitions. Word has length 65 [2022-02-20 19:58:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:32,432 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 904 transitions. [2022-02-20 19:58:32,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 904 transitions. [2022-02-20 19:58:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:32,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:32,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:32,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:32,436 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1880612701, now seen corresponding path program 1 times [2022-02-20 19:58:32,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:32,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200178894] [2022-02-20 19:58:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {7337#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7338#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:32,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {7338#(not (= |old(~q_req_up~0)| 1))} assume true; {7338#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:32,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7338#(not (= |old(~q_req_up~0)| 1))} {7298#(= ~c_dr_pc~0 ~q_req_up~0)} #1996#return; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {7339#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7295#true} is VALID [2022-02-20 19:58:32,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#true} assume !(0 == ~q_write_ev~0); {7295#true} is VALID [2022-02-20 19:58:32,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7295#true} {7302#(not (= ~c_dr_pc~0 1))} #1998#return; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#true} havoc ~__retres1~0; {7295#true} is VALID [2022-02-20 19:58:32,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#true} assume !(1 == ~p_dw_pc~0); {7295#true} is VALID [2022-02-20 19:58:32,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {7295#true} ~__retres1~0 := 0; {7295#true} is VALID [2022-02-20 19:58:32,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {7295#true} #res := ~__retres1~0; {7295#true} is VALID [2022-02-20 19:58:32,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,544 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7295#true} {7295#true} #1992#return; {7295#true} is VALID [2022-02-20 19:58:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#true} havoc ~__retres1~1; {7295#true} is VALID [2022-02-20 19:58:32,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#true} assume 1 == ~c_dr_pc~0; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,563 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} {7295#true} #1994#return; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {7340#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7295#true} is VALID [2022-02-20 19:58:32,564 INFO L272 TraceCheckUtils]: 1: Hoare triple {7295#true} call #t~ret8 := is_do_write_p_triggered(); {7295#true} is VALID [2022-02-20 19:58:32,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {7295#true} havoc ~__retres1~0; {7295#true} is VALID [2022-02-20 19:58:32,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {7295#true} assume !(1 == ~p_dw_pc~0); {7295#true} is VALID [2022-02-20 19:58:32,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {7295#true} ~__retres1~0 := 0; {7295#true} is VALID [2022-02-20 19:58:32,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {7295#true} #res := ~__retres1~0; {7295#true} is VALID [2022-02-20 19:58:32,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,566 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7295#true} {7295#true} #1992#return; {7295#true} is VALID [2022-02-20 19:58:32,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {7295#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7295#true} is VALID [2022-02-20 19:58:32,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {7295#true} assume !(0 != ~tmp~1); {7295#true} is VALID [2022-02-20 19:58:32,569 INFO L272 TraceCheckUtils]: 10: Hoare triple {7295#true} call #t~ret9 := is_do_read_c_triggered(); {7295#true} is VALID [2022-02-20 19:58:32,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {7295#true} havoc ~__retres1~1; {7295#true} is VALID [2022-02-20 19:58:32,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {7295#true} assume 1 == ~c_dr_pc~0; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,571 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} {7295#true} #1994#return; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,572 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} {7302#(not (= ~c_dr_pc~0 1))} #2000#return; {7296#false} is VALID [2022-02-20 19:58:32,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {7339#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7295#true} is VALID [2022-02-20 19:58:32,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7295#true} is VALID [2022-02-20 19:58:32,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7295#true} {7296#false} #2002#return; {7296#false} is VALID [2022-02-20 19:58:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#true} havoc ~__retres1~2; {7295#true} is VALID [2022-02-20 19:58:32,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7295#true} is VALID [2022-02-20 19:58:32,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {7295#true} #res := ~__retres1~2; {7295#true} is VALID [2022-02-20 19:58:32,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,582 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7295#true} {7296#false} #2004#return; {7296#false} is VALID [2022-02-20 19:58:32,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {7297#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:32,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {7297#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {7297#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:32,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {7297#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {7298#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:32,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {7298#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {7298#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:32,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {7298#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {7337#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:32,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {7337#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7338#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:32,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {7338#(not (= |old(~q_req_up~0)| 1))} assume true; {7338#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:32,586 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7338#(not (= |old(~q_req_up~0)| 1))} {7298#(= ~c_dr_pc~0 ~q_req_up~0)} #1996#return; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {7302#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {7302#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {7302#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {7302#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,587 INFO L272 TraceCheckUtils]: 12: Hoare triple {7302#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {7339#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {7339#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7295#true} is VALID [2022-02-20 19:58:32,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {7295#true} assume !(0 == ~q_write_ev~0); {7295#true} is VALID [2022-02-20 19:58:32,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,588 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7295#true} {7302#(not (= ~c_dr_pc~0 1))} #1998#return; {7302#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:32,588 INFO L272 TraceCheckUtils]: 17: Hoare triple {7302#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {7340#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {7340#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L272 TraceCheckUtils]: 19: Hoare triple {7295#true} call #t~ret8 := is_do_write_p_triggered(); {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {7295#true} havoc ~__retres1~0; {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {7295#true} assume !(1 == ~p_dw_pc~0); {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {7295#true} ~__retres1~0 := 0; {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {7295#true} #res := ~__retres1~0; {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7295#true} {7295#true} #1992#return; {7295#true} is VALID [2022-02-20 19:58:32,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {7295#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7295#true} is VALID [2022-02-20 19:58:32,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {7295#true} assume !(0 != ~tmp~1); {7295#true} is VALID [2022-02-20 19:58:32,590 INFO L272 TraceCheckUtils]: 28: Hoare triple {7295#true} call #t~ret9 := is_do_read_c_triggered(); {7295#true} is VALID [2022-02-20 19:58:32,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {7295#true} havoc ~__retres1~1; {7295#true} is VALID [2022-02-20 19:58:32,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {7295#true} assume 1 == ~c_dr_pc~0; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,591 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} {7295#true} #1994#return; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:32,593 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7353#(= (+ (- 1) ~c_dr_pc~0) 0)} {7302#(not (= ~c_dr_pc~0 1))} #2000#return; {7296#false} is VALID [2022-02-20 19:58:32,593 INFO L272 TraceCheckUtils]: 39: Hoare triple {7296#false} call reset_delta_events1(); {7339#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {7339#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7295#true} is VALID [2022-02-20 19:58:32,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {7295#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7295#true} is VALID [2022-02-20 19:58:32,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,593 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7295#true} {7296#false} #2002#return; {7296#false} is VALID [2022-02-20 19:58:32,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {7296#false} assume !false; {7296#false} is VALID [2022-02-20 19:58:32,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {7296#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {7296#false} is VALID [2022-02-20 19:58:32,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {7296#false} assume !false; {7296#false} is VALID [2022-02-20 19:58:32,594 INFO L272 TraceCheckUtils]: 47: Hoare triple {7296#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7295#true} is VALID [2022-02-20 19:58:32,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {7295#true} havoc ~__retres1~2; {7295#true} is VALID [2022-02-20 19:58:32,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {7295#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7295#true} is VALID [2022-02-20 19:58:32,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {7295#true} #res := ~__retres1~2; {7295#true} is VALID [2022-02-20 19:58:32,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {7295#true} assume true; {7295#true} is VALID [2022-02-20 19:58:32,599 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7295#true} {7296#false} #2004#return; {7296#false} is VALID [2022-02-20 19:58:32,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {7296#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7296#false} is VALID [2022-02-20 19:58:32,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {7296#false} assume 0 != eval1_~tmp___1~0#1; {7296#false} is VALID [2022-02-20 19:58:32,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {7296#false} assume !(0 == ~p_dw_st~0); {7296#false} is VALID [2022-02-20 19:58:32,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {7296#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {7296#false} is VALID [2022-02-20 19:58:32,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {7296#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {7296#false} is VALID [2022-02-20 19:58:32,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {7296#false} assume 0 == ~c_dr_pc~0; {7296#false} is VALID [2022-02-20 19:58:32,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {7296#false} assume !false; {7296#false} is VALID [2022-02-20 19:58:32,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {7296#false} assume !(1 == ~q_free~0); {7296#false} is VALID [2022-02-20 19:58:32,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {7296#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {7296#false} is VALID [2022-02-20 19:58:32,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {7296#false} assume !(~p_last_write~0 == ~c_last_read~0); {7296#false} is VALID [2022-02-20 19:58:32,600 INFO L272 TraceCheckUtils]: 63: Hoare triple {7296#false} call error1(); {7296#false} is VALID [2022-02-20 19:58:32,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {7296#false} assume !false; {7296#false} is VALID [2022-02-20 19:58:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:32,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:32,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200178894] [2022-02-20 19:58:32,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200178894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:32,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:32,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:32,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600160475] [2022-02-20 19:58:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:58:32,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:32,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:32,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:32,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:32,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:32,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:32,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:32,645 INFO L87 Difference]: Start difference. First operand 599 states and 904 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:37,813 INFO L93 Difference]: Finished difference Result 1499 states and 2123 transitions. [2022-02-20 19:58:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:37,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:58:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1443 transitions. [2022-02-20 19:58:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1443 transitions. [2022-02-20 19:58:37,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1443 transitions. [2022-02-20 19:58:38,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1443 edges. 1443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:38,830 INFO L225 Difference]: With dead ends: 1499 [2022-02-20 19:58:38,831 INFO L226 Difference]: Without dead ends: 1305 [2022-02-20 19:58:38,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:38,837 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 3782 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3798 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:38,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3798 Valid, 3130 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:58:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-02-20 19:58:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1180. [2022-02-20 19:58:38,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:38,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1305 states. Second operand has 1180 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 998 states have internal predecessors, (1410), 109 states have call successors, (109), 74 states have call predecessors, (109), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:38,912 INFO L74 IsIncluded]: Start isIncluded. First operand 1305 states. Second operand has 1180 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 998 states have internal predecessors, (1410), 109 states have call successors, (109), 74 states have call predecessors, (109), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:38,913 INFO L87 Difference]: Start difference. First operand 1305 states. Second operand has 1180 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 998 states have internal predecessors, (1410), 109 states have call successors, (109), 74 states have call predecessors, (109), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:38,966 INFO L93 Difference]: Finished difference Result 1305 states and 1791 transitions. [2022-02-20 19:58:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1791 transitions. [2022-02-20 19:58:38,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:38,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:38,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 1180 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 998 states have internal predecessors, (1410), 109 states have call successors, (109), 74 states have call predecessors, (109), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1305 states. [2022-02-20 19:58:38,972 INFO L87 Difference]: Start difference. First operand has 1180 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 998 states have internal predecessors, (1410), 109 states have call successors, (109), 74 states have call predecessors, (109), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1305 states. [2022-02-20 19:58:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,022 INFO L93 Difference]: Finished difference Result 1305 states and 1791 transitions. [2022-02-20 19:58:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1791 transitions. [2022-02-20 19:58:39,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:39,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:39,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:39,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 998 states have internal predecessors, (1410), 109 states have call successors, (109), 74 states have call predecessors, (109), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:58:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1644 transitions. [2022-02-20 19:58:39,080 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1644 transitions. Word has length 65 [2022-02-20 19:58:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:39,080 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1644 transitions. [2022-02-20 19:58:39,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1644 transitions. [2022-02-20 19:58:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:39,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:39,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:39,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:39,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1362905506, now seen corresponding path program 1 times [2022-02-20 19:58:39,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:39,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022179888] [2022-02-20 19:58:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {13630#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {13591#true} is VALID [2022-02-20 19:58:39,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13591#true} {13591#true} #1996#return; {13591#true} is VALID [2022-02-20 19:58:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {13631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {13591#true} is VALID [2022-02-20 19:58:39,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume !(0 == ~q_write_ev~0); {13591#true} is VALID [2022-02-20 19:58:39,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13591#true} {13591#true} #1998#return; {13591#true} is VALID [2022-02-20 19:58:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {13591#true} havoc ~__retres1~0; {13591#true} is VALID [2022-02-20 19:58:39,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume !(1 == ~p_dw_pc~0); {13591#true} is VALID [2022-02-20 19:58:39,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} ~__retres1~0 := 0; {13591#true} is VALID [2022-02-20 19:58:39,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {13591#true} #res := ~__retres1~0; {13591#true} is VALID [2022-02-20 19:58:39,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,183 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13591#true} {13591#true} #1992#return; {13591#true} is VALID [2022-02-20 19:58:39,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {13591#true} havoc ~__retres1~1; {13591#true} is VALID [2022-02-20 19:58:39,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume !(1 == ~c_dr_pc~0); {13591#true} is VALID [2022-02-20 19:58:39,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} ~__retres1~1 := 0; {13647#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:39,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {13647#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:39,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:39,211 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13591#true} #1994#return; {13645#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:39,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {13632#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {13591#true} is VALID [2022-02-20 19:58:39,211 INFO L272 TraceCheckUtils]: 1: Hoare triple {13591#true} call #t~ret8 := is_do_write_p_triggered(); {13591#true} is VALID [2022-02-20 19:58:39,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} havoc ~__retres1~0; {13591#true} is VALID [2022-02-20 19:58:39,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {13591#true} assume !(1 == ~p_dw_pc~0); {13591#true} is VALID [2022-02-20 19:58:39,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {13591#true} ~__retres1~0 := 0; {13591#true} is VALID [2022-02-20 19:58:39,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {13591#true} #res := ~__retres1~0; {13591#true} is VALID [2022-02-20 19:58:39,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,212 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13591#true} {13591#true} #1992#return; {13591#true} is VALID [2022-02-20 19:58:39,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {13591#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13591#true} is VALID [2022-02-20 19:58:39,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {13591#true} assume !(0 != ~tmp~1); {13591#true} is VALID [2022-02-20 19:58:39,213 INFO L272 TraceCheckUtils]: 10: Hoare triple {13591#true} call #t~ret9 := is_do_read_c_triggered(); {13591#true} is VALID [2022-02-20 19:58:39,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {13591#true} havoc ~__retres1~1; {13591#true} is VALID [2022-02-20 19:58:39,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {13591#true} assume !(1 == ~c_dr_pc~0); {13591#true} is VALID [2022-02-20 19:58:39,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {13591#true} ~__retres1~1 := 0; {13647#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:39,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {13647#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:39,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:39,217 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13591#true} #1994#return; {13645#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:39,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {13645#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13646#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:39,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {13646#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13592#false} is VALID [2022-02-20 19:58:39,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {13592#false} assume true; {13592#false} is VALID [2022-02-20 19:58:39,218 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13592#false} {13591#true} #2000#return; {13592#false} is VALID [2022-02-20 19:58:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {13631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {13591#true} is VALID [2022-02-20 19:58:39,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13591#true} is VALID [2022-02-20 19:58:39,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13591#true} {13592#false} #2002#return; {13592#false} is VALID [2022-02-20 19:58:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {13591#true} havoc ~__retres1~2; {13591#true} is VALID [2022-02-20 19:58:39,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13591#true} is VALID [2022-02-20 19:58:39,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} #res := ~__retres1~2; {13591#true} is VALID [2022-02-20 19:58:39,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,226 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13591#true} {13592#false} #2004#return; {13592#false} is VALID [2022-02-20 19:58:39,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {13591#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {13591#true} is VALID [2022-02-20 19:58:39,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {13591#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {13591#true} is VALID [2022-02-20 19:58:39,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {13591#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {13591#true} is VALID [2022-02-20 19:58:39,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {13591#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {13591#true} is VALID [2022-02-20 19:58:39,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {13591#true} call update_channels1(); {13630#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:39,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {13630#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {13591#true} is VALID [2022-02-20 19:58:39,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,227 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13591#true} {13591#true} #1996#return; {13591#true} is VALID [2022-02-20 19:58:39,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {13591#true} assume { :begin_inline_init_threads1 } true; {13591#true} is VALID [2022-02-20 19:58:39,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {13591#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13591#true} is VALID [2022-02-20 19:58:39,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {13591#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13591#true} is VALID [2022-02-20 19:58:39,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {13591#true} assume { :end_inline_init_threads1 } true; {13591#true} is VALID [2022-02-20 19:58:39,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {13591#true} call fire_delta_events1(); {13631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:39,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {13631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {13591#true} is VALID [2022-02-20 19:58:39,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {13591#true} assume !(0 == ~q_write_ev~0); {13591#true} is VALID [2022-02-20 19:58:39,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,228 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13591#true} {13591#true} #1998#return; {13591#true} is VALID [2022-02-20 19:58:39,228 INFO L272 TraceCheckUtils]: 17: Hoare triple {13591#true} call activate_threads1(); {13632#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:39,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {13632#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {13591#true} call #t~ret8 := is_do_write_p_triggered(); {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {13591#true} havoc ~__retres1~0; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {13591#true} assume !(1 == ~p_dw_pc~0); {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {13591#true} ~__retres1~0 := 0; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {13591#true} #res := ~__retres1~0; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13591#true} {13591#true} #1992#return; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {13591#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13591#true} is VALID [2022-02-20 19:58:39,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {13591#true} assume !(0 != ~tmp~1); {13591#true} is VALID [2022-02-20 19:58:39,230 INFO L272 TraceCheckUtils]: 28: Hoare triple {13591#true} call #t~ret9 := is_do_read_c_triggered(); {13591#true} is VALID [2022-02-20 19:58:39,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {13591#true} havoc ~__retres1~1; {13591#true} is VALID [2022-02-20 19:58:39,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {13591#true} assume !(1 == ~c_dr_pc~0); {13591#true} is VALID [2022-02-20 19:58:39,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {13591#true} ~__retres1~1 := 0; {13647#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:39,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {13647#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:39,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:39,231 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13648#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13591#true} #1994#return; {13645#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:39,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {13645#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13646#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:39,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {13646#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13592#false} is VALID [2022-02-20 19:58:39,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {13592#false} assume true; {13592#false} is VALID [2022-02-20 19:58:39,232 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13592#false} {13591#true} #2000#return; {13592#false} is VALID [2022-02-20 19:58:39,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {13592#false} call reset_delta_events1(); {13631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:39,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {13631#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {13591#true} is VALID [2022-02-20 19:58:39,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {13591#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13591#true} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,233 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13591#true} {13592#false} #2002#return; {13592#false} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {13592#false} assume !false; {13592#false} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {13592#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {13592#false} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {13592#false} assume !false; {13592#false} is VALID [2022-02-20 19:58:39,233 INFO L272 TraceCheckUtils]: 47: Hoare triple {13592#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13591#true} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {13591#true} havoc ~__retres1~2; {13591#true} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {13591#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13591#true} is VALID [2022-02-20 19:58:39,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {13591#true} #res := ~__retres1~2; {13591#true} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {13591#true} assume true; {13591#true} is VALID [2022-02-20 19:58:39,234 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13591#true} {13592#false} #2004#return; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {13592#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {13592#false} assume 0 != eval1_~tmp___1~0#1; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {13592#false} assume !(0 == ~p_dw_st~0); {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {13592#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {13592#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {13592#false} assume 0 == ~c_dr_pc~0; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {13592#false} assume !false; {13592#false} is VALID [2022-02-20 19:58:39,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {13592#false} assume !(1 == ~q_free~0); {13592#false} is VALID [2022-02-20 19:58:39,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {13592#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {13592#false} is VALID [2022-02-20 19:58:39,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {13592#false} assume !(~p_last_write~0 == ~c_last_read~0); {13592#false} is VALID [2022-02-20 19:58:39,235 INFO L272 TraceCheckUtils]: 63: Hoare triple {13592#false} call error1(); {13592#false} is VALID [2022-02-20 19:58:39,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {13592#false} assume !false; {13592#false} is VALID [2022-02-20 19:58:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:39,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:39,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022179888] [2022-02-20 19:58:39,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022179888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:39,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:39,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:39,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806189694] [2022-02-20 19:58:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:39,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:39,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:39,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:39,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:39,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:39,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:39,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:39,270 INFO L87 Difference]: Start difference. First operand 1180 states and 1644 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:42,722 INFO L93 Difference]: Finished difference Result 2061 states and 2787 transitions. [2022-02-20 19:58:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:42,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 924 transitions. [2022-02-20 19:58:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 924 transitions. [2022-02-20 19:58:42,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 924 transitions. [2022-02-20 19:58:43,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 924 edges. 924 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:43,435 INFO L225 Difference]: With dead ends: 2061 [2022-02-20 19:58:43,435 INFO L226 Difference]: Without dead ends: 1292 [2022-02-20 19:58:43,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:43,443 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 1029 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:43,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 2983 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-02-20 19:58:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1200. [2022-02-20 19:58:43,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:43,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1292 states. Second operand has 1200 states, 1000 states have (on average 1.421) internal successors, (1421), 1014 states have internal predecessors, (1421), 109 states have call successors, (109), 74 states have call predecessors, (109), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:43,506 INFO L74 IsIncluded]: Start isIncluded. First operand 1292 states. Second operand has 1200 states, 1000 states have (on average 1.421) internal successors, (1421), 1014 states have internal predecessors, (1421), 109 states have call successors, (109), 74 states have call predecessors, (109), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:43,509 INFO L87 Difference]: Start difference. First operand 1292 states. Second operand has 1200 states, 1000 states have (on average 1.421) internal successors, (1421), 1014 states have internal predecessors, (1421), 109 states have call successors, (109), 74 states have call predecessors, (109), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,566 INFO L93 Difference]: Finished difference Result 1292 states and 1771 transitions. [2022-02-20 19:58:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1771 transitions. [2022-02-20 19:58:43,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:43,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:43,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 1000 states have (on average 1.421) internal successors, (1421), 1014 states have internal predecessors, (1421), 109 states have call successors, (109), 74 states have call predecessors, (109), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1292 states. [2022-02-20 19:58:43,589 INFO L87 Difference]: Start difference. First operand has 1200 states, 1000 states have (on average 1.421) internal successors, (1421), 1014 states have internal predecessors, (1421), 109 states have call successors, (109), 74 states have call predecessors, (109), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1292 states. [2022-02-20 19:58:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,668 INFO L93 Difference]: Finished difference Result 1292 states and 1771 transitions. [2022-02-20 19:58:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1771 transitions. [2022-02-20 19:58:43,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:43,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:43,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:43,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1000 states have (on average 1.421) internal successors, (1421), 1014 states have internal predecessors, (1421), 109 states have call successors, (109), 74 states have call predecessors, (109), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:58:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1659 transitions. [2022-02-20 19:58:43,750 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1659 transitions. Word has length 65 [2022-02-20 19:58:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:43,750 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 1659 transitions. [2022-02-20 19:58:43,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1659 transitions. [2022-02-20 19:58:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:43,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:43,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:43,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:43,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 23297888, now seen corresponding path program 1 times [2022-02-20 19:58:43,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:43,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486148464] [2022-02-20 19:58:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:43,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {20629#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #1996#return; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #1998#return; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {20589#true} havoc ~__retres1~0; {20589#true} is VALID [2022-02-20 19:58:43,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} assume !(1 == ~p_dw_pc~0); {20589#true} is VALID [2022-02-20 19:58:43,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} ~__retres1~0 := 0; {20589#true} is VALID [2022-02-20 19:58:43,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {20589#true} #res := ~__retres1~0; {20589#true} is VALID [2022-02-20 19:58:43,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,845 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20589#true} {20589#true} #1992#return; {20589#true} is VALID [2022-02-20 19:58:43,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {20589#true} havoc ~__retres1~1; {20589#true} is VALID [2022-02-20 19:58:43,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} assume !(1 == ~c_dr_pc~0); {20589#true} is VALID [2022-02-20 19:58:43,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} ~__retres1~1 := 0; {20589#true} is VALID [2022-02-20 19:58:43,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {20589#true} #res := ~__retres1~1; {20589#true} is VALID [2022-02-20 19:58:43,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,848 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20589#true} {20589#true} #1994#return; {20589#true} is VALID [2022-02-20 19:58:43,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {20631#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {20589#true} is VALID [2022-02-20 19:58:43,849 INFO L272 TraceCheckUtils]: 1: Hoare triple {20589#true} call #t~ret8 := is_do_write_p_triggered(); {20589#true} is VALID [2022-02-20 19:58:43,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} havoc ~__retres1~0; {20589#true} is VALID [2022-02-20 19:58:43,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {20589#true} assume !(1 == ~p_dw_pc~0); {20589#true} is VALID [2022-02-20 19:58:43,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {20589#true} ~__retres1~0 := 0; {20589#true} is VALID [2022-02-20 19:58:43,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {20589#true} #res := ~__retres1~0; {20589#true} is VALID [2022-02-20 19:58:43,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20589#true} {20589#true} #1992#return; {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {20589#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {20589#true} assume !(0 != ~tmp~1); {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L272 TraceCheckUtils]: 10: Hoare triple {20589#true} call #t~ret9 := is_do_read_c_triggered(); {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {20589#true} havoc ~__retres1~1; {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {20589#true} assume !(1 == ~c_dr_pc~0); {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {20589#true} ~__retres1~1 := 0; {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {20589#true} #res := ~__retres1~1; {20589#true} is VALID [2022-02-20 19:58:43,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,851 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20589#true} {20589#true} #1994#return; {20589#true} is VALID [2022-02-20 19:58:43,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {20589#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20589#true} is VALID [2022-02-20 19:58:43,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {20589#true} assume !(0 != ~tmp___0~1); {20589#true} is VALID [2022-02-20 19:58:43,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,852 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20589#true} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #2000#return; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {20644#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:43,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {20644#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:43,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:43,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #2002#return; {20590#false} is VALID [2022-02-20 19:58:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {20589#true} havoc ~__retres1~2; {20589#true} is VALID [2022-02-20 19:58:43,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20589#true} is VALID [2022-02-20 19:58:43,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} #res := ~__retres1~2; {20589#true} is VALID [2022-02-20 19:58:43,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,876 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20589#true} {20590#false} #2004#return; {20590#false} is VALID [2022-02-20 19:58:43,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {20589#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {20589#true} is VALID [2022-02-20 19:58:43,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {20589#true} is VALID [2022-02-20 19:58:43,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {20629#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:43,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {20629#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,878 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #1996#return; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,880 INFO L272 TraceCheckUtils]: 12: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,881 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #1998#return; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,882 INFO L272 TraceCheckUtils]: 17: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {20631#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {20631#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L272 TraceCheckUtils]: 19: Hoare triple {20589#true} call #t~ret8 := is_do_write_p_triggered(); {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {20589#true} havoc ~__retres1~0; {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {20589#true} assume !(1 == ~p_dw_pc~0); {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {20589#true} ~__retres1~0 := 0; {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {20589#true} #res := ~__retres1~0; {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20589#true} {20589#true} #1992#return; {20589#true} is VALID [2022-02-20 19:58:43,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {20589#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {20589#true} assume !(0 != ~tmp~1); {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L272 TraceCheckUtils]: 28: Hoare triple {20589#true} call #t~ret9 := is_do_read_c_triggered(); {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {20589#true} havoc ~__retres1~1; {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {20589#true} assume !(1 == ~c_dr_pc~0); {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {20589#true} ~__retres1~1 := 0; {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {20589#true} #res := ~__retres1~1; {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20589#true} {20589#true} #1994#return; {20589#true} is VALID [2022-02-20 19:58:43,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {20589#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20589#true} is VALID [2022-02-20 19:58:43,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {20589#true} assume !(0 != ~tmp___0~1); {20589#true} is VALID [2022-02-20 19:58:43,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,884 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20589#true} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #2000#return; {20591#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:43,884 INFO L272 TraceCheckUtils]: 39: Hoare triple {20591#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:43,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {20630#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {20644#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:43,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {20644#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:43,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:43,886 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {20645#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20591#(= ~q_write_ev~0 ~q_read_ev~0)} #2002#return; {20590#false} is VALID [2022-02-20 19:58:43,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-02-20 19:58:43,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {20590#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {20590#false} is VALID [2022-02-20 19:58:43,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-02-20 19:58:43,898 INFO L272 TraceCheckUtils]: 47: Hoare triple {20590#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20589#true} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {20589#true} havoc ~__retres1~2; {20589#true} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {20589#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20589#true} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {20589#true} #res := ~__retres1~2; {20589#true} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-02-20 19:58:43,899 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20589#true} {20590#false} #2004#return; {20590#false} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 53: Hoare triple {20590#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {20590#false} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {20590#false} assume 0 != eval1_~tmp___1~0#1; {20590#false} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {20590#false} assume !(0 == ~p_dw_st~0); {20590#false} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {20590#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {20590#false} is VALID [2022-02-20 19:58:43,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {20590#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {20590#false} assume 0 == ~c_dr_pc~0; {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {20590#false} assume !(1 == ~q_free~0); {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {20590#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {20590#false} assume !(~p_last_write~0 == ~c_last_read~0); {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L272 TraceCheckUtils]: 63: Hoare triple {20590#false} call error1(); {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-02-20 19:58:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:43,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:43,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486148464] [2022-02-20 19:58:43,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486148464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:43,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:43,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:43,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349979624] [2022-02-20 19:58:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:43,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:43,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:43,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:43,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:43,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:43,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:43,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:43,940 INFO L87 Difference]: Start difference. First operand 1200 states and 1659 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,607 INFO L93 Difference]: Finished difference Result 2768 states and 3606 transitions. [2022-02-20 19:58:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1090 transitions. [2022-02-20 19:58:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1090 transitions. [2022-02-20 19:58:47,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1090 transitions. [2022-02-20 19:58:48,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1090 edges. 1090 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,357 INFO L225 Difference]: With dead ends: 2768 [2022-02-20 19:58:48,358 INFO L226 Difference]: Without dead ends: 1980 [2022-02-20 19:58:48,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:48,360 INFO L933 BasicCegarLoop]: 763 mSDtfsCounter, 1884 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:48,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1914 Valid, 2226 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2022-02-20 19:58:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1648. [2022-02-20 19:58:48,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:48,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1980 states. Second operand has 1648 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1376 states have internal predecessors, (1870), 155 states have call successors, (155), 113 states have call predecessors, (155), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:48,443 INFO L74 IsIncluded]: Start isIncluded. First operand 1980 states. Second operand has 1648 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1376 states have internal predecessors, (1870), 155 states have call successors, (155), 113 states have call predecessors, (155), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:48,445 INFO L87 Difference]: Start difference. First operand 1980 states. Second operand has 1648 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1376 states have internal predecessors, (1870), 155 states have call successors, (155), 113 states have call predecessors, (155), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,547 INFO L93 Difference]: Finished difference Result 1980 states and 2583 transitions. [2022-02-20 19:58:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2583 transitions. [2022-02-20 19:58:48,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1376 states have internal predecessors, (1870), 155 states have call successors, (155), 113 states have call predecessors, (155), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1980 states. [2022-02-20 19:58:48,555 INFO L87 Difference]: Start difference. First operand has 1648 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1376 states have internal predecessors, (1870), 155 states have call successors, (155), 113 states have call predecessors, (155), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1980 states. [2022-02-20 19:58:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,663 INFO L93 Difference]: Finished difference Result 1980 states and 2583 transitions. [2022-02-20 19:58:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2583 transitions. [2022-02-20 19:58:48,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:48,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1376 states have internal predecessors, (1870), 155 states have call successors, (155), 113 states have call predecessors, (155), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:58:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2226 transitions. [2022-02-20 19:58:48,772 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2226 transitions. Word has length 65 [2022-02-20 19:58:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,773 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2226 transitions. [2022-02-20 19:58:48,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2226 transitions. [2022-02-20 19:58:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:48,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:48,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:48,774 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash -110715618, now seen corresponding path program 1 times [2022-02-20 19:58:48,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634750616] [2022-02-20 19:58:48,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {30538#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {30498#true} is VALID [2022-02-20 19:58:48,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30498#true} {30498#true} #1996#return; {30498#true} is VALID [2022-02-20 19:58:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {30539#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume !(0 == ~q_write_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30498#true} {30503#(= ~p_dw_st~0 0)} #1998#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {30498#true} havoc ~__retres1~0; {30498#true} is VALID [2022-02-20 19:58:48,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume !(1 == ~p_dw_pc~0); {30498#true} is VALID [2022-02-20 19:58:48,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {30498#true} ~__retres1~0 := 0; {30498#true} is VALID [2022-02-20 19:58:48,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {30498#true} #res := ~__retres1~0; {30498#true} is VALID [2022-02-20 19:58:48,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,829 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30498#true} {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1992#return; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {30498#true} havoc ~__retres1~1; {30498#true} is VALID [2022-02-20 19:58:48,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume !(1 == ~c_dr_pc~0); {30498#true} is VALID [2022-02-20 19:58:48,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {30498#true} ~__retres1~1 := 0; {30498#true} is VALID [2022-02-20 19:58:48,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {30498#true} #res := ~__retres1~1; {30498#true} is VALID [2022-02-20 19:58:48,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,832 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30498#true} {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1994#return; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {30540#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,833 INFO L272 TraceCheckUtils]: 1: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {30498#true} is VALID [2022-02-20 19:58:48,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {30498#true} havoc ~__retres1~0; {30498#true} is VALID [2022-02-20 19:58:48,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {30498#true} assume !(1 == ~p_dw_pc~0); {30498#true} is VALID [2022-02-20 19:58:48,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {30498#true} ~__retres1~0 := 0; {30498#true} is VALID [2022-02-20 19:58:48,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {30498#true} #res := ~__retres1~0; {30498#true} is VALID [2022-02-20 19:58:48,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,833 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30498#true} {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1992#return; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,834 INFO L272 TraceCheckUtils]: 10: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {30498#true} is VALID [2022-02-20 19:58:48,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {30498#true} havoc ~__retres1~1; {30498#true} is VALID [2022-02-20 19:58:48,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {30498#true} assume !(1 == ~c_dr_pc~0); {30498#true} is VALID [2022-02-20 19:58:48,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {30498#true} ~__retres1~1 := 0; {30498#true} is VALID [2022-02-20 19:58:48,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {30498#true} #res := ~__retres1~1; {30498#true} is VALID [2022-02-20 19:58:48,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,835 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30498#true} {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1994#return; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,836 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {30503#(= ~p_dw_st~0 0)} #2000#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {30539#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume !(1 == ~q_write_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30498#true} {30503#(= ~p_dw_st~0 0)} #2002#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {30498#true} havoc ~__retres1~2; {30498#true} is VALID [2022-02-20 19:58:48,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {30503#(= ~p_dw_st~0 0)} assume true; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,844 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30503#(= ~p_dw_st~0 0)} {30503#(= ~p_dw_st~0 0)} #2004#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {30498#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {30498#true} is VALID [2022-02-20 19:58:48,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {30498#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {30498#true} is VALID [2022-02-20 19:58:48,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {30498#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {30498#true} is VALID [2022-02-20 19:58:48,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {30498#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {30498#true} is VALID [2022-02-20 19:58:48,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {30498#true} call update_channels1(); {30538#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:48,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {30538#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {30498#true} is VALID [2022-02-20 19:58:48,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,846 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30498#true} {30498#true} #1996#return; {30498#true} is VALID [2022-02-20 19:58:48,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {30498#true} assume { :begin_inline_init_threads1 } true; {30498#true} is VALID [2022-02-20 19:58:48,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {30498#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {30503#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {30503#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,847 INFO L272 TraceCheckUtils]: 12: Hoare triple {30503#(= ~p_dw_st~0 0)} call fire_delta_events1(); {30539#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:48,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {30539#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {30498#true} assume !(0 == ~q_write_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,847 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30498#true} {30503#(= ~p_dw_st~0 0)} #1998#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,848 INFO L272 TraceCheckUtils]: 17: Hoare triple {30503#(= ~p_dw_st~0 0)} call activate_threads1(); {30540#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:48,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {30540#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,848 INFO L272 TraceCheckUtils]: 19: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {30498#true} is VALID [2022-02-20 19:58:48,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {30498#true} havoc ~__retres1~0; {30498#true} is VALID [2022-02-20 19:58:48,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {30498#true} assume !(1 == ~p_dw_pc~0); {30498#true} is VALID [2022-02-20 19:58:48,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {30498#true} ~__retres1~0 := 0; {30498#true} is VALID [2022-02-20 19:58:48,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {30498#true} #res := ~__retres1~0; {30498#true} is VALID [2022-02-20 19:58:48,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,849 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30498#true} {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1992#return; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,850 INFO L272 TraceCheckUtils]: 28: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {30498#true} is VALID [2022-02-20 19:58:48,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {30498#true} havoc ~__retres1~1; {30498#true} is VALID [2022-02-20 19:58:48,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {30498#true} assume !(1 == ~c_dr_pc~0); {30498#true} is VALID [2022-02-20 19:58:48,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {30498#true} ~__retres1~1 := 0; {30498#true} is VALID [2022-02-20 19:58:48,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {30498#true} #res := ~__retres1~1; {30498#true} is VALID [2022-02-20 19:58:48,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,851 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30498#true} {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1994#return; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:48,852 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30541#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {30503#(= ~p_dw_st~0 0)} #2000#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,852 INFO L272 TraceCheckUtils]: 39: Hoare triple {30503#(= ~p_dw_st~0 0)} call reset_delta_events1(); {30539#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:48,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {30539#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {30498#true} assume !(1 == ~q_write_ev~0); {30498#true} is VALID [2022-02-20 19:58:48,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {30498#true} assume true; {30498#true} is VALID [2022-02-20 19:58:48,853 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30498#true} {30503#(= ~p_dw_st~0 0)} #2002#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {30503#(= ~p_dw_st~0 0)} assume !false; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {30503#(= ~p_dw_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {30503#(= ~p_dw_st~0 0)} assume !false; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,854 INFO L272 TraceCheckUtils]: 47: Hoare triple {30503#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30498#true} is VALID [2022-02-20 19:58:48,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {30498#true} havoc ~__retres1~2; {30498#true} is VALID [2022-02-20 19:58:48,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {30498#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {30503#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {30503#(= ~p_dw_st~0 0)} assume true; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,855 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30503#(= ~p_dw_st~0 0)} {30503#(= ~p_dw_st~0 0)} #2004#return; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {30503#(= ~p_dw_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {30503#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {30503#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {30503#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {30499#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {30499#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {30499#false} assume 0 == ~c_dr_pc~0; {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {30499#false} assume !false; {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {30499#false} assume !(1 == ~q_free~0); {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {30499#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {30499#false} is VALID [2022-02-20 19:58:48,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {30499#false} assume !(~p_last_write~0 == ~c_last_read~0); {30499#false} is VALID [2022-02-20 19:58:48,857 INFO L272 TraceCheckUtils]: 63: Hoare triple {30499#false} call error1(); {30499#false} is VALID [2022-02-20 19:58:48,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {30499#false} assume !false; {30499#false} is VALID [2022-02-20 19:58:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:48,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:48,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634750616] [2022-02-20 19:58:48,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634750616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:48,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:48,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:48,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348118115] [2022-02-20 19:58:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:48,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:48,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:48,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:48,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:48,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:48,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:48,889 INFO L87 Difference]: Start difference. First operand 1648 states and 2226 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,843 INFO L93 Difference]: Finished difference Result 4126 states and 5380 transitions. [2022-02-20 19:58:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1045 transitions. [2022-02-20 19:58:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1045 transitions. [2022-02-20 19:58:50,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1045 transitions. [2022-02-20 19:58:51,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1045 edges. 1045 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:51,904 INFO L225 Difference]: With dead ends: 4126 [2022-02-20 19:58:51,904 INFO L226 Difference]: Without dead ends: 2892 [2022-02-20 19:58:51,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:51,907 INFO L933 BasicCegarLoop]: 728 mSDtfsCounter, 2234 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:51,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2268 Valid, 1475 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2022-02-20 19:58:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2784. [2022-02-20 19:58:52,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:52,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2892 states. Second operand has 2784 states, 2224 states have (on average 1.3151978417266188) internal successors, (2925), 2269 states have internal predecessors, (2925), 284 states have call successors, (284), 219 states have call predecessors, (284), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:52,058 INFO L74 IsIncluded]: Start isIncluded. First operand 2892 states. Second operand has 2784 states, 2224 states have (on average 1.3151978417266188) internal successors, (2925), 2269 states have internal predecessors, (2925), 284 states have call successors, (284), 219 states have call predecessors, (284), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:52,061 INFO L87 Difference]: Start difference. First operand 2892 states. Second operand has 2784 states, 2224 states have (on average 1.3151978417266188) internal successors, (2925), 2269 states have internal predecessors, (2925), 284 states have call successors, (284), 219 states have call predecessors, (284), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:52,266 INFO L93 Difference]: Finished difference Result 2892 states and 3747 transitions. [2022-02-20 19:58:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3747 transitions. [2022-02-20 19:58:52,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:52,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:52,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 2784 states, 2224 states have (on average 1.3151978417266188) internal successors, (2925), 2269 states have internal predecessors, (2925), 284 states have call successors, (284), 219 states have call predecessors, (284), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) Second operand 2892 states. [2022-02-20 19:58:52,277 INFO L87 Difference]: Start difference. First operand has 2784 states, 2224 states have (on average 1.3151978417266188) internal successors, (2925), 2269 states have internal predecessors, (2925), 284 states have call successors, (284), 219 states have call predecessors, (284), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) Second operand 2892 states. [2022-02-20 19:58:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:52,484 INFO L93 Difference]: Finished difference Result 2892 states and 3747 transitions. [2022-02-20 19:58:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3747 transitions. [2022-02-20 19:58:52,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:52,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:52,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:52,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2224 states have (on average 1.3151978417266188) internal successors, (2925), 2269 states have internal predecessors, (2925), 284 states have call successors, (284), 219 states have call predecessors, (284), 274 states have return successors, (415), 300 states have call predecessors, (415), 282 states have call successors, (415) [2022-02-20 19:58:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3624 transitions. [2022-02-20 19:58:52,803 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3624 transitions. Word has length 65 [2022-02-20 19:58:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:52,804 INFO L470 AbstractCegarLoop]: Abstraction has 2784 states and 3624 transitions. [2022-02-20 19:58:52,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3624 transitions. [2022-02-20 19:58:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:52,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:52,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:52,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:52,805 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:52,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1545241855, now seen corresponding path program 1 times [2022-02-20 19:58:52,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:52,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353308729] [2022-02-20 19:58:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {45657#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {45617#true} is VALID [2022-02-20 19:58:52,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #1996#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {45658#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume !(0 == ~q_write_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #1998#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {45617#true} havoc ~__retres1~0; {45617#true} is VALID [2022-02-20 19:58:52,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume !(1 == ~p_dw_pc~0); {45617#true} is VALID [2022-02-20 19:58:52,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} ~__retres1~0 := 0; {45617#true} is VALID [2022-02-20 19:58:52,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {45617#true} #res := ~__retres1~0; {45617#true} is VALID [2022-02-20 19:58:52,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,852 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45617#true} {45617#true} #1992#return; {45617#true} is VALID [2022-02-20 19:58:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {45617#true} havoc ~__retres1~1; {45617#true} is VALID [2022-02-20 19:58:52,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume !(1 == ~c_dr_pc~0); {45617#true} is VALID [2022-02-20 19:58:52,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} ~__retres1~1 := 0; {45617#true} is VALID [2022-02-20 19:58:52,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {45617#true} #res := ~__retres1~1; {45617#true} is VALID [2022-02-20 19:58:52,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,854 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45617#true} {45617#true} #1994#return; {45617#true} is VALID [2022-02-20 19:58:52,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {45659#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L272 TraceCheckUtils]: 1: Hoare triple {45617#true} call #t~ret8 := is_do_write_p_triggered(); {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} havoc ~__retres1~0; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {45617#true} assume !(1 == ~p_dw_pc~0); {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {45617#true} ~__retres1~0 := 0; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {45617#true} #res := ~__retres1~0; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45617#true} {45617#true} #1992#return; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {45617#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45617#true} is VALID [2022-02-20 19:58:52,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {45617#true} assume !(0 != ~tmp~1); {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L272 TraceCheckUtils]: 10: Hoare triple {45617#true} call #t~ret9 := is_do_read_c_triggered(); {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {45617#true} havoc ~__retres1~1; {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {45617#true} assume !(1 == ~c_dr_pc~0); {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {45617#true} ~__retres1~1 := 0; {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {45617#true} #res := ~__retres1~1; {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45617#true} {45617#true} #1994#return; {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {45617#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45617#true} is VALID [2022-02-20 19:58:52,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {45617#true} assume !(0 != ~tmp___0~1); {45617#true} is VALID [2022-02-20 19:58:52,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,857 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #2000#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {45658#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume !(1 == ~q_write_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #2002#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {45617#true} havoc ~__retres1~2; {45617#true} is VALID [2022-02-20 19:58:52,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45617#true} is VALID [2022-02-20 19:58:52,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} #res := ~__retres1~2; {45617#true} is VALID [2022-02-20 19:58:52,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,863 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #2004#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {45617#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {45617#true} is VALID [2022-02-20 19:58:52,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {45617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {45617#true} is VALID [2022-02-20 19:58:52,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {45617#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {45619#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {45619#(= ~q_free~0 1)} call update_channels1(); {45657#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:52,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {45657#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {45617#true} is VALID [2022-02-20 19:58:52,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,865 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #1996#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {45619#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {45619#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {45619#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {45619#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {45619#(= ~q_free~0 1)} call fire_delta_events1(); {45658#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:52,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {45658#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {45617#true} assume !(0 == ~q_write_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,867 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #1998#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,867 INFO L272 TraceCheckUtils]: 17: Hoare triple {45619#(= ~q_free~0 1)} call activate_threads1(); {45659#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:52,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {45659#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {45617#true} is VALID [2022-02-20 19:58:52,867 INFO L272 TraceCheckUtils]: 19: Hoare triple {45617#true} call #t~ret8 := is_do_write_p_triggered(); {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {45617#true} havoc ~__retres1~0; {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {45617#true} assume !(1 == ~p_dw_pc~0); {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {45617#true} ~__retres1~0 := 0; {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {45617#true} #res := ~__retres1~0; {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45617#true} {45617#true} #1992#return; {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {45617#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {45617#true} assume !(0 != ~tmp~1); {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {45617#true} call #t~ret9 := is_do_read_c_triggered(); {45617#true} is VALID [2022-02-20 19:58:52,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {45617#true} havoc ~__retres1~1; {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {45617#true} assume !(1 == ~c_dr_pc~0); {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {45617#true} ~__retres1~1 := 0; {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {45617#true} #res := ~__retres1~1; {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45617#true} {45617#true} #1994#return; {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {45617#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {45617#true} assume !(0 != ~tmp___0~1); {45617#true} is VALID [2022-02-20 19:58:52,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,870 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #2000#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,870 INFO L272 TraceCheckUtils]: 39: Hoare triple {45619#(= ~q_free~0 1)} call reset_delta_events1(); {45658#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:52,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {45658#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {45617#true} assume !(1 == ~q_write_ev~0); {45617#true} is VALID [2022-02-20 19:58:52,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,871 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #2002#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {45619#(= ~q_free~0 1)} assume !false; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {45619#(= ~q_free~0 1)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {45619#(= ~q_free~0 1)} assume !false; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,871 INFO L272 TraceCheckUtils]: 47: Hoare triple {45619#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45617#true} is VALID [2022-02-20 19:58:52,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {45617#true} havoc ~__retres1~2; {45617#true} is VALID [2022-02-20 19:58:52,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {45617#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45617#true} is VALID [2022-02-20 19:58:52,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {45617#true} #res := ~__retres1~2; {45617#true} is VALID [2022-02-20 19:58:52,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {45617#true} assume true; {45617#true} is VALID [2022-02-20 19:58:52,872 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {45617#true} {45619#(= ~q_free~0 1)} #2004#return; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {45619#(= ~q_free~0 1)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {45619#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {45619#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {45619#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {45619#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {45619#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {45619#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {45619#(= ~q_free~0 1)} assume !false; {45619#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:52,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {45619#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {45618#false} is VALID [2022-02-20 19:58:52,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {45618#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {45618#false} is VALID [2022-02-20 19:58:52,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {45618#false} assume !(~p_last_write~0 == ~c_last_read~0); {45618#false} is VALID [2022-02-20 19:58:52,875 INFO L272 TraceCheckUtils]: 64: Hoare triple {45618#false} call error1(); {45618#false} is VALID [2022-02-20 19:58:52,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {45618#false} assume !false; {45618#false} is VALID [2022-02-20 19:58:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:52,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:52,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353308729] [2022-02-20 19:58:52,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353308729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:52,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:52,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:52,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145846190] [2022-02-20 19:58:52,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:52,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:52,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:52,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:52,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:52,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:52,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:52,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:52,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:52,915 INFO L87 Difference]: Start difference. First operand 2784 states and 3624 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,260 INFO L93 Difference]: Finished difference Result 6236 states and 7956 transitions. [2022-02-20 19:58:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:56,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1033 transitions. [2022-02-20 19:58:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1033 transitions. [2022-02-20 19:58:56,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1033 transitions. [2022-02-20 19:58:56,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1033 edges. 1033 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,263 INFO L225 Difference]: With dead ends: 6236 [2022-02-20 19:58:57,264 INFO L226 Difference]: Without dead ends: 3873 [2022-02-20 19:58:57,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:57,267 INFO L933 BasicCegarLoop]: 760 mSDtfsCounter, 1244 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:57,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1253 Valid, 1807 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2022-02-20 19:58:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3617. [2022-02-20 19:58:57,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:57,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3873 states. Second operand has 3617 states, 2869 states have (on average 1.295224817009411) internal successors, (3716), 2921 states have internal predecessors, (3716), 376 states have call successors, (376), 299 states have call predecessors, (376), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:57,451 INFO L74 IsIncluded]: Start isIncluded. First operand 3873 states. Second operand has 3617 states, 2869 states have (on average 1.295224817009411) internal successors, (3716), 2921 states have internal predecessors, (3716), 376 states have call successors, (376), 299 states have call predecessors, (376), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:57,454 INFO L87 Difference]: Start difference. First operand 3873 states. Second operand has 3617 states, 2869 states have (on average 1.295224817009411) internal successors, (3716), 2921 states have internal predecessors, (3716), 376 states have call successors, (376), 299 states have call predecessors, (376), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,850 INFO L93 Difference]: Finished difference Result 3873 states and 4929 transitions. [2022-02-20 19:58:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 4929 transitions. [2022-02-20 19:58:57,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:57,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:57,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 3617 states, 2869 states have (on average 1.295224817009411) internal successors, (3716), 2921 states have internal predecessors, (3716), 376 states have call successors, (376), 299 states have call predecessors, (376), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) Second operand 3873 states. [2022-02-20 19:58:57,863 INFO L87 Difference]: Start difference. First operand has 3617 states, 2869 states have (on average 1.295224817009411) internal successors, (3716), 2921 states have internal predecessors, (3716), 376 states have call successors, (376), 299 states have call predecessors, (376), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) Second operand 3873 states. [2022-02-20 19:58:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,262 INFO L93 Difference]: Finished difference Result 3873 states and 4929 transitions. [2022-02-20 19:58:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 4929 transitions. [2022-02-20 19:58:58,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:58,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:58,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:58,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 2869 states have (on average 1.295224817009411) internal successors, (3716), 2921 states have internal predecessors, (3716), 376 states have call successors, (376), 299 states have call predecessors, (376), 370 states have return successors, (533), 401 states have call predecessors, (533), 374 states have call successors, (533) [2022-02-20 19:58:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 4625 transitions. [2022-02-20 19:58:58,769 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 4625 transitions. Word has length 66 [2022-02-20 19:58:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:58,769 INFO L470 AbstractCegarLoop]: Abstraction has 3617 states and 4625 transitions. [2022-02-20 19:58:58,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 4625 transitions. [2022-02-20 19:58:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:58,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:58,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:58,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:58,775 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash 96985182, now seen corresponding path program 1 times [2022-02-20 19:58:58,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:58,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338208881] [2022-02-20 19:58:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {66674#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {66634#true} is VALID [2022-02-20 19:58:58,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #1996#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {66675#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume !(0 == ~q_write_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #1998#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {66634#true} havoc ~__retres1~0; {66634#true} is VALID [2022-02-20 19:58:58,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume !(1 == ~p_dw_pc~0); {66634#true} is VALID [2022-02-20 19:58:58,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} ~__retres1~0 := 0; {66634#true} is VALID [2022-02-20 19:58:58,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {66634#true} #res := ~__retres1~0; {66634#true} is VALID [2022-02-20 19:58:58,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,842 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66634#true} {66634#true} #1992#return; {66634#true} is VALID [2022-02-20 19:58:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {66634#true} havoc ~__retres1~1; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume !(1 == ~c_dr_pc~0); {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} ~__retres1~1 := 0; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {66634#true} #res := ~__retres1~1; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66634#true} {66634#true} #1994#return; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {66676#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L272 TraceCheckUtils]: 1: Hoare triple {66634#true} call #t~ret8 := is_do_write_p_triggered(); {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} havoc ~__retres1~0; {66634#true} is VALID [2022-02-20 19:58:58,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {66634#true} assume !(1 == ~p_dw_pc~0); {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {66634#true} ~__retres1~0 := 0; {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {66634#true} #res := ~__retres1~0; {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66634#true} {66634#true} #1992#return; {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {66634#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {66634#true} assume !(0 != ~tmp~1); {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L272 TraceCheckUtils]: 10: Hoare triple {66634#true} call #t~ret9 := is_do_read_c_triggered(); {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {66634#true} havoc ~__retres1~1; {66634#true} is VALID [2022-02-20 19:58:58,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {66634#true} assume !(1 == ~c_dr_pc~0); {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {66634#true} ~__retres1~1 := 0; {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {66634#true} #res := ~__retres1~1; {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66634#true} {66634#true} #1994#return; {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {66634#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {66634#true} assume !(0 != ~tmp___0~1); {66634#true} is VALID [2022-02-20 19:58:58,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,850 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #2000#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {66675#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume !(1 == ~q_write_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #2002#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {66634#true} havoc ~__retres1~2; {66634#true} is VALID [2022-02-20 19:58:58,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66634#true} is VALID [2022-02-20 19:58:58,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} #res := ~__retres1~2; {66634#true} is VALID [2022-02-20 19:58:58,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,865 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #2004#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {66634#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {66634#true} is VALID [2022-02-20 19:58:58,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {66634#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {66634#true} is VALID [2022-02-20 19:58:58,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {66634#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {66636#(= ~p_dw_pc~0 0)} call update_channels1(); {66674#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:58,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {66674#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {66634#true} is VALID [2022-02-20 19:58:58,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,867 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #1996#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,868 INFO L272 TraceCheckUtils]: 12: Hoare triple {66636#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {66675#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:58,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {66675#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {66634#true} assume !(0 == ~q_write_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,869 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #1998#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,869 INFO L272 TraceCheckUtils]: 17: Hoare triple {66636#(= ~p_dw_pc~0 0)} call activate_threads1(); {66676#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:58,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {66676#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L272 TraceCheckUtils]: 19: Hoare triple {66634#true} call #t~ret8 := is_do_write_p_triggered(); {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {66634#true} havoc ~__retres1~0; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {66634#true} assume !(1 == ~p_dw_pc~0); {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {66634#true} ~__retres1~0 := 0; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {66634#true} #res := ~__retres1~0; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {66634#true} {66634#true} #1992#return; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {66634#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66634#true} is VALID [2022-02-20 19:58:58,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {66634#true} assume !(0 != ~tmp~1); {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L272 TraceCheckUtils]: 28: Hoare triple {66634#true} call #t~ret9 := is_do_read_c_triggered(); {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {66634#true} havoc ~__retres1~1; {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {66634#true} assume !(1 == ~c_dr_pc~0); {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {66634#true} ~__retres1~1 := 0; {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {66634#true} #res := ~__retres1~1; {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {66634#true} {66634#true} #1994#return; {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {66634#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66634#true} is VALID [2022-02-20 19:58:58,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {66634#true} assume !(0 != ~tmp___0~1); {66634#true} is VALID [2022-02-20 19:58:58,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,872 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #2000#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,872 INFO L272 TraceCheckUtils]: 39: Hoare triple {66636#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {66675#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:58,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {66675#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {66634#true} assume !(1 == ~q_write_ev~0); {66634#true} is VALID [2022-02-20 19:58:58,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,873 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #2002#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume !false; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {66636#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume !false; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,874 INFO L272 TraceCheckUtils]: 47: Hoare triple {66636#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66634#true} is VALID [2022-02-20 19:58:58,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {66634#true} havoc ~__retres1~2; {66634#true} is VALID [2022-02-20 19:58:58,874 INFO L290 TraceCheckUtils]: 49: Hoare triple {66634#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66634#true} is VALID [2022-02-20 19:58:58,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {66634#true} #res := ~__retres1~2; {66634#true} is VALID [2022-02-20 19:58:58,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {66634#true} assume true; {66634#true} is VALID [2022-02-20 19:58:58,874 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {66634#true} {66636#(= ~p_dw_pc~0 0)} #2004#return; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {66636#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {66636#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {66635#false} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {66635#false} assume 1 == ~p_dw_pc~0; {66635#false} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {66635#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {66635#false} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {66635#false} assume !false; {66635#false} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {66635#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66635#false} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {66635#false} assume { :end_inline_do_write_p } true; {66635#false} is VALID [2022-02-20 19:58:58,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {66635#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {66635#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {66635#false} assume 0 == ~c_dr_pc~0; {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {66635#false} assume !false; {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {66635#false} assume !(1 == ~q_free~0); {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {66635#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {66635#false} assume !(~p_last_write~0 == ~c_last_read~0); {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L272 TraceCheckUtils]: 70: Hoare triple {66635#false} call error1(); {66635#false} is VALID [2022-02-20 19:58:58,877 INFO L290 TraceCheckUtils]: 71: Hoare triple {66635#false} assume !false; {66635#false} is VALID [2022-02-20 19:58:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:58,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:58,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338208881] [2022-02-20 19:58:58,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338208881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:58,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:58,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:58,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412508014] [2022-02-20 19:58:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:58,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:58,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:58,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:58,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:58,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:58,928 INFO L87 Difference]: Start difference. First operand 3617 states and 4625 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:03,009 INFO L93 Difference]: Finished difference Result 7628 states and 9599 transitions. [2022-02-20 19:59:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:59:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1030 transitions. [2022-02-20 19:59:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1030 transitions. [2022-02-20 19:59:03,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1030 transitions. [2022-02-20 19:59:03,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1030 edges. 1030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:04,552 INFO L225 Difference]: With dead ends: 7628 [2022-02-20 19:59:04,552 INFO L226 Difference]: Without dead ends: 4428 [2022-02-20 19:59:04,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:04,557 INFO L933 BasicCegarLoop]: 775 mSDtfsCounter, 1453 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:04,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1884 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2022-02-20 19:59:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4180. [2022-02-20 19:59:04,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:04,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4428 states. Second operand has 4180 states, 3316 states have (on average 1.2855850422195416) internal successors, (4263), 3374 states have internal predecessors, (4263), 432 states have call successors, (432), 349 states have call predecessors, (432), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:04,800 INFO L74 IsIncluded]: Start isIncluded. First operand 4428 states. Second operand has 4180 states, 3316 states have (on average 1.2855850422195416) internal successors, (4263), 3374 states have internal predecessors, (4263), 432 states have call successors, (432), 349 states have call predecessors, (432), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:04,807 INFO L87 Difference]: Start difference. First operand 4428 states. Second operand has 4180 states, 3316 states have (on average 1.2855850422195416) internal successors, (4263), 3374 states have internal predecessors, (4263), 432 states have call successors, (432), 349 states have call predecessors, (432), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,357 INFO L93 Difference]: Finished difference Result 4428 states and 5596 transitions. [2022-02-20 19:59:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 5596 transitions. [2022-02-20 19:59:05,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:05,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:05,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 4180 states, 3316 states have (on average 1.2855850422195416) internal successors, (4263), 3374 states have internal predecessors, (4263), 432 states have call successors, (432), 349 states have call predecessors, (432), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) Second operand 4428 states. [2022-02-20 19:59:05,376 INFO L87 Difference]: Start difference. First operand has 4180 states, 3316 states have (on average 1.2855850422195416) internal successors, (4263), 3374 states have internal predecessors, (4263), 432 states have call successors, (432), 349 states have call predecessors, (432), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) Second operand 4428 states. [2022-02-20 19:59:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,040 INFO L93 Difference]: Finished difference Result 4428 states and 5596 transitions. [2022-02-20 19:59:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 5596 transitions. [2022-02-20 19:59:06,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:06,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4180 states, 3316 states have (on average 1.2855850422195416) internal successors, (4263), 3374 states have internal predecessors, (4263), 432 states have call successors, (432), 349 states have call predecessors, (432), 430 states have return successors, (610), 461 states have call predecessors, (610), 430 states have call successors, (610) [2022-02-20 19:59:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 4180 states and 5305 transitions. [2022-02-20 19:59:06,793 INFO L78 Accepts]: Start accepts. Automaton has 4180 states and 5305 transitions. Word has length 72 [2022-02-20 19:59:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:06,793 INFO L470 AbstractCegarLoop]: Abstraction has 4180 states and 5305 transitions. [2022-02-20 19:59:06,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4180 states and 5305 transitions. [2022-02-20 19:59:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:59:06,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,795 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:06,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:06,795 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1805429828, now seen corresponding path program 1 times [2022-02-20 19:59:06,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:06,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662909248] [2022-02-20 19:59:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {91442#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {91401#true} is VALID [2022-02-20 19:59:06,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91401#true} {91401#true} #1996#return; {91401#true} is VALID [2022-02-20 19:59:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {91443#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume !(0 == ~q_write_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91401#true} {91401#true} #1998#return; {91401#true} is VALID [2022-02-20 19:59:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {91401#true} havoc ~__retres1~0; {91401#true} is VALID [2022-02-20 19:59:06,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume !(1 == ~p_dw_pc~0); {91401#true} is VALID [2022-02-20 19:59:06,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} ~__retres1~0 := 0; {91401#true} is VALID [2022-02-20 19:59:06,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {91401#true} #res := ~__retres1~0; {91401#true} is VALID [2022-02-20 19:59:06,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,874 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91401#true} {91401#true} #1992#return; {91401#true} is VALID [2022-02-20 19:59:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {91401#true} havoc ~__retres1~1; {91401#true} is VALID [2022-02-20 19:59:06,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume !(1 == ~c_dr_pc~0); {91401#true} is VALID [2022-02-20 19:59:06,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} ~__retres1~1 := 0; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {91401#true} #res := ~__retres1~1; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91401#true} {91401#true} #1994#return; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {91444#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L272 TraceCheckUtils]: 1: Hoare triple {91401#true} call #t~ret8 := is_do_write_p_triggered(); {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} havoc ~__retres1~0; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {91401#true} assume !(1 == ~p_dw_pc~0); {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {91401#true} ~__retres1~0 := 0; {91401#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {91401#true} #res := ~__retres1~0; {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91401#true} {91401#true} #1992#return; {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {91401#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {91401#true} assume !(0 != ~tmp~1); {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L272 TraceCheckUtils]: 10: Hoare triple {91401#true} call #t~ret9 := is_do_read_c_triggered(); {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {91401#true} havoc ~__retres1~1; {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {91401#true} assume !(1 == ~c_dr_pc~0); {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {91401#true} ~__retres1~1 := 0; {91401#true} is VALID [2022-02-20 19:59:06,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {91401#true} #res := ~__retres1~1; {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91401#true} {91401#true} #1994#return; {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {91401#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {91401#true} assume !(0 != ~tmp___0~1); {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {91401#true} {91401#true} #2000#return; {91401#true} is VALID [2022-02-20 19:59:06,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {91443#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume !(1 == ~q_write_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91401#true} {91401#true} #2002#return; {91401#true} is VALID [2022-02-20 19:59:06,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {91401#true} havoc ~__retres1~2; {91401#true} is VALID [2022-02-20 19:59:06,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {91401#true} is VALID [2022-02-20 19:59:06,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} #res := ~__retres1~2; {91401#true} is VALID [2022-02-20 19:59:06,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,890 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91401#true} {91401#true} #2004#return; {91401#true} is VALID [2022-02-20 19:59:06,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {91401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {91401#true} is VALID [2022-02-20 19:59:06,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {91401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {91401#true} is VALID [2022-02-20 19:59:06,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {91401#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {91401#true} is VALID [2022-02-20 19:59:06,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {91401#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {91401#true} is VALID [2022-02-20 19:59:06,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {91401#true} call update_channels1(); {91442#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:06,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {91442#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {91401#true} is VALID [2022-02-20 19:59:06,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,891 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91401#true} {91401#true} #1996#return; {91401#true} is VALID [2022-02-20 19:59:06,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {91401#true} assume { :begin_inline_init_threads1 } true; {91401#true} is VALID [2022-02-20 19:59:06,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {91401#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {91401#true} is VALID [2022-02-20 19:59:06,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {91401#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {91401#true} is VALID [2022-02-20 19:59:06,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {91401#true} assume { :end_inline_init_threads1 } true; {91401#true} is VALID [2022-02-20 19:59:06,892 INFO L272 TraceCheckUtils]: 12: Hoare triple {91401#true} call fire_delta_events1(); {91443#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {91443#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {91401#true} assume !(0 == ~q_write_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,892 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91401#true} {91401#true} #1998#return; {91401#true} is VALID [2022-02-20 19:59:06,893 INFO L272 TraceCheckUtils]: 17: Hoare triple {91401#true} call activate_threads1(); {91444#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:06,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {91444#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {91401#true} is VALID [2022-02-20 19:59:06,893 INFO L272 TraceCheckUtils]: 19: Hoare triple {91401#true} call #t~ret8 := is_do_write_p_triggered(); {91401#true} is VALID [2022-02-20 19:59:06,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {91401#true} havoc ~__retres1~0; {91401#true} is VALID [2022-02-20 19:59:06,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {91401#true} assume !(1 == ~p_dw_pc~0); {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {91401#true} ~__retres1~0 := 0; {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {91401#true} #res := ~__retres1~0; {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {91401#true} {91401#true} #1992#return; {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {91401#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {91401#true} assume !(0 != ~tmp~1); {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L272 TraceCheckUtils]: 28: Hoare triple {91401#true} call #t~ret9 := is_do_read_c_triggered(); {91401#true} is VALID [2022-02-20 19:59:06,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {91401#true} havoc ~__retres1~1; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {91401#true} assume !(1 == ~c_dr_pc~0); {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {91401#true} ~__retres1~1 := 0; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {91401#true} #res := ~__retres1~1; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {91401#true} {91401#true} #1994#return; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {91401#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {91401#true} assume !(0 != ~tmp___0~1); {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,895 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {91401#true} {91401#true} #2000#return; {91401#true} is VALID [2022-02-20 19:59:06,896 INFO L272 TraceCheckUtils]: 39: Hoare triple {91401#true} call reset_delta_events1(); {91443#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {91443#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {91401#true} assume !(1 == ~q_write_ev~0); {91401#true} is VALID [2022-02-20 19:59:06,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,896 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {91401#true} {91401#true} #2002#return; {91401#true} is VALID [2022-02-20 19:59:06,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {91401#true} assume !false; {91401#true} is VALID [2022-02-20 19:59:06,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {91401#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {91401#true} assume !false; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L272 TraceCheckUtils]: 47: Hoare triple {91401#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {91401#true} havoc ~__retres1~2; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {91401#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {91401#true} #res := ~__retres1~2; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {91401#true} assume true; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {91401#true} {91401#true} #2004#return; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {91401#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {91401#true} assume 0 != eval1_~tmp___1~0#1; {91401#true} is VALID [2022-02-20 19:59:06,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {91401#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {91401#true} is VALID [2022-02-20 19:59:06,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {91401#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {91401#true} is VALID [2022-02-20 19:59:06,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {91401#true} assume 0 == ~p_dw_pc~0; {91401#true} is VALID [2022-02-20 19:59:06,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {91401#true} assume !false; {91401#true} is VALID [2022-02-20 19:59:06,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {91401#true} assume !(0 == ~q_free~0); {91401#true} is VALID [2022-02-20 19:59:06,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {91401#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,899 INFO L290 TraceCheckUtils]: 61: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,899 INFO L290 TraceCheckUtils]: 63: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {91440#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:06,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {91440#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {91441#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:59:06,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {91441#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {91402#false} is VALID [2022-02-20 19:59:06,902 INFO L272 TraceCheckUtils]: 71: Hoare triple {91402#false} call error1(); {91402#false} is VALID [2022-02-20 19:59:06,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {91402#false} assume !false; {91402#false} is VALID [2022-02-20 19:59:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:06,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:06,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662909248] [2022-02-20 19:59:06,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662909248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:06,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:06,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:06,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865277875] [2022-02-20 19:59:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:59:06,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:06,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:06,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:06,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:06,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:06,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:06,948 INFO L87 Difference]: Start difference. First operand 4180 states and 5305 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,371 INFO L93 Difference]: Finished difference Result 5249 states and 6589 transitions. [2022-02-20 19:59:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:59:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 913 transitions. [2022-02-20 19:59:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 913 transitions. [2022-02-20 19:59:10,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 913 transitions. [2022-02-20 19:59:11,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 913 edges. 913 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,212 INFO L225 Difference]: With dead ends: 5249 [2022-02-20 19:59:12,212 INFO L226 Difference]: Without dead ends: 5246 [2022-02-20 19:59:12,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:59:12,220 INFO L933 BasicCegarLoop]: 770 mSDtfsCounter, 2184 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:12,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2194 Valid, 1860 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-02-20 19:59:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4937. [2022-02-20 19:59:12,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5246 states. Second operand has 4937 states, 3894 states have (on average 1.273497688751926) internal successors, (4959), 3959 states have internal predecessors, (4959), 515 states have call successors, (515), 421 states have call predecessors, (515), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:12,538 INFO L74 IsIncluded]: Start isIncluded. First operand 5246 states. Second operand has 4937 states, 3894 states have (on average 1.273497688751926) internal successors, (4959), 3959 states have internal predecessors, (4959), 515 states have call successors, (515), 421 states have call predecessors, (515), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:12,543 INFO L87 Difference]: Start difference. First operand 5246 states. Second operand has 4937 states, 3894 states have (on average 1.273497688751926) internal successors, (4959), 3959 states have internal predecessors, (4959), 515 states have call successors, (515), 421 states have call predecessors, (515), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:13,280 INFO L93 Difference]: Finished difference Result 5246 states and 6569 transitions. [2022-02-20 19:59:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 6569 transitions. [2022-02-20 19:59:13,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:13,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:13,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 3894 states have (on average 1.273497688751926) internal successors, (4959), 3959 states have internal predecessors, (4959), 515 states have call successors, (515), 421 states have call predecessors, (515), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) Second operand 5246 states. [2022-02-20 19:59:13,297 INFO L87 Difference]: Start difference. First operand has 4937 states, 3894 states have (on average 1.273497688751926) internal successors, (4959), 3959 states have internal predecessors, (4959), 515 states have call successors, (515), 421 states have call predecessors, (515), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) Second operand 5246 states. [2022-02-20 19:59:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,100 INFO L93 Difference]: Finished difference Result 5246 states and 6569 transitions. [2022-02-20 19:59:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 6569 transitions. [2022-02-20 19:59:14,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:14,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 3894 states have (on average 1.273497688751926) internal successors, (4959), 3959 states have internal predecessors, (4959), 515 states have call successors, (515), 421 states have call predecessors, (515), 526 states have return successors, (738), 561 states have call predecessors, (738), 514 states have call successors, (738) [2022-02-20 19:59:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 6212 transitions. [2022-02-20 19:59:15,176 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 6212 transitions. Word has length 73 [2022-02-20 19:59:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:15,176 INFO L470 AbstractCegarLoop]: Abstraction has 4937 states and 6212 transitions. [2022-02-20 19:59:15,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 6212 transitions. [2022-02-20 19:59:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:59:15,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:15,178 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:15,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:59:15,178 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -135256984, now seen corresponding path program 1 times [2022-02-20 19:59:15,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:15,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644003985] [2022-02-20 19:59:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {115628#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {115586#true} is VALID [2022-02-20 19:59:15,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1996#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {115629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume !(0 == ~q_write_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1998#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {115586#true} havoc ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:15,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume !(1 == ~p_dw_pc~0); {115586#true} is VALID [2022-02-20 19:59:15,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} ~__retres1~0 := 0; {115586#true} is VALID [2022-02-20 19:59:15,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {115586#true} #res := ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:15,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,262 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {115586#true} {115586#true} #1992#return; {115586#true} is VALID [2022-02-20 19:59:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {115586#true} havoc ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:15,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume !(1 == ~c_dr_pc~0); {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} ~__retres1~1 := 0; {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {115586#true} #res := ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {115586#true} {115586#true} #1994#return; {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {115630#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L272 TraceCheckUtils]: 1: Hoare triple {115586#true} call #t~ret8 := is_do_write_p_triggered(); {115586#true} is VALID [2022-02-20 19:59:15,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} havoc ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {115586#true} assume !(1 == ~p_dw_pc~0); {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {115586#true} ~__retres1~0 := 0; {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {115586#true} #res := ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115586#true} {115586#true} #1992#return; {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {115586#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115586#true} is VALID [2022-02-20 19:59:15,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {115586#true} assume !(0 != ~tmp~1); {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {115586#true} call #t~ret9 := is_do_read_c_triggered(); {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {115586#true} havoc ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {115586#true} assume !(1 == ~c_dr_pc~0); {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {115586#true} ~__retres1~1 := 0; {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {115586#true} #res := ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115586#true} {115586#true} #1994#return; {115586#true} is VALID [2022-02-20 19:59:15,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {115586#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115586#true} is VALID [2022-02-20 19:59:15,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {115586#true} assume !(0 != ~tmp___0~1); {115586#true} is VALID [2022-02-20 19:59:15,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,269 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2000#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {115629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume !(1 == ~q_write_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2002#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {115586#true} havoc ~__retres1~2; {115586#true} is VALID [2022-02-20 19:59:15,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115586#true} is VALID [2022-02-20 19:59:15,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} #res := ~__retres1~2; {115586#true} is VALID [2022-02-20 19:59:15,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,280 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2004#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {115586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {115586#true} is VALID [2022-02-20 19:59:15,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {115586#true} is VALID [2022-02-20 19:59:15,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {115628#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:15,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {115628#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {115586#true} is VALID [2022-02-20 19:59:15,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,282 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1996#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,284 INFO L272 TraceCheckUtils]: 12: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {115629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:15,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {115629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {115586#true} assume !(0 == ~q_write_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,285 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1998#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,286 INFO L272 TraceCheckUtils]: 17: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {115630#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:15,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {115630#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {115586#true} is VALID [2022-02-20 19:59:15,286 INFO L272 TraceCheckUtils]: 19: Hoare triple {115586#true} call #t~ret8 := is_do_write_p_triggered(); {115586#true} is VALID [2022-02-20 19:59:15,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {115586#true} havoc ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:15,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {115586#true} assume !(1 == ~p_dw_pc~0); {115586#true} is VALID [2022-02-20 19:59:15,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {115586#true} ~__retres1~0 := 0; {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {115586#true} #res := ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {115586#true} {115586#true} #1992#return; {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {115586#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {115586#true} assume !(0 != ~tmp~1); {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L272 TraceCheckUtils]: 28: Hoare triple {115586#true} call #t~ret9 := is_do_read_c_triggered(); {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {115586#true} havoc ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:15,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {115586#true} assume !(1 == ~c_dr_pc~0); {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {115586#true} ~__retres1~1 := 0; {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {115586#true} #res := ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {115586#true} {115586#true} #1994#return; {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {115586#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {115586#true} assume !(0 != ~tmp___0~1); {115586#true} is VALID [2022-02-20 19:59:15,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,289 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2000#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,289 INFO L272 TraceCheckUtils]: 39: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {115629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:15,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {115629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {115586#true} assume !(1 == ~q_write_ev~0); {115586#true} is VALID [2022-02-20 19:59:15,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,290 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2002#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,292 INFO L272 TraceCheckUtils]: 47: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {115586#true} is VALID [2022-02-20 19:59:15,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {115586#true} havoc ~__retres1~2; {115586#true} is VALID [2022-02-20 19:59:15,292 INFO L290 TraceCheckUtils]: 49: Hoare triple {115586#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115586#true} is VALID [2022-02-20 19:59:15,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {115586#true} #res := ~__retres1~2; {115586#true} is VALID [2022-02-20 19:59:15,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:15,293 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {115586#true} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2004#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:15,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,297 INFO L290 TraceCheckUtils]: 62: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,297 INFO L290 TraceCheckUtils]: 63: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,299 INFO L290 TraceCheckUtils]: 67: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:15,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:15,301 INFO L290 TraceCheckUtils]: 70: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:15,301 INFO L290 TraceCheckUtils]: 71: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {115587#false} is VALID [2022-02-20 19:59:15,301 INFO L272 TraceCheckUtils]: 72: Hoare triple {115587#false} call error1(); {115587#false} is VALID [2022-02-20 19:59:15,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {115587#false} assume !false; {115587#false} is VALID [2022-02-20 19:59:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:15,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:15,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644003985] [2022-02-20 19:59:15,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644003985] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:59:15,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530953239] [2022-02-20 19:59:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:15,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:59:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:15,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:59:15,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:59:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:59:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:16,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {115586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {115586#true} is VALID [2022-02-20 19:59:16,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {115586#true} is VALID [2022-02-20 19:59:16,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,153 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1996#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,155 INFO L272 TraceCheckUtils]: 12: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,156 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1998#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,157 INFO L272 TraceCheckUtils]: 17: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,160 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1992#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,166 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1994#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,167 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2000#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,168 INFO L272 TraceCheckUtils]: 39: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,169 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2002#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,170 INFO L272 TraceCheckUtils]: 47: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,172 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #2004#return; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:16,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {115588#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,176 INFO L290 TraceCheckUtils]: 63: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {115626#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {115853#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {115853#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume ~p_last_write~0 == ~c_last_read~0; {115853#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:16,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {115853#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(~p_num_write~0 == ~c_num_read~0); {115587#false} is VALID [2022-02-20 19:59:16,179 INFO L272 TraceCheckUtils]: 72: Hoare triple {115587#false} call error1(); {115587#false} is VALID [2022-02-20 19:59:16,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {115587#false} assume !false; {115587#false} is VALID [2022-02-20 19:59:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:16,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:59:16,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {115587#false} assume !false; {115587#false} is VALID [2022-02-20 19:59:16,646 INFO L272 TraceCheckUtils]: 72: Hoare triple {115587#false} call error1(); {115587#false} is VALID [2022-02-20 19:59:16,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {115587#false} is VALID [2022-02-20 19:59:16,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,648 INFO L290 TraceCheckUtils]: 67: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume { :end_inline_do_write_p } true; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,651 INFO L290 TraceCheckUtils]: 61: Hoare triple {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {115878#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:16,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp___1~0#1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,656 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {115586#true} {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2004#return; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {115586#true} #res := ~__retres1~2; {115586#true} is VALID [2022-02-20 19:59:16,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {115586#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {115586#true} is VALID [2022-02-20 19:59:16,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {115586#true} havoc ~__retres1~2; {115586#true} is VALID [2022-02-20 19:59:16,656 INFO L272 TraceCheckUtils]: 47: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {115586#true} is VALID [2022-02-20 19:59:16,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,657 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {115586#true} {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2002#return; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {115586#true} assume !(1 == ~q_write_ev~0); {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {115586#true} assume !(1 == ~q_read_ev~0); {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L272 TraceCheckUtils]: 39: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {115586#true} {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #2000#return; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {115586#true} assume !(0 != ~tmp___0~1); {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {115586#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {115586#true} {115586#true} #1994#return; {115586#true} is VALID [2022-02-20 19:59:16,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {115586#true} #res := ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {115586#true} ~__retres1~1 := 0; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {115586#true} assume !(1 == ~c_dr_pc~0); {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {115586#true} havoc ~__retres1~1; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L272 TraceCheckUtils]: 28: Hoare triple {115586#true} call #t~ret9 := is_do_read_c_triggered(); {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {115586#true} assume !(0 != ~tmp~1); {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {115586#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {115586#true} {115586#true} #1992#return; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {115586#true} #res := ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {115586#true} ~__retres1~0 := 0; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {115586#true} assume !(1 == ~p_dw_pc~0); {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {115586#true} havoc ~__retres1~0; {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L272 TraceCheckUtils]: 19: Hoare triple {115586#true} call #t~ret8 := is_do_write_p_triggered(); {115586#true} is VALID [2022-02-20 19:59:16,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {115586#true} havoc ~tmp~1;havoc ~tmp___0~1; {115586#true} is VALID [2022-02-20 19:59:16,660 INFO L272 TraceCheckUtils]: 17: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {115586#true} is VALID [2022-02-20 19:59:16,660 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {115586#true} {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1998#return; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {115586#true} assume !(0 == ~q_write_ev~0); {115586#true} is VALID [2022-02-20 19:59:16,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {115586#true} assume !(0 == ~q_read_ev~0); {115586#true} is VALID [2022-02-20 19:59:16,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {115586#true} is VALID [2022-02-20 19:59:16,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,662 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {115586#true} {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1996#return; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {115586#true} assume true; {115586#true} is VALID [2022-02-20 19:59:16,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {115586#true} assume !(1 == ~q_req_up~0); {115586#true} is VALID [2022-02-20 19:59:16,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {115586#true} is VALID [2022-02-20 19:59:16,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {115586#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {115627#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:16,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {115586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {115586#true} is VALID [2022-02-20 19:59:16,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {115586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {115586#true} is VALID [2022-02-20 19:59:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:16,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530953239] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:59:16,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:59:16,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:59:16,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105337821] [2022-02-20 19:59:16,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:59:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:59:16,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:59:16,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:16,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:16,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:16,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:16,812 INFO L87 Difference]: Start difference. First operand 4937 states and 6212 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)