./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.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.06.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 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:12,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:12,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:12,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:12,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:12,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:12,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:12,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:12,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:12,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:12,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:12,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:12,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:12,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:12,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:12,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:12,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:12,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:12,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:12,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:12,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:12,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:12,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:12,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:12,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:12,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:12,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:12,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:12,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:12,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:12,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:12,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:12,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:12,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:12,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:12,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:12,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:12,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:12,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:12,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:12,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:12,134 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:57:12,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:12,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:12,166 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:12,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:12,167 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:12,167 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:12,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:12,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:12,168 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:12,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:12,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:12,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:12,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:12,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:12,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:12,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:12,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:12,171 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:12,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:12,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:12,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:12,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:12,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:12,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:12,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:12,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:12,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:12,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:12,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:12,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:12,173 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:12,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:12,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:12,174 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 -> 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e [2022-02-20 19:57:12,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:12,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:12,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:12,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:12,361 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:12,362 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.06.cil-2.c [2022-02-20 19:57:12,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af80bc97/536814b2a03c46a3b46a4194089343d1/FLAG7001d7c27 [2022-02-20 19:57:12,801 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:12,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-02-20 19:57:12,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af80bc97/536814b2a03c46a3b46a4194089343d1/FLAG7001d7c27 [2022-02-20 19:57:12,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af80bc97/536814b2a03c46a3b46a4194089343d1 [2022-02-20 19:57:12,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:12,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:12,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:12,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:12,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:12,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:12" (1/1) ... [2022-02-20 19:57:12,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4623a019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:12, skipping insertion in model container [2022-02-20 19:57:12,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:12" (1/1) ... [2022-02-20 19:57:12,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:12,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:13,009 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.06.cil-2.c[914,927] [2022-02-20 19:57:13,067 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.06.cil-2.c[7115,7128] [2022-02-20 19:57:13,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:13,159 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:13,166 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.06.cil-2.c[914,927] [2022-02-20 19:57:13,182 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.06.cil-2.c[7115,7128] [2022-02-20 19:57:13,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:13,277 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:13,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13 WrapperNode [2022-02-20 19:57:13,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:13,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:13,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:13,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:13,283 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:57:13" (1/1) ... [2022-02-20 19:57:13,292 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:57:13" (1/1) ... [2022-02-20 19:57:13,331 INFO L137 Inliner]: procedures = 65, calls = 75, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 692 [2022-02-20 19:57:13,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:13,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:13,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:13,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:13,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:13,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:13,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:13,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:13,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (1/1) ... [2022-02-20 19:57:13,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:13,414 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:57:13,416 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:57:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:13,475 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:13,475 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:13,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:13,479 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:13,556 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:13,557 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:14,213 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:14,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:14,221 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-02-20 19:57:14,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:14 BoogieIcfgContainer [2022-02-20 19:57:14,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:14,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:14,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:14,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:14,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:12" (1/3) ... [2022-02-20 19:57:14,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e416e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:14, skipping insertion in model container [2022-02-20 19:57:14,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:13" (2/3) ... [2022-02-20 19:57:14,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e416e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:14, skipping insertion in model container [2022-02-20 19:57:14,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:14" (3/3) ... [2022-02-20 19:57:14,228 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-02-20 19:57:14,231 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:14,232 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:14,261 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:14,265 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:57:14,266 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 288 states have internal predecessors, (453), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 19:57:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:14,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:14,303 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:57:14,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash 751120114, now seen corresponding path program 1 times [2022-02-20 19:57:14,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:14,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839189963] [2022-02-20 19:57:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#(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); {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:14,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:14,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {338#(= ~q_read_ev~0 2)} #1212#return; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(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; {379#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:14,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {379#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:14,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#(= |old(~q_read_ev~0)| 0)} assume true; {379#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:14,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#(= |old(~q_read_ev~0)| 0)} {338#(= ~q_read_ev~0 2)} #1214#return; {337#false} is VALID [2022-02-20 19:57:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#true} havoc ~__retres1~0; {336#true} is VALID [2022-02-20 19:57:14,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} assume !(1 == ~p_dw_pc~0); {336#true} is VALID [2022-02-20 19:57:14,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} ~__retres1~0 := 0; {336#true} is VALID [2022-02-20 19:57:14,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#true} #res := ~__retres1~0; {336#true} is VALID [2022-02-20 19:57:14,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,546 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {336#true} {336#true} #1208#return; {336#true} is VALID [2022-02-20 19:57:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#true} havoc ~__retres1~1; {336#true} is VALID [2022-02-20 19:57:14,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} assume 1 == ~c_dr_pc~0; {336#true} is VALID [2022-02-20 19:57:14,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {336#true} is VALID [2022-02-20 19:57:14,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#true} #res := ~__retres1~1; {336#true} is VALID [2022-02-20 19:57:14,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,551 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {336#true} {336#true} #1210#return; {336#true} is VALID [2022-02-20 19:57:14,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {380#(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; {336#true} is VALID [2022-02-20 19:57:14,552 INFO L272 TraceCheckUtils]: 1: Hoare triple {336#true} call #t~ret8 := is_do_write_p_triggered(); {336#true} is VALID [2022-02-20 19:57:14,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} havoc ~__retres1~0; {336#true} is VALID [2022-02-20 19:57:14,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#true} assume !(1 == ~p_dw_pc~0); {336#true} is VALID [2022-02-20 19:57:14,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {336#true} ~__retres1~0 := 0; {336#true} is VALID [2022-02-20 19:57:14,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {336#true} #res := ~__retres1~0; {336#true} is VALID [2022-02-20 19:57:14,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,553 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {336#true} {336#true} #1208#return; {336#true} is VALID [2022-02-20 19:57:14,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {336#true} is VALID [2022-02-20 19:57:14,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#true} assume !(0 != ~tmp~1); {336#true} is VALID [2022-02-20 19:57:14,553 INFO L272 TraceCheckUtils]: 10: Hoare triple {336#true} call #t~ret9 := is_do_read_c_triggered(); {336#true} is VALID [2022-02-20 19:57:14,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {336#true} havoc ~__retres1~1; {336#true} is VALID [2022-02-20 19:57:14,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {336#true} assume 1 == ~c_dr_pc~0; {336#true} is VALID [2022-02-20 19:57:14,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {336#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {336#true} is VALID [2022-02-20 19:57:14,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#true} #res := ~__retres1~1; {336#true} is VALID [2022-02-20 19:57:14,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,555 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {336#true} {336#true} #1210#return; {336#true} is VALID [2022-02-20 19:57:14,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {336#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {336#true} is VALID [2022-02-20 19:57:14,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {336#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {336#true} is VALID [2022-02-20 19:57:14,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,555 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {336#true} {337#false} #1216#return; {337#false} is VALID [2022-02-20 19:57:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(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; {336#true} is VALID [2022-02-20 19:57:14,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {336#true} is VALID [2022-02-20 19:57:14,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336#true} {337#false} #1218#return; {337#false} is VALID [2022-02-20 19:57:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#true} havoc ~__retres1~2; {336#true} is VALID [2022-02-20 19:57:14,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {336#true} is VALID [2022-02-20 19:57:14,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} #res := ~__retres1~2; {336#true} is VALID [2022-02-20 19:57:14,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,567 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {336#true} {337#false} #1220#return; {337#false} is VALID [2022-02-20 19:57:14,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {336#true} is VALID [2022-02-20 19:57:14,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {336#true} is VALID [2022-02-20 19:57:14,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {338#(= ~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; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#(= ~q_read_ev~0 2)} call update_channels1(); {376#(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:57:14,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#(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); {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:14,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:14,571 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {377#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {338#(= ~q_read_ev~0 2)} #1212#return; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {338#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {338#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {338#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {338#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:14,573 INFO L272 TraceCheckUtils]: 12: Hoare triple {338#(= ~q_read_ev~0 2)} call fire_delta_events1(); {378#(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:57:14,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(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; {379#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:14,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {379#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {379#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:14,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {379#(= |old(~q_read_ev~0)| 0)} assume true; {379#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:14,575 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {379#(= |old(~q_read_ev~0)| 0)} {338#(= ~q_read_ev~0 2)} #1214#return; {337#false} is VALID [2022-02-20 19:57:14,575 INFO L272 TraceCheckUtils]: 17: Hoare triple {337#false} call activate_threads1(); {380#(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:57:14,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {380#(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; {336#true} is VALID [2022-02-20 19:57:14,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {336#true} call #t~ret8 := is_do_write_p_triggered(); {336#true} is VALID [2022-02-20 19:57:14,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {336#true} havoc ~__retres1~0; {336#true} is VALID [2022-02-20 19:57:14,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {336#true} assume !(1 == ~p_dw_pc~0); {336#true} is VALID [2022-02-20 19:57:14,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {336#true} ~__retres1~0 := 0; {336#true} is VALID [2022-02-20 19:57:14,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {336#true} #res := ~__retres1~0; {336#true} is VALID [2022-02-20 19:57:14,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,577 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {336#true} {336#true} #1208#return; {336#true} is VALID [2022-02-20 19:57:14,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {336#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {336#true} is VALID [2022-02-20 19:57:14,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {336#true} assume !(0 != ~tmp~1); {336#true} is VALID [2022-02-20 19:57:14,577 INFO L272 TraceCheckUtils]: 28: Hoare triple {336#true} call #t~ret9 := is_do_read_c_triggered(); {336#true} is VALID [2022-02-20 19:57:14,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {336#true} havoc ~__retres1~1; {336#true} is VALID [2022-02-20 19:57:14,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {336#true} assume 1 == ~c_dr_pc~0; {336#true} is VALID [2022-02-20 19:57:14,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {336#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {336#true} is VALID [2022-02-20 19:57:14,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {336#true} #res := ~__retres1~1; {336#true} is VALID [2022-02-20 19:57:14,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,578 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {336#true} {336#true} #1210#return; {336#true} is VALID [2022-02-20 19:57:14,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {336#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {336#true} is VALID [2022-02-20 19:57:14,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {336#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {336#true} is VALID [2022-02-20 19:57:14,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,579 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {336#true} {337#false} #1216#return; {337#false} is VALID [2022-02-20 19:57:14,579 INFO L272 TraceCheckUtils]: 39: Hoare triple {337#false} call reset_delta_events1(); {378#(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:57:14,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {378#(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; {336#true} is VALID [2022-02-20 19:57:14,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {336#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {336#true} is VALID [2022-02-20 19:57:14,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,580 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {336#true} {337#false} #1218#return; {337#false} is VALID [2022-02-20 19:57:14,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {337#false} assume !false; {337#false} is VALID [2022-02-20 19:57:14,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {337#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; {337#false} is VALID [2022-02-20 19:57:14,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {337#false} assume !false; {337#false} is VALID [2022-02-20 19:57:14,581 INFO L272 TraceCheckUtils]: 47: Hoare triple {337#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {336#true} is VALID [2022-02-20 19:57:14,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {336#true} havoc ~__retres1~2; {336#true} is VALID [2022-02-20 19:57:14,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {336#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {336#true} is VALID [2022-02-20 19:57:14,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {336#true} #res := ~__retres1~2; {336#true} is VALID [2022-02-20 19:57:14,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {336#true} assume true; {336#true} is VALID [2022-02-20 19:57:14,582 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {336#true} {337#false} #1220#return; {337#false} is VALID [2022-02-20 19:57:14,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {337#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; {337#false} is VALID [2022-02-20 19:57:14,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {337#false} assume 0 != eval1_~tmp___1~0#1; {337#false} is VALID [2022-02-20 19:57:14,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {337#false} assume !(0 == ~p_dw_st~0); {337#false} is VALID [2022-02-20 19:57:14,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {337#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; {337#false} is VALID [2022-02-20 19:57:14,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {337#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; {337#false} is VALID [2022-02-20 19:57:14,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {337#false} assume 0 == ~c_dr_pc~0; {337#false} is VALID [2022-02-20 19:57:14,583 INFO L290 TraceCheckUtils]: 59: Hoare triple {337#false} assume !false; {337#false} is VALID [2022-02-20 19:57:14,583 INFO L290 TraceCheckUtils]: 60: Hoare triple {337#false} assume !(1 == ~q_free~0); {337#false} is VALID [2022-02-20 19:57:14,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {337#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; {337#false} is VALID [2022-02-20 19:57:14,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {337#false} assume !(~p_last_write~0 == ~c_last_read~0); {337#false} is VALID [2022-02-20 19:57:14,584 INFO L272 TraceCheckUtils]: 63: Hoare triple {337#false} call error1(); {337#false} is VALID [2022-02-20 19:57:14,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {337#false} assume !false; {337#false} is VALID [2022-02-20 19:57:14,585 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:57:14,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:14,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839189963] [2022-02-20 19:57:14,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839189963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:14,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:14,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:14,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278117333] [2022-02-20 19:57:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:14,591 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:57:14,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:14,594 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:57:14,639 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:57:14,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:14,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:14,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:14,656 INFO L87 Difference]: Start difference. First operand has 333 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 288 states have internal predecessors, (453), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) 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:57:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:17,572 INFO L93 Difference]: Finished difference Result 779 states and 1212 transitions. [2022-02-20 19:57:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:17,573 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:57:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:17,575 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:57:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1212 transitions. [2022-02-20 19:57:17,619 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:57:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1212 transitions. [2022-02-20 19:57:17,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1212 transitions. [2022-02-20 19:57:18,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1212 edges. 1212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:18,559 INFO L225 Difference]: With dead ends: 779 [2022-02-20 19:57:18,560 INFO L226 Difference]: Without dead ends: 458 [2022-02-20 19:57:18,563 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:57:18,566 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 846 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:18,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1630 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-02-20 19:57:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 419. [2022-02-20 19:57:18,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:18,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:18,610 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:18,611 INFO L87 Difference]: Start difference. First operand 458 states. Second operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,632 INFO L93 Difference]: Finished difference Result 458 states and 667 transitions. [2022-02-20 19:57:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 667 transitions. [2022-02-20 19:57:18,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:18,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:18,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 458 states. [2022-02-20 19:57:18,638 INFO L87 Difference]: Start difference. First operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 458 states. [2022-02-20 19:57:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,657 INFO L93 Difference]: Finished difference Result 458 states and 667 transitions. [2022-02-20 19:57:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 667 transitions. [2022-02-20 19:57:18,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:18,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:18,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:18,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:57:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 613 transitions. [2022-02-20 19:57:18,676 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 613 transitions. Word has length 65 [2022-02-20 19:57:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:18,676 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 613 transitions. [2022-02-20 19:57:18,677 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:57:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 613 transitions. [2022-02-20 19:57:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:18,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:18,679 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:57:18,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:18,679 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1864958542, now seen corresponding path program 1 times [2022-02-20 19:57:18,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:18,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556213672] [2022-02-20 19:57:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {2978#(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); {2979#(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:57:18,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2979#(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:57:18,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2979#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2940#(= ~q_write_ev~0 ~q_read_ev~0)} #1212#return; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#(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); {2980#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:18,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {2980#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:18,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:18,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2940#(= ~q_write_ev~0 ~q_read_ev~0)} #1214#return; {2939#false} is VALID [2022-02-20 19:57:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {2938#true} havoc ~__retres1~0; {2938#true} is VALID [2022-02-20 19:57:18,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} assume !(1 == ~p_dw_pc~0); {2938#true} is VALID [2022-02-20 19:57:18,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} ~__retres1~0 := 0; {2938#true} is VALID [2022-02-20 19:57:18,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {2938#true} #res := ~__retres1~0; {2938#true} is VALID [2022-02-20 19:57:18,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,814 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2938#true} {2938#true} #1208#return; {2938#true} is VALID [2022-02-20 19:57:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {2938#true} havoc ~__retres1~1; {2938#true} is VALID [2022-02-20 19:57:18,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} assume 1 == ~c_dr_pc~0; {2938#true} is VALID [2022-02-20 19:57:18,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2938#true} is VALID [2022-02-20 19:57:18,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {2938#true} #res := ~__retres1~1; {2938#true} is VALID [2022-02-20 19:57:18,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,818 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2938#true} {2938#true} #1210#return; {2938#true} is VALID [2022-02-20 19:57:18,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {2982#(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; {2938#true} is VALID [2022-02-20 19:57:18,818 INFO L272 TraceCheckUtils]: 1: Hoare triple {2938#true} call #t~ret8 := is_do_write_p_triggered(); {2938#true} is VALID [2022-02-20 19:57:18,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} havoc ~__retres1~0; {2938#true} is VALID [2022-02-20 19:57:18,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {2938#true} assume !(1 == ~p_dw_pc~0); {2938#true} is VALID [2022-02-20 19:57:18,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {2938#true} ~__retres1~0 := 0; {2938#true} is VALID [2022-02-20 19:57:18,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {2938#true} #res := ~__retres1~0; {2938#true} is VALID [2022-02-20 19:57:18,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,819 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2938#true} {2938#true} #1208#return; {2938#true} is VALID [2022-02-20 19:57:18,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2938#true} is VALID [2022-02-20 19:57:18,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#true} assume !(0 != ~tmp~1); {2938#true} is VALID [2022-02-20 19:57:18,819 INFO L272 TraceCheckUtils]: 10: Hoare triple {2938#true} call #t~ret9 := is_do_read_c_triggered(); {2938#true} is VALID [2022-02-20 19:57:18,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {2938#true} havoc ~__retres1~1; {2938#true} is VALID [2022-02-20 19:57:18,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {2938#true} assume 1 == ~c_dr_pc~0; {2938#true} is VALID [2022-02-20 19:57:18,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {2938#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2938#true} is VALID [2022-02-20 19:57:18,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {2938#true} #res := ~__retres1~1; {2938#true} is VALID [2022-02-20 19:57:18,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,820 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2938#true} {2938#true} #1210#return; {2938#true} is VALID [2022-02-20 19:57:18,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {2938#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2938#true} is VALID [2022-02-20 19:57:18,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2938#true} is VALID [2022-02-20 19:57:18,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,821 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2938#true} {2939#false} #1216#return; {2939#false} is VALID [2022-02-20 19:57:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#(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); {2938#true} is VALID [2022-02-20 19:57:18,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2938#true} is VALID [2022-02-20 19:57:18,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2939#false} #1218#return; {2939#false} is VALID [2022-02-20 19:57:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {2938#true} havoc ~__retres1~2; {2938#true} is VALID [2022-02-20 19:57:18,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2938#true} is VALID [2022-02-20 19:57:18,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} #res := ~__retres1~2; {2938#true} is VALID [2022-02-20 19:57:18,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,835 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2938#true} {2939#false} #1220#return; {2939#false} is VALID [2022-02-20 19:57:18,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2938#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {2938#true} is VALID [2022-02-20 19:57:18,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {2938#true} is VALID [2022-02-20 19:57:18,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {2940#(= ~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; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {2940#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2978#(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:57:18,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {2978#(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); {2979#(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:57:18,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2979#(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:57:18,838 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2979#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2940#(= ~q_write_ev~0 ~q_read_ev~0)} #1212#return; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {2940#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {2940#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {2940#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {2940#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2940#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:18,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {2940#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2979#(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:57:18,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {2979#(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); {2980#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:18,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {2980#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:18,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:18,841 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2981#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2940#(= ~q_write_ev~0 ~q_read_ev~0)} #1214#return; {2939#false} is VALID [2022-02-20 19:57:18,842 INFO L272 TraceCheckUtils]: 17: Hoare triple {2939#false} call activate_threads1(); {2982#(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:57:18,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {2982#(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; {2938#true} is VALID [2022-02-20 19:57:18,842 INFO L272 TraceCheckUtils]: 19: Hoare triple {2938#true} call #t~ret8 := is_do_write_p_triggered(); {2938#true} is VALID [2022-02-20 19:57:18,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#true} havoc ~__retres1~0; {2938#true} is VALID [2022-02-20 19:57:18,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {2938#true} assume !(1 == ~p_dw_pc~0); {2938#true} is VALID [2022-02-20 19:57:18,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {2938#true} ~__retres1~0 := 0; {2938#true} is VALID [2022-02-20 19:57:18,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#true} #res := ~__retres1~0; {2938#true} is VALID [2022-02-20 19:57:18,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,843 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2938#true} {2938#true} #1208#return; {2938#true} is VALID [2022-02-20 19:57:18,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {2938#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2938#true} is VALID [2022-02-20 19:57:18,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {2938#true} assume !(0 != ~tmp~1); {2938#true} is VALID [2022-02-20 19:57:18,843 INFO L272 TraceCheckUtils]: 28: Hoare triple {2938#true} call #t~ret9 := is_do_read_c_triggered(); {2938#true} is VALID [2022-02-20 19:57:18,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {2938#true} havoc ~__retres1~1; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {2938#true} assume 1 == ~c_dr_pc~0; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {2938#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {2938#true} #res := ~__retres1~1; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2938#true} {2938#true} #1210#return; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2938#true} is VALID [2022-02-20 19:57:18,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {2938#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2938#true} is VALID [2022-02-20 19:57:18,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,845 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2938#true} {2939#false} #1216#return; {2939#false} is VALID [2022-02-20 19:57:18,845 INFO L272 TraceCheckUtils]: 39: Hoare triple {2939#false} call reset_delta_events1(); {2979#(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:57:18,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {2979#(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); {2938#true} is VALID [2022-02-20 19:57:18,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {2938#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2938#true} is VALID [2022-02-20 19:57:18,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,846 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2938#true} {2939#false} #1218#return; {2939#false} is VALID [2022-02-20 19:57:18,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-02-20 19:57:18,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {2939#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; {2939#false} is VALID [2022-02-20 19:57:18,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-02-20 19:57:18,846 INFO L272 TraceCheckUtils]: 47: Hoare triple {2939#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2938#true} is VALID [2022-02-20 19:57:18,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {2938#true} havoc ~__retres1~2; {2938#true} is VALID [2022-02-20 19:57:18,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {2938#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2938#true} is VALID [2022-02-20 19:57:18,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {2938#true} #res := ~__retres1~2; {2938#true} is VALID [2022-02-20 19:57:18,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-02-20 19:57:18,847 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2938#true} {2939#false} #1220#return; {2939#false} is VALID [2022-02-20 19:57:18,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {2939#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; {2939#false} is VALID [2022-02-20 19:57:18,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {2939#false} assume 0 != eval1_~tmp___1~0#1; {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {2939#false} assume !(0 == ~p_dw_st~0); {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {2939#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; {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {2939#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; {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {2939#false} assume 0 == ~c_dr_pc~0; {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {2939#false} assume !(1 == ~q_free~0); {2939#false} is VALID [2022-02-20 19:57:18,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {2939#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; {2939#false} is VALID [2022-02-20 19:57:18,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {2939#false} assume !(~p_last_write~0 == ~c_last_read~0); {2939#false} is VALID [2022-02-20 19:57:18,849 INFO L272 TraceCheckUtils]: 63: Hoare triple {2939#false} call error1(); {2939#false} is VALID [2022-02-20 19:57:18,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-02-20 19:57:18,849 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:57:18,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:18,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556213672] [2022-02-20 19:57:18,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556213672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:18,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:18,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:18,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978897348] [2022-02-20 19:57:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:18,851 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:57:18,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:18,852 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:57:18,898 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:57:18,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:18,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:18,899 INFO L87 Difference]: Start difference. First operand 419 states and 613 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:57:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,839 INFO L93 Difference]: Finished difference Result 766 states and 1090 transitions. [2022-02-20 19:57:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:21,840 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:57:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:21,840 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:57:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 819 transitions. [2022-02-20 19:57:21,857 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:57:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 819 transitions. [2022-02-20 19:57:21,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 819 transitions. [2022-02-20 19:57:22,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 819 edges. 819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:22,389 INFO L225 Difference]: With dead ends: 766 [2022-02-20 19:57:22,390 INFO L226 Difference]: Without dead ends: 589 [2022-02-20 19:57:22,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:57:22,395 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 937 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:22,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [963 Valid, 1877 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:57:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-02-20 19:57:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 515. [2022-02-20 19:57:22,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:22,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:22,422 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:22,423 INFO L87 Difference]: Start difference. First operand 589 states. Second operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,441 INFO L93 Difference]: Finished difference Result 589 states and 850 transitions. [2022-02-20 19:57:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 850 transitions. [2022-02-20 19:57:22,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:22,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:22,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) Second operand 589 states. [2022-02-20 19:57:22,445 INFO L87 Difference]: Start difference. First operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) Second operand 589 states. [2022-02-20 19:57:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,462 INFO L93 Difference]: Finished difference Result 589 states and 850 transitions. [2022-02-20 19:57:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 850 transitions. [2022-02-20 19:57:22,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:22,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:22,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:22,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:57:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 747 transitions. [2022-02-20 19:57:22,481 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 747 transitions. Word has length 65 [2022-02-20 19:57:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:22,483 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 747 transitions. [2022-02-20 19:57:22,483 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:57:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 747 transitions. [2022-02-20 19:57:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:22,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:22,487 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:57:22,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:22,487 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash 401422644, now seen corresponding path program 1 times [2022-02-20 19:57:22,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:22,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398620777] [2022-02-20 19:57:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {5965#(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); {5966#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:22,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {5966#(not (= |old(~q_req_up~0)| 1))} assume true; {5966#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:22,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5966#(not (= |old(~q_req_up~0)| 1))} {5926#(= ~c_dr_pc~0 ~q_req_up~0)} #1212#return; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {5967#(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); {5923#true} is VALID [2022-02-20 19:57:22,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#true} assume !(0 == ~q_write_ev~0); {5923#true} is VALID [2022-02-20 19:57:22,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5923#true} {5930#(not (= ~c_dr_pc~0 1))} #1214#return; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {5923#true} havoc ~__retres1~0; {5923#true} is VALID [2022-02-20 19:57:22,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#true} assume !(1 == ~p_dw_pc~0); {5923#true} is VALID [2022-02-20 19:57:22,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {5923#true} ~__retres1~0 := 0; {5923#true} is VALID [2022-02-20 19:57:22,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {5923#true} #res := ~__retres1~0; {5923#true} is VALID [2022-02-20 19:57:22,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,598 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5923#true} {5923#true} #1208#return; {5923#true} is VALID [2022-02-20 19:57:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {5923#true} havoc ~__retres1~1; {5923#true} is VALID [2022-02-20 19:57:22,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#true} assume 1 == ~c_dr_pc~0; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,606 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} {5923#true} #1210#return; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {5968#(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; {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L272 TraceCheckUtils]: 1: Hoare triple {5923#true} call #t~ret8 := is_do_write_p_triggered(); {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {5923#true} havoc ~__retres1~0; {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {5923#true} assume !(1 == ~p_dw_pc~0); {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {5923#true} ~__retres1~0 := 0; {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {5923#true} #res := ~__retres1~0; {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,607 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5923#true} {5923#true} #1208#return; {5923#true} is VALID [2022-02-20 19:57:22,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {5923#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5923#true} is VALID [2022-02-20 19:57:22,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {5923#true} assume !(0 != ~tmp~1); {5923#true} is VALID [2022-02-20 19:57:22,608 INFO L272 TraceCheckUtils]: 10: Hoare triple {5923#true} call #t~ret9 := is_do_read_c_triggered(); {5923#true} is VALID [2022-02-20 19:57:22,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {5923#true} havoc ~__retres1~1; {5923#true} is VALID [2022-02-20 19:57:22,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {5923#true} assume 1 == ~c_dr_pc~0; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,610 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} {5923#true} #1210#return; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,611 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} {5930#(not (= ~c_dr_pc~0 1))} #1216#return; {5924#false} is VALID [2022-02-20 19:57:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {5967#(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); {5923#true} is VALID [2022-02-20 19:57:22,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5923#true} is VALID [2022-02-20 19:57:22,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5923#true} {5924#false} #1218#return; {5924#false} is VALID [2022-02-20 19:57:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {5923#true} havoc ~__retres1~2; {5923#true} is VALID [2022-02-20 19:57:22,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5923#true} is VALID [2022-02-20 19:57:22,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {5923#true} #res := ~__retres1~2; {5923#true} is VALID [2022-02-20 19:57:22,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,620 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5923#true} {5924#false} #1220#return; {5924#false} is VALID [2022-02-20 19:57:22,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {5923#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {5925#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:22,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {5925#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {5925#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:22,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {5925#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {5926#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:22,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {5926#(= ~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; {5926#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:22,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {5926#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {5965#(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:57:22,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {5965#(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); {5966#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:22,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {5966#(not (= |old(~q_req_up~0)| 1))} assume true; {5966#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:22,624 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5966#(not (= |old(~q_req_up~0)| 1))} {5926#(= ~c_dr_pc~0 ~q_req_up~0)} #1212#return; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {5930#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {5930#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {5930#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {5930#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,626 INFO L272 TraceCheckUtils]: 12: Hoare triple {5930#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {5967#(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:57:22,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {5967#(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); {5923#true} is VALID [2022-02-20 19:57:22,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {5923#true} assume !(0 == ~q_write_ev~0); {5923#true} is VALID [2022-02-20 19:57:22,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,626 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5923#true} {5930#(not (= ~c_dr_pc~0 1))} #1214#return; {5930#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:22,627 INFO L272 TraceCheckUtils]: 17: Hoare triple {5930#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {5968#(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:57:22,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {5968#(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; {5923#true} is VALID [2022-02-20 19:57:22,627 INFO L272 TraceCheckUtils]: 19: Hoare triple {5923#true} call #t~ret8 := is_do_write_p_triggered(); {5923#true} is VALID [2022-02-20 19:57:22,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#true} havoc ~__retres1~0; {5923#true} is VALID [2022-02-20 19:57:22,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {5923#true} assume !(1 == ~p_dw_pc~0); {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {5923#true} ~__retres1~0 := 0; {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {5923#true} #res := ~__retres1~0; {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5923#true} {5923#true} #1208#return; {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {5923#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {5923#true} assume !(0 != ~tmp~1); {5923#true} is VALID [2022-02-20 19:57:22,628 INFO L272 TraceCheckUtils]: 28: Hoare triple {5923#true} call #t~ret9 := is_do_read_c_triggered(); {5923#true} is VALID [2022-02-20 19:57:22,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {5923#true} havoc ~__retres1~1; {5923#true} is VALID [2022-02-20 19:57:22,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {5923#true} assume 1 == ~c_dr_pc~0; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,630 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} {5923#true} #1210#return; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:22,632 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5981#(= (+ (- 1) ~c_dr_pc~0) 0)} {5930#(not (= ~c_dr_pc~0 1))} #1216#return; {5924#false} is VALID [2022-02-20 19:57:22,632 INFO L272 TraceCheckUtils]: 39: Hoare triple {5924#false} call reset_delta_events1(); {5967#(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:57:22,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {5967#(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); {5923#true} is VALID [2022-02-20 19:57:22,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {5923#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5923#true} is VALID [2022-02-20 19:57:22,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,632 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5923#true} {5924#false} #1218#return; {5924#false} is VALID [2022-02-20 19:57:22,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {5924#false} assume !false; {5924#false} is VALID [2022-02-20 19:57:22,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {5924#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; {5924#false} is VALID [2022-02-20 19:57:22,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {5924#false} assume !false; {5924#false} is VALID [2022-02-20 19:57:22,633 INFO L272 TraceCheckUtils]: 47: Hoare triple {5924#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5923#true} is VALID [2022-02-20 19:57:22,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {5923#true} havoc ~__retres1~2; {5923#true} is VALID [2022-02-20 19:57:22,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {5923#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5923#true} is VALID [2022-02-20 19:57:22,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {5923#true} #res := ~__retres1~2; {5923#true} is VALID [2022-02-20 19:57:22,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {5923#true} assume true; {5923#true} is VALID [2022-02-20 19:57:22,634 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5923#true} {5924#false} #1220#return; {5924#false} is VALID [2022-02-20 19:57:22,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {5924#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; {5924#false} is VALID [2022-02-20 19:57:22,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {5924#false} assume 0 != eval1_~tmp___1~0#1; {5924#false} is VALID [2022-02-20 19:57:22,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {5924#false} assume !(0 == ~p_dw_st~0); {5924#false} is VALID [2022-02-20 19:57:22,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {5924#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; {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {5924#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; {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {5924#false} assume 0 == ~c_dr_pc~0; {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {5924#false} assume !false; {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {5924#false} assume !(1 == ~q_free~0); {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {5924#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; {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {5924#false} assume !(~p_last_write~0 == ~c_last_read~0); {5924#false} is VALID [2022-02-20 19:57:22,635 INFO L272 TraceCheckUtils]: 63: Hoare triple {5924#false} call error1(); {5924#false} is VALID [2022-02-20 19:57:22,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {5924#false} assume !false; {5924#false} is VALID [2022-02-20 19:57:22,636 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:57:22,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:22,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398620777] [2022-02-20 19:57:22,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398620777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:22,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:22,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:57:22,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9402254] [2022-02-20 19:57:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:22,638 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:57:22,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:22,638 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:57:22,685 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:57:22,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:22,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:22,686 INFO L87 Difference]: Start difference. First operand 515 states and 747 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:57:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,706 INFO L93 Difference]: Finished difference Result 1847 states and 2593 transitions. [2022-02-20 19:57:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:27,706 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:57:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:27,707 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:57:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1162 transitions. [2022-02-20 19:57:27,718 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:57:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1162 transitions. [2022-02-20 19:57:27,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1162 transitions. [2022-02-20 19:57:28,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1162 edges. 1162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:28,721 INFO L225 Difference]: With dead ends: 1847 [2022-02-20 19:57:28,721 INFO L226 Difference]: Without dead ends: 1562 [2022-02-20 19:57:28,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:57:28,729 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 2553 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:28,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2567 Valid, 2156 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:57:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-02-20 19:57:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1401. [2022-02-20 19:57:28,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:28,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1562 states. Second operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:28,785 INFO L74 IsIncluded]: Start isIncluded. First operand 1562 states. Second operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:28,786 INFO L87 Difference]: Start difference. First operand 1562 states. Second operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,864 INFO L93 Difference]: Finished difference Result 1562 states and 2080 transitions. [2022-02-20 19:57:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2080 transitions. [2022-02-20 19:57:28,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:28,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:28,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) Second operand 1562 states. [2022-02-20 19:57:28,871 INFO L87 Difference]: Start difference. First operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) Second operand 1562 states. [2022-02-20 19:57:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,974 INFO L93 Difference]: Finished difference Result 1562 states and 2080 transitions. [2022-02-20 19:57:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2080 transitions. [2022-02-20 19:57:28,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:28,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:28,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:28,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:57:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1881 transitions. [2022-02-20 19:57:29,058 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1881 transitions. Word has length 65 [2022-02-20 19:57:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:29,059 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 1881 transitions. [2022-02-20 19:57:29,059 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:57:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1881 transitions. [2022-02-20 19:57:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:29,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:29,062 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:57:29,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:29,062 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1452871733, now seen corresponding path program 1 times [2022-02-20 19:57:29,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:29,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875911858] [2022-02-20 19:57:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {13592#(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); {13553#true} is VALID [2022-02-20 19:57:29,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13553#true} {13553#true} #1212#return; {13553#true} is VALID [2022-02-20 19:57:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {13593#(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); {13553#true} is VALID [2022-02-20 19:57:29,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume !(0 == ~q_write_ev~0); {13553#true} is VALID [2022-02-20 19:57:29,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13553#true} {13553#true} #1214#return; {13553#true} is VALID [2022-02-20 19:57:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {13553#true} havoc ~__retres1~0; {13553#true} is VALID [2022-02-20 19:57:29,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume !(1 == ~p_dw_pc~0); {13553#true} is VALID [2022-02-20 19:57:29,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} ~__retres1~0 := 0; {13553#true} is VALID [2022-02-20 19:57:29,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {13553#true} #res := ~__retres1~0; {13553#true} is VALID [2022-02-20 19:57:29,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,203 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13553#true} {13553#true} #1208#return; {13553#true} is VALID [2022-02-20 19:57:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {13553#true} havoc ~__retres1~1; {13553#true} is VALID [2022-02-20 19:57:29,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume !(1 == ~c_dr_pc~0); {13553#true} is VALID [2022-02-20 19:57:29,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} ~__retres1~1 := 0; {13609#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:29,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {13609#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:29,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:29,230 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13553#true} #1210#return; {13607#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:29,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {13594#(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; {13553#true} is VALID [2022-02-20 19:57:29,230 INFO L272 TraceCheckUtils]: 1: Hoare triple {13553#true} call #t~ret8 := is_do_write_p_triggered(); {13553#true} is VALID [2022-02-20 19:57:29,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} havoc ~__retres1~0; {13553#true} is VALID [2022-02-20 19:57:29,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {13553#true} assume !(1 == ~p_dw_pc~0); {13553#true} is VALID [2022-02-20 19:57:29,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {13553#true} ~__retres1~0 := 0; {13553#true} is VALID [2022-02-20 19:57:29,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {13553#true} #res := ~__retres1~0; {13553#true} is VALID [2022-02-20 19:57:29,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,231 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13553#true} {13553#true} #1208#return; {13553#true} is VALID [2022-02-20 19:57:29,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {13553#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13553#true} is VALID [2022-02-20 19:57:29,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {13553#true} assume !(0 != ~tmp~1); {13553#true} is VALID [2022-02-20 19:57:29,232 INFO L272 TraceCheckUtils]: 10: Hoare triple {13553#true} call #t~ret9 := is_do_read_c_triggered(); {13553#true} is VALID [2022-02-20 19:57:29,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {13553#true} havoc ~__retres1~1; {13553#true} is VALID [2022-02-20 19:57:29,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {13553#true} assume !(1 == ~c_dr_pc~0); {13553#true} is VALID [2022-02-20 19:57:29,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {13553#true} ~__retres1~1 := 0; {13609#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:29,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {13609#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:29,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:29,234 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13553#true} #1210#return; {13607#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:29,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {13607#(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; {13608#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:29,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {13608#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13554#false} is VALID [2022-02-20 19:57:29,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {13554#false} assume true; {13554#false} is VALID [2022-02-20 19:57:29,235 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13554#false} {13553#true} #1216#return; {13554#false} is VALID [2022-02-20 19:57:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {13593#(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); {13553#true} is VALID [2022-02-20 19:57:29,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13553#true} is VALID [2022-02-20 19:57:29,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13553#true} {13554#false} #1218#return; {13554#false} is VALID [2022-02-20 19:57:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:29,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {13553#true} havoc ~__retres1~2; {13553#true} is VALID [2022-02-20 19:57:29,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13553#true} is VALID [2022-02-20 19:57:29,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} #res := ~__retres1~2; {13553#true} is VALID [2022-02-20 19:57:29,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,242 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13553#true} {13554#false} #1220#return; {13554#false} is VALID [2022-02-20 19:57:29,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {13553#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {13553#true} is VALID [2022-02-20 19:57:29,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {13553#true} is VALID [2022-02-20 19:57:29,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {13553#true} is VALID [2022-02-20 19:57:29,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {13553#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; {13553#true} is VALID [2022-02-20 19:57:29,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {13553#true} call update_channels1(); {13592#(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:57:29,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {13592#(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); {13553#true} is VALID [2022-02-20 19:57:29,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,244 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13553#true} {13553#true} #1212#return; {13553#true} is VALID [2022-02-20 19:57:29,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {13553#true} assume { :begin_inline_init_threads1 } true; {13553#true} is VALID [2022-02-20 19:57:29,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {13553#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13553#true} is VALID [2022-02-20 19:57:29,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13553#true} is VALID [2022-02-20 19:57:29,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {13553#true} assume { :end_inline_init_threads1 } true; {13553#true} is VALID [2022-02-20 19:57:29,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {13553#true} call fire_delta_events1(); {13593#(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:57:29,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {13593#(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); {13553#true} is VALID [2022-02-20 19:57:29,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {13553#true} assume !(0 == ~q_write_ev~0); {13553#true} is VALID [2022-02-20 19:57:29,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13553#true} {13553#true} #1214#return; {13553#true} is VALID [2022-02-20 19:57:29,245 INFO L272 TraceCheckUtils]: 17: Hoare triple {13553#true} call activate_threads1(); {13594#(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:57:29,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {13594#(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; {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L272 TraceCheckUtils]: 19: Hoare triple {13553#true} call #t~ret8 := is_do_write_p_triggered(); {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {13553#true} havoc ~__retres1~0; {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {13553#true} assume !(1 == ~p_dw_pc~0); {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {13553#true} ~__retres1~0 := 0; {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {13553#true} #res := ~__retres1~0; {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,246 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13553#true} {13553#true} #1208#return; {13553#true} is VALID [2022-02-20 19:57:29,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {13553#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13553#true} is VALID [2022-02-20 19:57:29,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {13553#true} assume !(0 != ~tmp~1); {13553#true} is VALID [2022-02-20 19:57:29,247 INFO L272 TraceCheckUtils]: 28: Hoare triple {13553#true} call #t~ret9 := is_do_read_c_triggered(); {13553#true} is VALID [2022-02-20 19:57:29,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {13553#true} havoc ~__retres1~1; {13553#true} is VALID [2022-02-20 19:57:29,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {13553#true} assume !(1 == ~c_dr_pc~0); {13553#true} is VALID [2022-02-20 19:57:29,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {13553#true} ~__retres1~1 := 0; {13609#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:29,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {13609#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:29,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:29,249 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13610#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13553#true} #1210#return; {13607#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:29,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {13607#(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; {13608#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:29,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {13608#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13554#false} is VALID [2022-02-20 19:57:29,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {13554#false} assume true; {13554#false} is VALID [2022-02-20 19:57:29,250 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13554#false} {13553#true} #1216#return; {13554#false} is VALID [2022-02-20 19:57:29,250 INFO L272 TraceCheckUtils]: 39: Hoare triple {13554#false} call reset_delta_events1(); {13593#(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:57:29,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {13593#(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); {13553#true} is VALID [2022-02-20 19:57:29,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {13553#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13553#true} is VALID [2022-02-20 19:57:29,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,250 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13553#true} {13554#false} #1218#return; {13554#false} is VALID [2022-02-20 19:57:29,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-02-20 19:57:29,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {13554#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; {13554#false} is VALID [2022-02-20 19:57:29,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-02-20 19:57:29,251 INFO L272 TraceCheckUtils]: 47: Hoare triple {13554#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13553#true} is VALID [2022-02-20 19:57:29,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {13553#true} havoc ~__retres1~2; {13553#true} is VALID [2022-02-20 19:57:29,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {13553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13553#true} is VALID [2022-02-20 19:57:29,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {13553#true} #res := ~__retres1~2; {13553#true} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-02-20 19:57:29,252 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13553#true} {13554#false} #1220#return; {13554#false} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {13554#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; {13554#false} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {13554#false} assume 0 != eval1_~tmp___1~0#1; {13554#false} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {13554#false} assume !(0 == ~p_dw_st~0); {13554#false} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {13554#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; {13554#false} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {13554#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; {13554#false} is VALID [2022-02-20 19:57:29,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {13554#false} assume 0 == ~c_dr_pc~0; {13554#false} is VALID [2022-02-20 19:57:29,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-02-20 19:57:29,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {13554#false} assume !(1 == ~q_free~0); {13554#false} is VALID [2022-02-20 19:57:29,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {13554#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; {13554#false} is VALID [2022-02-20 19:57:29,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {13554#false} assume !(~p_last_write~0 == ~c_last_read~0); {13554#false} is VALID [2022-02-20 19:57:29,253 INFO L272 TraceCheckUtils]: 63: Hoare triple {13554#false} call error1(); {13554#false} is VALID [2022-02-20 19:57:29,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-02-20 19:57:29,253 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:57:29,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:29,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875911858] [2022-02-20 19:57:29,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875911858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:29,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:29,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:29,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671093903] [2022-02-20 19:57:29,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:29,255 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:57:29,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:29,255 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:57:29,290 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:57:29,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:29,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:29,291 INFO L87 Difference]: Start difference. First operand 1401 states and 1881 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:57:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:34,440 INFO L93 Difference]: Finished difference Result 2730 states and 3631 transitions. [2022-02-20 19:57:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:34,440 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:57:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:34,440 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:57:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 637 transitions. [2022-02-20 19:57:34,444 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:57:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 637 transitions. [2022-02-20 19:57:34,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 637 transitions. [2022-02-20 19:57:34,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:35,025 INFO L225 Difference]: With dead ends: 2730 [2022-02-20 19:57:35,025 INFO L226 Difference]: Without dead ends: 1565 [2022-02-20 19:57:35,027 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:57:35,028 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 408 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:35,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 2083 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:57:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-02-20 19:57:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1431. [2022-02-20 19:57:35,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:35,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1565 states. Second operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:35,082 INFO L74 IsIncluded]: Start isIncluded. First operand 1565 states. Second operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:35,084 INFO L87 Difference]: Start difference. First operand 1565 states. Second operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:35,167 INFO L93 Difference]: Finished difference Result 1565 states and 2071 transitions. [2022-02-20 19:57:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2071 transitions. [2022-02-20 19:57:35,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:35,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:35,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) Second operand 1565 states. [2022-02-20 19:57:35,175 INFO L87 Difference]: Start difference. First operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) Second operand 1565 states. [2022-02-20 19:57:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:35,257 INFO L93 Difference]: Finished difference Result 1565 states and 2071 transitions. [2022-02-20 19:57:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2071 transitions. [2022-02-20 19:57:35,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:35,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:35,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:35,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:57:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1903 transitions. [2022-02-20 19:57:35,354 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1903 transitions. Word has length 65 [2022-02-20 19:57:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:35,354 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 1903 transitions. [2022-02-20 19:57:35,355 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:57:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1903 transitions. [2022-02-20 19:57:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:35,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:35,356 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:57:35,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:35,356 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1455892169, now seen corresponding path program 1 times [2022-02-20 19:57:35,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:35,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896421397] [2022-02-20 19:57:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {22394#(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); {22395#(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:57:35,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22395#(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:57:35,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1212#return; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {22395#(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); {22395#(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:57:35,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {22395#(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); {22395#(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:57:35,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22395#(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:57:35,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1214#return; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {22354#true} havoc ~__retres1~0; {22354#true} is VALID [2022-02-20 19:57:35,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {22354#true} assume !(1 == ~p_dw_pc~0); {22354#true} is VALID [2022-02-20 19:57:35,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {22354#true} ~__retres1~0 := 0; {22354#true} is VALID [2022-02-20 19:57:35,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {22354#true} #res := ~__retres1~0; {22354#true} is VALID [2022-02-20 19:57:35,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,439 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22354#true} {22354#true} #1208#return; {22354#true} is VALID [2022-02-20 19:57:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {22354#true} havoc ~__retres1~1; {22354#true} is VALID [2022-02-20 19:57:35,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {22354#true} assume !(1 == ~c_dr_pc~0); {22354#true} is VALID [2022-02-20 19:57:35,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {22354#true} ~__retres1~1 := 0; {22354#true} is VALID [2022-02-20 19:57:35,442 INFO L290 TraceCheckUtils]: 3: Hoare triple {22354#true} #res := ~__retres1~1; {22354#true} is VALID [2022-02-20 19:57:35,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,442 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22354#true} {22354#true} #1210#return; {22354#true} is VALID [2022-02-20 19:57:35,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {22396#(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; {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L272 TraceCheckUtils]: 1: Hoare triple {22354#true} call #t~ret8 := is_do_write_p_triggered(); {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {22354#true} havoc ~__retres1~0; {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {22354#true} assume !(1 == ~p_dw_pc~0); {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {22354#true} ~__retres1~0 := 0; {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {22354#true} #res := ~__retres1~0; {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22354#true} {22354#true} #1208#return; {22354#true} is VALID [2022-02-20 19:57:35,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {22354#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {22354#true} assume !(0 != ~tmp~1); {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L272 TraceCheckUtils]: 10: Hoare triple {22354#true} call #t~ret9 := is_do_read_c_triggered(); {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {22354#true} havoc ~__retres1~1; {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {22354#true} assume !(1 == ~c_dr_pc~0); {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {22354#true} ~__retres1~1 := 0; {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {22354#true} #res := ~__retres1~1; {22354#true} is VALID [2022-02-20 19:57:35,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,445 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22354#true} {22354#true} #1210#return; {22354#true} is VALID [2022-02-20 19:57:35,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {22354#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22354#true} is VALID [2022-02-20 19:57:35,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {22354#true} assume !(0 != ~tmp___0~1); {22354#true} is VALID [2022-02-20 19:57:35,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,445 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22354#true} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1216#return; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {22395#(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); {22409#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:35,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {22409#(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; {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:35,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:35,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1218#return; {22355#false} is VALID [2022-02-20 19:57:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:35,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {22354#true} havoc ~__retres1~2; {22354#true} is VALID [2022-02-20 19:57:35,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {22354#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22354#true} is VALID [2022-02-20 19:57:35,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {22354#true} #res := ~__retres1~2; {22354#true} is VALID [2022-02-20 19:57:35,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,466 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22354#true} {22355#false} #1220#return; {22355#false} is VALID [2022-02-20 19:57:35,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {22354#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {22354#true} is VALID [2022-02-20 19:57:35,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {22354#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {22354#true} is VALID [2022-02-20 19:57:35,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {22354#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {22356#(= ~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; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {22394#(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:57:35,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {22394#(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); {22395#(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:57:35,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22395#(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:57:35,468 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1212#return; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {22395#(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:57:35,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {22395#(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); {22395#(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:57:35,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {22395#(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); {22395#(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:57:35,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22395#(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:57:35,471 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1214#return; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {22396#(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:57:35,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {22396#(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; {22354#true} is VALID [2022-02-20 19:57:35,472 INFO L272 TraceCheckUtils]: 19: Hoare triple {22354#true} call #t~ret8 := is_do_write_p_triggered(); {22354#true} is VALID [2022-02-20 19:57:35,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {22354#true} havoc ~__retres1~0; {22354#true} is VALID [2022-02-20 19:57:35,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {22354#true} assume !(1 == ~p_dw_pc~0); {22354#true} is VALID [2022-02-20 19:57:35,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {22354#true} ~__retres1~0 := 0; {22354#true} is VALID [2022-02-20 19:57:35,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {22354#true} #res := ~__retres1~0; {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22354#true} {22354#true} #1208#return; {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {22354#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {22354#true} assume !(0 != ~tmp~1); {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L272 TraceCheckUtils]: 28: Hoare triple {22354#true} call #t~ret9 := is_do_read_c_triggered(); {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {22354#true} havoc ~__retres1~1; {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {22354#true} assume !(1 == ~c_dr_pc~0); {22354#true} is VALID [2022-02-20 19:57:35,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {22354#true} ~__retres1~1 := 0; {22354#true} is VALID [2022-02-20 19:57:35,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {22354#true} #res := ~__retres1~1; {22354#true} is VALID [2022-02-20 19:57:35,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,474 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22354#true} {22354#true} #1210#return; {22354#true} is VALID [2022-02-20 19:57:35,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {22354#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22354#true} is VALID [2022-02-20 19:57:35,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {22354#true} assume !(0 != ~tmp___0~1); {22354#true} is VALID [2022-02-20 19:57:35,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,475 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22354#true} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1216#return; {22356#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:35,475 INFO L272 TraceCheckUtils]: 39: Hoare triple {22356#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {22395#(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:57:35,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {22395#(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); {22409#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:35,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {22409#(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; {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:35,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:35,476 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22410#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22356#(= ~q_write_ev~0 ~q_read_ev~0)} #1218#return; {22355#false} is VALID [2022-02-20 19:57:35,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-02-20 19:57:35,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {22355#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; {22355#false} is VALID [2022-02-20 19:57:35,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-02-20 19:57:35,477 INFO L272 TraceCheckUtils]: 47: Hoare triple {22355#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22354#true} is VALID [2022-02-20 19:57:35,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {22354#true} havoc ~__retres1~2; {22354#true} is VALID [2022-02-20 19:57:35,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {22354#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22354#true} is VALID [2022-02-20 19:57:35,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {22354#true} #res := ~__retres1~2; {22354#true} is VALID [2022-02-20 19:57:35,477 INFO L290 TraceCheckUtils]: 51: Hoare triple {22354#true} assume true; {22354#true} is VALID [2022-02-20 19:57:35,478 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22354#true} {22355#false} #1220#return; {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {22355#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; {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {22355#false} assume 0 != eval1_~tmp___1~0#1; {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {22355#false} assume !(0 == ~p_dw_st~0); {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {22355#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; {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {22355#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; {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {22355#false} assume 0 == ~c_dr_pc~0; {22355#false} is VALID [2022-02-20 19:57:35,478 INFO L290 TraceCheckUtils]: 59: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-02-20 19:57:35,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {22355#false} assume !(1 == ~q_free~0); {22355#false} is VALID [2022-02-20 19:57:35,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {22355#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; {22355#false} is VALID [2022-02-20 19:57:35,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {22355#false} assume !(~p_last_write~0 == ~c_last_read~0); {22355#false} is VALID [2022-02-20 19:57:35,479 INFO L272 TraceCheckUtils]: 63: Hoare triple {22355#false} call error1(); {22355#false} is VALID [2022-02-20 19:57:35,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {22355#false} assume !false; {22355#false} is VALID [2022-02-20 19:57:35,479 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:57:35,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:35,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896421397] [2022-02-20 19:57:35,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896421397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:35,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:35,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:35,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263658469] [2022-02-20 19:57:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:35,481 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:57:35,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:35,481 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:57:35,516 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:57:35,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:35,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:35,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:35,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:35,518 INFO L87 Difference]: Start difference. First operand 1431 states and 1903 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:57:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,026 INFO L93 Difference]: Finished difference Result 2780 states and 3605 transitions. [2022-02-20 19:57:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 19:57:38,026 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:57:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:38,026 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:57:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 822 transitions. [2022-02-20 19:57:38,031 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:57:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 822 transitions. [2022-02-20 19:57:38,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 822 transitions. [2022-02-20 19:57:38,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:38,657 INFO L225 Difference]: With dead ends: 2780 [2022-02-20 19:57:38,657 INFO L226 Difference]: Without dead ends: 1808 [2022-02-20 19:57:38,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-02-20 19:57:38,659 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 1186 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:38,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 1412 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-02-20 19:57:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1373. [2022-02-20 19:57:38,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:38,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1808 states. Second operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:38,715 INFO L74 IsIncluded]: Start isIncluded. First operand 1808 states. Second operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:38,716 INFO L87 Difference]: Start difference. First operand 1808 states. Second operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,817 INFO L93 Difference]: Finished difference Result 1808 states and 2331 transitions. [2022-02-20 19:57:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2331 transitions. [2022-02-20 19:57:38,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:38,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:38,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) Second operand 1808 states. [2022-02-20 19:57:38,825 INFO L87 Difference]: Start difference. First operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) Second operand 1808 states. [2022-02-20 19:57:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,923 INFO L93 Difference]: Finished difference Result 1808 states and 2331 transitions. [2022-02-20 19:57:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2331 transitions. [2022-02-20 19:57:38,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:38,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:38,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:38,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:57:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1822 transitions. [2022-02-20 19:57:39,004 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1822 transitions. Word has length 65 [2022-02-20 19:57:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:39,005 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 1822 transitions. [2022-02-20 19:57:39,005 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:57:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1822 transitions. [2022-02-20 19:57:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:39,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:39,006 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:57:39,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:39,006 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1589905675, now seen corresponding path program 1 times [2022-02-20 19:57:39,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:39,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834254648] [2022-02-20 19:57:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {31638#(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); {31598#true} is VALID [2022-02-20 19:57:39,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31598#true} {31598#true} #1212#return; {31598#true} is VALID [2022-02-20 19:57:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {31639#(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); {31598#true} is VALID [2022-02-20 19:57:39,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume !(0 == ~q_write_ev~0); {31598#true} is VALID [2022-02-20 19:57:39,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31598#true} {31603#(= ~p_dw_st~0 0)} #1214#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {31598#true} havoc ~__retres1~0; {31598#true} is VALID [2022-02-20 19:57:39,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume !(1 == ~p_dw_pc~0); {31598#true} is VALID [2022-02-20 19:57:39,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {31598#true} ~__retres1~0 := 0; {31598#true} is VALID [2022-02-20 19:57:39,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {31598#true} #res := ~__retres1~0; {31598#true} is VALID [2022-02-20 19:57:39,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,073 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31598#true} {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1208#return; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {31598#true} havoc ~__retres1~1; {31598#true} is VALID [2022-02-20 19:57:39,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume !(1 == ~c_dr_pc~0); {31598#true} is VALID [2022-02-20 19:57:39,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {31598#true} ~__retres1~1 := 0; {31598#true} is VALID [2022-02-20 19:57:39,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {31598#true} #res := ~__retres1~1; {31598#true} is VALID [2022-02-20 19:57:39,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,077 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31598#true} {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1210#return; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {31640#(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; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,077 INFO L272 TraceCheckUtils]: 1: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {31598#true} is VALID [2022-02-20 19:57:39,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {31598#true} havoc ~__retres1~0; {31598#true} is VALID [2022-02-20 19:57:39,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {31598#true} assume !(1 == ~p_dw_pc~0); {31598#true} is VALID [2022-02-20 19:57:39,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {31598#true} ~__retres1~0 := 0; {31598#true} is VALID [2022-02-20 19:57:39,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {31598#true} #res := ~__retres1~0; {31598#true} is VALID [2022-02-20 19:57:39,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,079 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31598#true} {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1208#return; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,079 INFO L272 TraceCheckUtils]: 10: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {31598#true} is VALID [2022-02-20 19:57:39,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {31598#true} havoc ~__retres1~1; {31598#true} is VALID [2022-02-20 19:57:39,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {31598#true} assume !(1 == ~c_dr_pc~0); {31598#true} is VALID [2022-02-20 19:57:39,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {31598#true} ~__retres1~1 := 0; {31598#true} is VALID [2022-02-20 19:57:39,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {31598#true} #res := ~__retres1~1; {31598#true} is VALID [2022-02-20 19:57:39,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31598#true} {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1210#return; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,082 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {31603#(= ~p_dw_st~0 0)} #1216#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {31639#(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); {31598#true} is VALID [2022-02-20 19:57:39,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume !(1 == ~q_write_ev~0); {31598#true} is VALID [2022-02-20 19:57:39,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31598#true} {31603#(= ~p_dw_st~0 0)} #1218#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {31598#true} havoc ~__retres1~2; {31598#true} is VALID [2022-02-20 19:57:39,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {31603#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {31603#(= ~p_dw_st~0 0)} assume true; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,092 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31603#(= ~p_dw_st~0 0)} {31603#(= ~p_dw_st~0 0)} #1220#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {31598#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {31598#true} is VALID [2022-02-20 19:57:39,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {31598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {31598#true} is VALID [2022-02-20 19:57:39,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {31598#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {31598#true} is VALID [2022-02-20 19:57:39,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {31598#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; {31598#true} is VALID [2022-02-20 19:57:39,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {31598#true} call update_channels1(); {31638#(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:57:39,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {31638#(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); {31598#true} is VALID [2022-02-20 19:57:39,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,094 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31598#true} {31598#true} #1212#return; {31598#true} is VALID [2022-02-20 19:57:39,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {31598#true} assume { :begin_inline_init_threads1 } true; {31598#true} is VALID [2022-02-20 19:57:39,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {31598#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {31603#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {31603#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,095 INFO L272 TraceCheckUtils]: 12: Hoare triple {31603#(= ~p_dw_st~0 0)} call fire_delta_events1(); {31639#(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:57:39,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {31639#(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); {31598#true} is VALID [2022-02-20 19:57:39,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {31598#true} assume !(0 == ~q_write_ev~0); {31598#true} is VALID [2022-02-20 19:57:39,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,096 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31598#true} {31603#(= ~p_dw_st~0 0)} #1214#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,097 INFO L272 TraceCheckUtils]: 17: Hoare triple {31603#(= ~p_dw_st~0 0)} call activate_threads1(); {31640#(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:57:39,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {31640#(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; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,097 INFO L272 TraceCheckUtils]: 19: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {31598#true} is VALID [2022-02-20 19:57:39,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {31598#true} havoc ~__retres1~0; {31598#true} is VALID [2022-02-20 19:57:39,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {31598#true} assume !(1 == ~p_dw_pc~0); {31598#true} is VALID [2022-02-20 19:57:39,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {31598#true} ~__retres1~0 := 0; {31598#true} is VALID [2022-02-20 19:57:39,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {31598#true} #res := ~__retres1~0; {31598#true} is VALID [2022-02-20 19:57:39,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,098 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {31598#true} {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1208#return; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,099 INFO L272 TraceCheckUtils]: 28: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {31598#true} is VALID [2022-02-20 19:57:39,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {31598#true} havoc ~__retres1~1; {31598#true} is VALID [2022-02-20 19:57:39,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {31598#true} assume !(1 == ~c_dr_pc~0); {31598#true} is VALID [2022-02-20 19:57:39,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {31598#true} ~__retres1~1 := 0; {31598#true} is VALID [2022-02-20 19:57:39,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {31598#true} #res := ~__retres1~1; {31598#true} is VALID [2022-02-20 19:57:39,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,100 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {31598#true} {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1210#return; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:39,101 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31641#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {31603#(= ~p_dw_st~0 0)} #1216#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,102 INFO L272 TraceCheckUtils]: 39: Hoare triple {31603#(= ~p_dw_st~0 0)} call reset_delta_events1(); {31639#(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:57:39,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {31639#(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); {31598#true} is VALID [2022-02-20 19:57:39,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {31598#true} assume !(1 == ~q_write_ev~0); {31598#true} is VALID [2022-02-20 19:57:39,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {31598#true} assume true; {31598#true} is VALID [2022-02-20 19:57:39,103 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {31598#true} {31603#(= ~p_dw_st~0 0)} #1218#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {31603#(= ~p_dw_st~0 0)} assume !false; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {31603#(= ~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; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {31603#(= ~p_dw_st~0 0)} assume !false; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,104 INFO L272 TraceCheckUtils]: 47: Hoare triple {31603#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {31598#true} is VALID [2022-02-20 19:57:39,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {31598#true} havoc ~__retres1~2; {31598#true} is VALID [2022-02-20 19:57:39,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {31598#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {31603#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {31603#(= ~p_dw_st~0 0)} assume true; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,105 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31603#(= ~p_dw_st~0 0)} {31603#(= ~p_dw_st~0 0)} #1220#return; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {31603#(= ~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; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {31603#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {31603#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {31603#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {31599#false} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {31599#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; {31599#false} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {31599#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; {31599#false} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {31599#false} assume 0 == ~c_dr_pc~0; {31599#false} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {31599#false} assume !false; {31599#false} is VALID [2022-02-20 19:57:39,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {31599#false} assume !(1 == ~q_free~0); {31599#false} is VALID [2022-02-20 19:57:39,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {31599#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; {31599#false} is VALID [2022-02-20 19:57:39,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {31599#false} assume !(~p_last_write~0 == ~c_last_read~0); {31599#false} is VALID [2022-02-20 19:57:39,107 INFO L272 TraceCheckUtils]: 63: Hoare triple {31599#false} call error1(); {31599#false} is VALID [2022-02-20 19:57:39,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {31599#false} assume !false; {31599#false} is VALID [2022-02-20 19:57:39,107 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:57:39,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:39,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834254648] [2022-02-20 19:57:39,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834254648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:39,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:39,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:39,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194170276] [2022-02-20 19:57:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:39,108 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:57:39,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:39,109 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:57:39,146 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:57:39,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:39,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:39,147 INFO L87 Difference]: Start difference. First operand 1373 states and 1822 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:57:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:41,407 INFO L93 Difference]: Finished difference Result 3727 states and 4840 transitions. [2022-02-20 19:57:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:41,408 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:57:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:41,408 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:57:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 755 transitions. [2022-02-20 19:57:41,412 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:57:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 755 transitions. [2022-02-20 19:57:41,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 755 transitions. [2022-02-20 19:57:41,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:42,223 INFO L225 Difference]: With dead ends: 3727 [2022-02-20 19:57:42,223 INFO L226 Difference]: Without dead ends: 2591 [2022-02-20 19:57:42,225 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:57:42,225 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 918 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:42,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [945 Valid, 1355 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:57:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2022-02-20 19:57:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2471. [2022-02-20 19:57:42,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:42,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2591 states. Second operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:42,347 INFO L74 IsIncluded]: Start isIncluded. First operand 2591 states. Second operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:42,349 INFO L87 Difference]: Start difference. First operand 2591 states. Second operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,552 INFO L93 Difference]: Finished difference Result 2591 states and 3323 transitions. [2022-02-20 19:57:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3323 transitions. [2022-02-20 19:57:42,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:42,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:42,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) Second operand 2591 states. [2022-02-20 19:57:42,563 INFO L87 Difference]: Start difference. First operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) Second operand 2591 states. [2022-02-20 19:57:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,756 INFO L93 Difference]: Finished difference Result 2591 states and 3323 transitions. [2022-02-20 19:57:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3323 transitions. [2022-02-20 19:57:42,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:42,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:42,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:42,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-02-20 19:57:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3190 transitions. [2022-02-20 19:57:43,014 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3190 transitions. Word has length 65 [2022-02-20 19:57:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:43,014 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3190 transitions. [2022-02-20 19:57:43,015 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:57:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3190 transitions. [2022-02-20 19:57:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:43,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:43,016 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:57:43,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:43,016 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1359463327, now seen corresponding path program 1 times [2022-02-20 19:57:43,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:43,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280276564] [2022-02-20 19:57:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {45232#(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); {45192#true} is VALID [2022-02-20 19:57:43,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1212#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {45233#(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); {45192#true} is VALID [2022-02-20 19:57:43,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume !(0 == ~q_write_ev~0); {45192#true} is VALID [2022-02-20 19:57:43,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1214#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {45192#true} havoc ~__retres1~0; {45192#true} is VALID [2022-02-20 19:57:43,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume !(1 == ~p_dw_pc~0); {45192#true} is VALID [2022-02-20 19:57:43,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} ~__retres1~0 := 0; {45192#true} is VALID [2022-02-20 19:57:43,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {45192#true} #res := ~__retres1~0; {45192#true} is VALID [2022-02-20 19:57:43,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,080 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45192#true} {45192#true} #1208#return; {45192#true} is VALID [2022-02-20 19:57:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {45192#true} havoc ~__retres1~1; {45192#true} is VALID [2022-02-20 19:57:43,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume !(1 == ~c_dr_pc~0); {45192#true} is VALID [2022-02-20 19:57:43,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} ~__retres1~1 := 0; {45192#true} is VALID [2022-02-20 19:57:43,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {45192#true} #res := ~__retres1~1; {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45192#true} {45192#true} #1210#return; {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {45234#(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; {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L272 TraceCheckUtils]: 1: Hoare triple {45192#true} call #t~ret8 := is_do_write_p_triggered(); {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} havoc ~__retres1~0; {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {45192#true} assume !(1 == ~p_dw_pc~0); {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {45192#true} ~__retres1~0 := 0; {45192#true} is VALID [2022-02-20 19:57:43,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {45192#true} #res := ~__retres1~0; {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45192#true} {45192#true} #1208#return; {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {45192#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {45192#true} assume !(0 != ~tmp~1); {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L272 TraceCheckUtils]: 10: Hoare triple {45192#true} call #t~ret9 := is_do_read_c_triggered(); {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {45192#true} havoc ~__retres1~1; {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {45192#true} assume !(1 == ~c_dr_pc~0); {45192#true} is VALID [2022-02-20 19:57:43,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {45192#true} ~__retres1~1 := 0; {45192#true} is VALID [2022-02-20 19:57:43,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {45192#true} #res := ~__retres1~1; {45192#true} is VALID [2022-02-20 19:57:43,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,086 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45192#true} {45192#true} #1210#return; {45192#true} is VALID [2022-02-20 19:57:43,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {45192#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45192#true} is VALID [2022-02-20 19:57:43,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {45192#true} assume !(0 != ~tmp___0~1); {45192#true} is VALID [2022-02-20 19:57:43,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,087 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1216#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {45233#(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); {45192#true} is VALID [2022-02-20 19:57:43,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume !(1 == ~q_write_ev~0); {45192#true} is VALID [2022-02-20 19:57:43,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1218#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {45192#true} havoc ~__retres1~2; {45192#true} is VALID [2022-02-20 19:57:43,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45192#true} is VALID [2022-02-20 19:57:43,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} #res := ~__retres1~2; {45192#true} is VALID [2022-02-20 19:57:43,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,103 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1220#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {45192#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {45192#true} is VALID [2022-02-20 19:57:43,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {45192#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {45192#true} is VALID [2022-02-20 19:57:43,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {45192#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {45194#(= ~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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {45194#(= ~q_free~0 1)} call update_channels1(); {45232#(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:57:43,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {45232#(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); {45192#true} is VALID [2022-02-20 19:57:43,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,105 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1212#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {45194#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {45194#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {45194#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {45194#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,107 INFO L272 TraceCheckUtils]: 12: Hoare triple {45194#(= ~q_free~0 1)} call fire_delta_events1(); {45233#(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:57:43,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {45233#(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); {45192#true} is VALID [2022-02-20 19:57:43,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {45192#true} assume !(0 == ~q_write_ev~0); {45192#true} is VALID [2022-02-20 19:57:43,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,108 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1214#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,108 INFO L272 TraceCheckUtils]: 17: Hoare triple {45194#(= ~q_free~0 1)} call activate_threads1(); {45234#(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:57:43,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {45234#(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; {45192#true} is VALID [2022-02-20 19:57:43,108 INFO L272 TraceCheckUtils]: 19: Hoare triple {45192#true} call #t~ret8 := is_do_write_p_triggered(); {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {45192#true} havoc ~__retres1~0; {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {45192#true} assume !(1 == ~p_dw_pc~0); {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {45192#true} ~__retres1~0 := 0; {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {45192#true} #res := ~__retres1~0; {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45192#true} {45192#true} #1208#return; {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {45192#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45192#true} is VALID [2022-02-20 19:57:43,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {45192#true} assume !(0 != ~tmp~1); {45192#true} is VALID [2022-02-20 19:57:43,111 INFO L272 TraceCheckUtils]: 28: Hoare triple {45192#true} call #t~ret9 := is_do_read_c_triggered(); {45192#true} is VALID [2022-02-20 19:57:43,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {45192#true} havoc ~__retres1~1; {45192#true} is VALID [2022-02-20 19:57:43,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {45192#true} assume !(1 == ~c_dr_pc~0); {45192#true} is VALID [2022-02-20 19:57:43,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {45192#true} ~__retres1~1 := 0; {45192#true} is VALID [2022-02-20 19:57:43,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {45192#true} #res := ~__retres1~1; {45192#true} is VALID [2022-02-20 19:57:43,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,112 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45192#true} {45192#true} #1210#return; {45192#true} is VALID [2022-02-20 19:57:43,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {45192#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45192#true} is VALID [2022-02-20 19:57:43,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {45192#true} assume !(0 != ~tmp___0~1); {45192#true} is VALID [2022-02-20 19:57:43,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,112 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1216#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,113 INFO L272 TraceCheckUtils]: 39: Hoare triple {45194#(= ~q_free~0 1)} call reset_delta_events1(); {45233#(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:57:43,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {45233#(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); {45192#true} is VALID [2022-02-20 19:57:43,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {45192#true} assume !(1 == ~q_write_ev~0); {45192#true} is VALID [2022-02-20 19:57:43,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,114 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1218#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {45194#(= ~q_free~0 1)} assume !false; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {45194#(= ~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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {45194#(= ~q_free~0 1)} assume !false; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,115 INFO L272 TraceCheckUtils]: 47: Hoare triple {45194#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45192#true} is VALID [2022-02-20 19:57:43,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {45192#true} havoc ~__retres1~2; {45192#true} is VALID [2022-02-20 19:57:43,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {45192#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45192#true} is VALID [2022-02-20 19:57:43,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {45192#true} #res := ~__retres1~2; {45192#true} is VALID [2022-02-20 19:57:43,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {45192#true} assume true; {45192#true} is VALID [2022-02-20 19:57:43,115 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {45192#true} {45194#(= ~q_free~0 1)} #1220#return; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {45194#(= ~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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {45194#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {45194#(= ~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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {45194#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {45194#(= ~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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {45194#(= ~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; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {45194#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {45194#(= ~q_free~0 1)} assume !false; {45194#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:43,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {45194#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {45193#false} is VALID [2022-02-20 19:57:43,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {45193#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; {45193#false} is VALID [2022-02-20 19:57:43,118 INFO L290 TraceCheckUtils]: 63: Hoare triple {45193#false} assume !(~p_last_write~0 == ~c_last_read~0); {45193#false} is VALID [2022-02-20 19:57:43,119 INFO L272 TraceCheckUtils]: 64: Hoare triple {45193#false} call error1(); {45193#false} is VALID [2022-02-20 19:57:43,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {45193#false} assume !false; {45193#false} is VALID [2022-02-20 19:57:43,119 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:57:43,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:43,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280276564] [2022-02-20 19:57:43,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280276564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:43,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:43,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:43,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47494371] [2022-02-20 19:57:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:43,121 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:57:43,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:43,121 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:57:43,167 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:57:43,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:43,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:43,168 INFO L87 Difference]: Start difference. First operand 2471 states and 3190 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:57:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:46,185 INFO L93 Difference]: Finished difference Result 5865 states and 7498 transitions. [2022-02-20 19:57:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:46,186 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:57:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:46,187 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:57:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 745 transitions. [2022-02-20 19:57:46,210 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:57:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 745 transitions. [2022-02-20 19:57:46,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 745 transitions. [2022-02-20 19:57:46,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 745 edges. 745 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:47,336 INFO L225 Difference]: With dead ends: 5865 [2022-02-20 19:57:47,336 INFO L226 Difference]: Without dead ends: 3636 [2022-02-20 19:57:47,339 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:57:47,339 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 583 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:47,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 1329 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:57:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2022-02-20 19:57:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3305. [2022-02-20 19:57:47,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:47,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3636 states. Second operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:47,477 INFO L74 IsIncluded]: Start isIncluded. First operand 3636 states. Second operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:47,480 INFO L87 Difference]: Start difference. First operand 3636 states. Second operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,859 INFO L93 Difference]: Finished difference Result 3636 states and 4610 transitions. [2022-02-20 19:57:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 4610 transitions. [2022-02-20 19:57:47,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:47,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:47,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) Second operand 3636 states. [2022-02-20 19:57:47,871 INFO L87 Difference]: Start difference. First operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) Second operand 3636 states. [2022-02-20 19:57:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,233 INFO L93 Difference]: Finished difference Result 3636 states and 4610 transitions. [2022-02-20 19:57:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 4610 transitions. [2022-02-20 19:57:48,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:48,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-02-20 19:57:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4207 transitions. [2022-02-20 19:57:48,689 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4207 transitions. Word has length 66 [2022-02-20 19:57:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:48,689 INFO L470 AbstractCegarLoop]: Abstraction has 3305 states and 4207 transitions. [2022-02-20 19:57:48,690 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:57:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4207 transitions. [2022-02-20 19:57:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:48,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:48,693 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:57:48,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:48,693 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1540190304, now seen corresponding path program 1 times [2022-02-20 19:57:48,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:48,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043682859] [2022-02-20 19:57:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {64883#(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); {64843#true} is VALID [2022-02-20 19:57:48,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1212#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {64884#(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); {64843#true} is VALID [2022-02-20 19:57:48,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume !(0 == ~q_write_ev~0); {64843#true} is VALID [2022-02-20 19:57:48,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1214#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {64843#true} havoc ~__retres1~0; {64843#true} is VALID [2022-02-20 19:57:48,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume !(1 == ~p_dw_pc~0); {64843#true} is VALID [2022-02-20 19:57:48,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} ~__retres1~0 := 0; {64843#true} is VALID [2022-02-20 19:57:48,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {64843#true} #res := ~__retres1~0; {64843#true} is VALID [2022-02-20 19:57:48,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,749 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {64843#true} {64843#true} #1208#return; {64843#true} is VALID [2022-02-20 19:57:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {64843#true} havoc ~__retres1~1; {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume !(1 == ~c_dr_pc~0); {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} ~__retres1~1 := 0; {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {64843#true} #res := ~__retres1~1; {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {64843#true} {64843#true} #1210#return; {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {64885#(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; {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L272 TraceCheckUtils]: 1: Hoare triple {64843#true} call #t~ret8 := is_do_write_p_triggered(); {64843#true} is VALID [2022-02-20 19:57:48,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} havoc ~__retres1~0; {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {64843#true} assume !(1 == ~p_dw_pc~0); {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {64843#true} ~__retres1~0 := 0; {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {64843#true} #res := ~__retres1~0; {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64843#true} {64843#true} #1208#return; {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {64843#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {64843#true} assume !(0 != ~tmp~1); {64843#true} is VALID [2022-02-20 19:57:48,752 INFO L272 TraceCheckUtils]: 10: Hoare triple {64843#true} call #t~ret9 := is_do_read_c_triggered(); {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {64843#true} havoc ~__retres1~1; {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {64843#true} assume !(1 == ~c_dr_pc~0); {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {64843#true} ~__retres1~1 := 0; {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {64843#true} #res := ~__retres1~1; {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64843#true} {64843#true} #1210#return; {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {64843#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {64843#true} assume !(0 != ~tmp___0~1); {64843#true} is VALID [2022-02-20 19:57:48,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,754 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1216#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {64884#(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); {64843#true} is VALID [2022-02-20 19:57:48,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume !(1 == ~q_write_ev~0); {64843#true} is VALID [2022-02-20 19:57:48,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1218#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {64843#true} havoc ~__retres1~2; {64843#true} is VALID [2022-02-20 19:57:48,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64843#true} is VALID [2022-02-20 19:57:48,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} #res := ~__retres1~2; {64843#true} is VALID [2022-02-20 19:57:48,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,760 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1220#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {64843#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {64843#true} is VALID [2022-02-20 19:57:48,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {64843#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {64843#true} is VALID [2022-02-20 19:57:48,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {64843#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {64845#(= ~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; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {64845#(= ~p_dw_pc~0 0)} call update_channels1(); {64883#(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:57:48,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {64883#(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); {64843#true} is VALID [2022-02-20 19:57:48,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,762 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1212#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,763 INFO L272 TraceCheckUtils]: 12: Hoare triple {64845#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {64884#(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:57:48,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {64884#(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); {64843#true} is VALID [2022-02-20 19:57:48,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {64843#true} assume !(0 == ~q_write_ev~0); {64843#true} is VALID [2022-02-20 19:57:48,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,764 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1214#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {64845#(= ~p_dw_pc~0 0)} call activate_threads1(); {64885#(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:57:48,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {64885#(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; {64843#true} is VALID [2022-02-20 19:57:48,764 INFO L272 TraceCheckUtils]: 19: Hoare triple {64843#true} call #t~ret8 := is_do_write_p_triggered(); {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {64843#true} havoc ~__retres1~0; {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {64843#true} assume !(1 == ~p_dw_pc~0); {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {64843#true} ~__retres1~0 := 0; {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {64843#true} #res := ~__retres1~0; {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {64843#true} {64843#true} #1208#return; {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {64843#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {64843#true} assume !(0 != ~tmp~1); {64843#true} is VALID [2022-02-20 19:57:48,765 INFO L272 TraceCheckUtils]: 28: Hoare triple {64843#true} call #t~ret9 := is_do_read_c_triggered(); {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {64843#true} havoc ~__retres1~1; {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {64843#true} assume !(1 == ~c_dr_pc~0); {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {64843#true} ~__retres1~1 := 0; {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {64843#true} #res := ~__retres1~1; {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {64843#true} {64843#true} #1210#return; {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {64843#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {64843#true} assume !(0 != ~tmp___0~1); {64843#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,767 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1216#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,767 INFO L272 TraceCheckUtils]: 39: Hoare triple {64845#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {64884#(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:57:48,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {64884#(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); {64843#true} is VALID [2022-02-20 19:57:48,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {64843#true} assume !(1 == ~q_write_ev~0); {64843#true} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,768 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1218#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume !false; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {64845#(= ~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; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume !false; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,769 INFO L272 TraceCheckUtils]: 47: Hoare triple {64845#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64843#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {64843#true} havoc ~__retres1~2; {64843#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {64843#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64843#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {64843#true} #res := ~__retres1~2; {64843#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {64843#true} assume true; {64843#true} is VALID [2022-02-20 19:57:48,770 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {64843#true} {64845#(= ~p_dw_pc~0 0)} #1220#return; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {64845#(= ~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; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {64845#(= ~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; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,771 INFO L290 TraceCheckUtils]: 56: Hoare triple {64845#(= ~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; {64845#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:48,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {64845#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {64844#false} is VALID [2022-02-20 19:57:48,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {64844#false} assume 1 == ~p_dw_pc~0; {64844#false} is VALID [2022-02-20 19:57:48,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {64844#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; {64844#false} is VALID [2022-02-20 19:57:48,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {64844#false} assume !false; {64844#false} is VALID [2022-02-20 19:57:48,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {64844#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {64844#false} assume { :end_inline_do_write_p } true; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {64844#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; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {64844#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; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {64844#false} assume 0 == ~c_dr_pc~0; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {64844#false} assume !false; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {64844#false} assume !(1 == ~q_free~0); {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {64844#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; {64844#false} is VALID [2022-02-20 19:57:48,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {64844#false} assume !(~p_last_write~0 == ~c_last_read~0); {64844#false} is VALID [2022-02-20 19:57:48,773 INFO L272 TraceCheckUtils]: 70: Hoare triple {64844#false} call error1(); {64844#false} is VALID [2022-02-20 19:57:48,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {64844#false} assume !false; {64844#false} is VALID [2022-02-20 19:57:48,773 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:57:48,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:48,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043682859] [2022-02-20 19:57:48,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043682859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:48,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:48,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:48,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073779222] [2022-02-20 19:57:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:48,774 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:57:48,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:48,774 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:57:48,814 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:57:48,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:48,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:48,815 INFO L87 Difference]: Start difference. First operand 3305 states and 4207 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:57:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:52,372 INFO L93 Difference]: Finished difference Result 7291 states and 9206 transitions. [2022-02-20 19:57:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:52,373 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:57:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:52,373 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:57:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 748 transitions. [2022-02-20 19:57:52,387 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:57:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 748 transitions. [2022-02-20 19:57:52,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 748 transitions. [2022-02-20 19:57:52,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 748 edges. 748 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:53,638 INFO L225 Difference]: With dead ends: 7291 [2022-02-20 19:57:53,638 INFO L226 Difference]: Without dead ends: 4226 [2022-02-20 19:57:53,642 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:57:53,642 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 896 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:53,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 1203 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2022-02-20 19:57:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 3880. [2022-02-20 19:57:53,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:53,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4226 states. Second operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:53,783 INFO L74 IsIncluded]: Start isIncluded. First operand 4226 states. Second operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:53,786 INFO L87 Difference]: Start difference. First operand 4226 states. Second operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,315 INFO L93 Difference]: Finished difference Result 4226 states and 5336 transitions. [2022-02-20 19:57:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5336 transitions. [2022-02-20 19:57:54,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) Second operand 4226 states. [2022-02-20 19:57:54,330 INFO L87 Difference]: Start difference. First operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) Second operand 4226 states. [2022-02-20 19:57:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,880 INFO L93 Difference]: Finished difference Result 4226 states and 5336 transitions. [2022-02-20 19:57:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5336 transitions. [2022-02-20 19:57:54,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:54,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-02-20 19:57:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 4912 transitions. [2022-02-20 19:57:55,581 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 4912 transitions. Word has length 72 [2022-02-20 19:57:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:55,581 INFO L470 AbstractCegarLoop]: Abstraction has 3880 states and 4912 transitions. [2022-02-20 19:57:55,581 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:57:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 4912 transitions. [2022-02-20 19:57:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:55,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:55,583 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:57:55,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:55,583 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1017748717, now seen corresponding path program 1 times [2022-02-20 19:57:55,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:55,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934003048] [2022-02-20 19:57:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {88403#(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); {88362#true} is VALID [2022-02-20 19:57:55,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88362#true} {88362#true} #1212#return; {88362#true} is VALID [2022-02-20 19:57:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {88404#(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); {88362#true} is VALID [2022-02-20 19:57:55,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume !(0 == ~q_write_ev~0); {88362#true} is VALID [2022-02-20 19:57:55,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88362#true} {88362#true} #1214#return; {88362#true} is VALID [2022-02-20 19:57:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#true} havoc ~__retres1~0; {88362#true} is VALID [2022-02-20 19:57:55,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume !(1 == ~p_dw_pc~0); {88362#true} is VALID [2022-02-20 19:57:55,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} ~__retres1~0 := 0; {88362#true} is VALID [2022-02-20 19:57:55,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {88362#true} #res := ~__retres1~0; {88362#true} is VALID [2022-02-20 19:57:55,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,660 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {88362#true} {88362#true} #1208#return; {88362#true} is VALID [2022-02-20 19:57:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#true} havoc ~__retres1~1; {88362#true} is VALID [2022-02-20 19:57:55,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume !(1 == ~c_dr_pc~0); {88362#true} is VALID [2022-02-20 19:57:55,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} ~__retres1~1 := 0; {88362#true} is VALID [2022-02-20 19:57:55,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {88362#true} #res := ~__retres1~1; {88362#true} is VALID [2022-02-20 19:57:55,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {88362#true} {88362#true} #1210#return; {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {88405#(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; {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L272 TraceCheckUtils]: 1: Hoare triple {88362#true} call #t~ret8 := is_do_write_p_triggered(); {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} havoc ~__retres1~0; {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {88362#true} assume !(1 == ~p_dw_pc~0); {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {88362#true} ~__retres1~0 := 0; {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {88362#true} #res := ~__retres1~0; {88362#true} is VALID [2022-02-20 19:57:55,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {88362#true} {88362#true} #1208#return; {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {88362#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {88362#true} assume !(0 != ~tmp~1); {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L272 TraceCheckUtils]: 10: Hoare triple {88362#true} call #t~ret9 := is_do_read_c_triggered(); {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {88362#true} havoc ~__retres1~1; {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {88362#true} assume !(1 == ~c_dr_pc~0); {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {88362#true} ~__retres1~1 := 0; {88362#true} is VALID [2022-02-20 19:57:55,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {88362#true} #res := ~__retres1~1; {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {88362#true} {88362#true} #1210#return; {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {88362#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {88362#true} assume !(0 != ~tmp___0~1); {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {88362#true} {88362#true} #1216#return; {88362#true} is VALID [2022-02-20 19:57:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {88404#(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); {88362#true} is VALID [2022-02-20 19:57:55,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume !(1 == ~q_write_ev~0); {88362#true} is VALID [2022-02-20 19:57:55,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88362#true} {88362#true} #1218#return; {88362#true} is VALID [2022-02-20 19:57:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#true} havoc ~__retres1~2; {88362#true} is VALID [2022-02-20 19:57:55,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88362#true} is VALID [2022-02-20 19:57:55,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} #res := ~__retres1~2; {88362#true} is VALID [2022-02-20 19:57:55,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,671 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {88362#true} {88362#true} #1220#return; {88362#true} is VALID [2022-02-20 19:57:55,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {88362#true} is VALID [2022-02-20 19:57:55,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {88362#true} is VALID [2022-02-20 19:57:55,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {88362#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {88362#true} is VALID [2022-02-20 19:57:55,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {88362#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; {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {88362#true} call update_channels1(); {88403#(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:57:55,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {88403#(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); {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {88362#true} {88362#true} #1212#return; {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {88362#true} assume { :begin_inline_init_threads1 } true; {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {88362#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {88362#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {88362#true} is VALID [2022-02-20 19:57:55,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {88362#true} assume { :end_inline_init_threads1 } true; {88362#true} is VALID [2022-02-20 19:57:55,673 INFO L272 TraceCheckUtils]: 12: Hoare triple {88362#true} call fire_delta_events1(); {88404#(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:57:55,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {88404#(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); {88362#true} is VALID [2022-02-20 19:57:55,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {88362#true} assume !(0 == ~q_write_ev~0); {88362#true} is VALID [2022-02-20 19:57:55,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,673 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {88362#true} {88362#true} #1214#return; {88362#true} is VALID [2022-02-20 19:57:55,674 INFO L272 TraceCheckUtils]: 17: Hoare triple {88362#true} call activate_threads1(); {88405#(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:57:55,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {88405#(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; {88362#true} is VALID [2022-02-20 19:57:55,674 INFO L272 TraceCheckUtils]: 19: Hoare triple {88362#true} call #t~ret8 := is_do_write_p_triggered(); {88362#true} is VALID [2022-02-20 19:57:55,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {88362#true} havoc ~__retres1~0; {88362#true} is VALID [2022-02-20 19:57:55,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {88362#true} assume !(1 == ~p_dw_pc~0); {88362#true} is VALID [2022-02-20 19:57:55,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {88362#true} ~__retres1~0 := 0; {88362#true} is VALID [2022-02-20 19:57:55,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {88362#true} #res := ~__retres1~0; {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {88362#true} {88362#true} #1208#return; {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {88362#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {88362#true} assume !(0 != ~tmp~1); {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L272 TraceCheckUtils]: 28: Hoare triple {88362#true} call #t~ret9 := is_do_read_c_triggered(); {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {88362#true} havoc ~__retres1~1; {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {88362#true} assume !(1 == ~c_dr_pc~0); {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {88362#true} ~__retres1~1 := 0; {88362#true} is VALID [2022-02-20 19:57:55,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {88362#true} #res := ~__retres1~1; {88362#true} is VALID [2022-02-20 19:57:55,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,676 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {88362#true} {88362#true} #1210#return; {88362#true} is VALID [2022-02-20 19:57:55,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {88362#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {88362#true} is VALID [2022-02-20 19:57:55,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {88362#true} assume !(0 != ~tmp___0~1); {88362#true} is VALID [2022-02-20 19:57:55,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,676 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {88362#true} {88362#true} #1216#return; {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L272 TraceCheckUtils]: 39: Hoare triple {88362#true} call reset_delta_events1(); {88404#(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:57:55,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {88404#(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); {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {88362#true} assume !(1 == ~q_write_ev~0); {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {88362#true} {88362#true} #1218#return; {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {88362#true} assume !false; {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {88362#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; {88362#true} is VALID [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {88362#true} assume !false; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L272 TraceCheckUtils]: 47: Hoare triple {88362#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {88362#true} havoc ~__retres1~2; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L290 TraceCheckUtils]: 49: Hoare triple {88362#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {88362#true} #res := ~__retres1~2; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L290 TraceCheckUtils]: 51: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {88362#true} {88362#true} #1220#return; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {88362#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; {88362#true} is VALID [2022-02-20 19:57:55,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {88362#true} assume 0 != eval1_~tmp___1~0#1; {88362#true} is VALID [2022-02-20 19:57:55,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {88362#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; {88362#true} is VALID [2022-02-20 19:57:55,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {88362#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; {88362#true} is VALID [2022-02-20 19:57:55,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {88362#true} assume 0 == ~p_dw_pc~0; {88362#true} is VALID [2022-02-20 19:57:55,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {88362#true} assume !false; {88362#true} is VALID [2022-02-20 19:57:55,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {88362#true} assume !(0 == ~q_free~0); {88362#true} is VALID [2022-02-20 19:57:55,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {88362#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; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {88401#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {88401#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {88401#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {88401#(= ~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; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {88401#(= ~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; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {88401#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {88401#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {88401#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {88401#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {88401#(= ~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; {88402#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:55,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {88402#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {88363#false} is VALID [2022-02-20 19:57:55,683 INFO L272 TraceCheckUtils]: 71: Hoare triple {88363#false} call error1(); {88363#false} is VALID [2022-02-20 19:57:55,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {88363#false} assume !false; {88363#false} is VALID [2022-02-20 19:57:55,683 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:57:55,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:55,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934003048] [2022-02-20 19:57:55,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934003048] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:55,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:55,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:55,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500502117] [2022-02-20 19:57:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:55,685 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:57:55,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:55,685 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:57:55,727 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:57:55,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:55,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:55,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:55,728 INFO L87 Difference]: Start difference. First operand 3880 states and 4912 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:57:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,278 INFO L93 Difference]: Finished difference Result 5062 states and 6368 transitions. [2022-02-20 19:57:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:58,278 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:57:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:58,278 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:57:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 625 transitions. [2022-02-20 19:57:58,282 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:57:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 625 transitions. [2022-02-20 19:57:58,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 625 transitions. [2022-02-20 19:57:58,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:59,805 INFO L225 Difference]: With dead ends: 5062 [2022-02-20 19:57:59,805 INFO L226 Difference]: Without dead ends: 5059 [2022-02-20 19:57:59,807 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:57:59,813 INFO L933 BasicCegarLoop]: 491 mSDtfsCounter, 1576 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:59,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1585 Valid, 962 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2022-02-20 19:58:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4347. [2022-02-20 19:58:00,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:00,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5059 states. Second operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:58:00,146 INFO L74 IsIncluded]: Start isIncluded. First operand 5059 states. Second operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:58:00,153 INFO L87 Difference]: Start difference. First operand 5059 states. Second operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:58:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,835 INFO L93 Difference]: Finished difference Result 5059 states and 6348 transitions. [2022-02-20 19:58:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6348 transitions. [2022-02-20 19:58:00,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:00,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:00,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) Second operand 5059 states. [2022-02-20 19:58:00,850 INFO L87 Difference]: Start difference. First operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) Second operand 5059 states. [2022-02-20 19:58:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,605 INFO L93 Difference]: Finished difference Result 5059 states and 6348 transitions. [2022-02-20 19:58:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6348 transitions. [2022-02-20 19:58:01,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:01,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-02-20 19:58:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5473 transitions. [2022-02-20 19:58:02,426 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5473 transitions. Word has length 73 [2022-02-20 19:58:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:02,427 INFO L470 AbstractCegarLoop]: Abstraction has 4347 states and 5473 transitions. [2022-02-20 19:58:02,427 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:58:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5473 transitions. [2022-02-20 19:58:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:02,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:02,432 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:58:02,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:02,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1486432694, now seen corresponding path program 1 times [2022-02-20 19:58:02,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:02,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976785253] [2022-02-20 19:58:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {111180#(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); {111138#true} is VALID [2022-02-20 19:58:02,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1212#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {111181#(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); {111138#true} is VALID [2022-02-20 19:58:02,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume !(0 == ~q_write_ev~0); {111138#true} is VALID [2022-02-20 19:58:02,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1214#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {111138#true} havoc ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:02,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume !(1 == ~p_dw_pc~0); {111138#true} is VALID [2022-02-20 19:58:02,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} ~__retres1~0 := 0; {111138#true} is VALID [2022-02-20 19:58:02,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {111138#true} #res := ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:02,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,612 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111138#true} {111138#true} #1208#return; {111138#true} is VALID [2022-02-20 19:58:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {111138#true} havoc ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:02,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume !(1 == ~c_dr_pc~0); {111138#true} is VALID [2022-02-20 19:58:02,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} ~__retres1~1 := 0; {111138#true} is VALID [2022-02-20 19:58:02,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {111138#true} #res := ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:02,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,615 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111138#true} {111138#true} #1210#return; {111138#true} is VALID [2022-02-20 19:58:02,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {111182#(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; {111138#true} is VALID [2022-02-20 19:58:02,615 INFO L272 TraceCheckUtils]: 1: Hoare triple {111138#true} call #t~ret8 := is_do_write_p_triggered(); {111138#true} is VALID [2022-02-20 19:58:02,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} havoc ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {111138#true} assume !(1 == ~p_dw_pc~0); {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {111138#true} ~__retres1~0 := 0; {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {111138#true} #res := ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111138#true} {111138#true} #1208#return; {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {111138#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111138#true} is VALID [2022-02-20 19:58:02,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {111138#true} assume !(0 != ~tmp~1); {111138#true} is VALID [2022-02-20 19:58:02,617 INFO L272 TraceCheckUtils]: 10: Hoare triple {111138#true} call #t~ret9 := is_do_read_c_triggered(); {111138#true} is VALID [2022-02-20 19:58:02,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {111138#true} havoc ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:02,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {111138#true} assume !(1 == ~c_dr_pc~0); {111138#true} is VALID [2022-02-20 19:58:02,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {111138#true} ~__retres1~1 := 0; {111138#true} is VALID [2022-02-20 19:58:02,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {111138#true} #res := ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:02,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,618 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111138#true} {111138#true} #1210#return; {111138#true} is VALID [2022-02-20 19:58:02,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {111138#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111138#true} is VALID [2022-02-20 19:58:02,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {111138#true} assume !(0 != ~tmp___0~1); {111138#true} is VALID [2022-02-20 19:58:02,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,619 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1216#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {111181#(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); {111138#true} is VALID [2022-02-20 19:58:02,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume !(1 == ~q_write_ev~0); {111138#true} is VALID [2022-02-20 19:58:02,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1218#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {111138#true} havoc ~__retres1~2; {111138#true} is VALID [2022-02-20 19:58:02,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111138#true} is VALID [2022-02-20 19:58:02,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} #res := ~__retres1~2; {111138#true} is VALID [2022-02-20 19:58:02,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,631 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1220#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {111138#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111138#true} is VALID [2022-02-20 19:58:02,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {111138#true} is VALID [2022-02-20 19:58:02,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {111180#(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:02,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {111180#(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); {111138#true} is VALID [2022-02-20 19:58:02,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,633 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1212#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,636 INFO L272 TraceCheckUtils]: 12: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {111181#(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:02,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {111181#(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); {111138#true} is VALID [2022-02-20 19:58:02,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {111138#true} assume !(0 == ~q_write_ev~0); {111138#true} is VALID [2022-02-20 19:58:02,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,636 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1214#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,637 INFO L272 TraceCheckUtils]: 17: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {111182#(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:02,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {111182#(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; {111138#true} is VALID [2022-02-20 19:58:02,637 INFO L272 TraceCheckUtils]: 19: Hoare triple {111138#true} call #t~ret8 := is_do_write_p_triggered(); {111138#true} is VALID [2022-02-20 19:58:02,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {111138#true} havoc ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {111138#true} assume !(1 == ~p_dw_pc~0); {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {111138#true} ~__retres1~0 := 0; {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {111138#true} #res := ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111138#true} {111138#true} #1208#return; {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {111138#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111138#true} is VALID [2022-02-20 19:58:02,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {111138#true} assume !(0 != ~tmp~1); {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L272 TraceCheckUtils]: 28: Hoare triple {111138#true} call #t~ret9 := is_do_read_c_triggered(); {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {111138#true} havoc ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {111138#true} assume !(1 == ~c_dr_pc~0); {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {111138#true} ~__retres1~1 := 0; {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {111138#true} #res := ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,639 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111138#true} {111138#true} #1210#return; {111138#true} is VALID [2022-02-20 19:58:02,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {111138#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111138#true} is VALID [2022-02-20 19:58:02,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {111138#true} assume !(0 != ~tmp___0~1); {111138#true} is VALID [2022-02-20 19:58:02,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,640 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1216#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,641 INFO L272 TraceCheckUtils]: 39: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {111181#(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:02,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {111181#(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); {111138#true} is VALID [2022-02-20 19:58:02,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {111138#true} assume !(1 == ~q_write_ev~0); {111138#true} is VALID [2022-02-20 19:58:02,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,642 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1218#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,643 INFO L272 TraceCheckUtils]: 47: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111138#true} is VALID [2022-02-20 19:58:02,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {111138#true} havoc ~__retres1~2; {111138#true} is VALID [2022-02-20 19:58:02,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {111138#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111138#true} is VALID [2022-02-20 19:58:02,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {111138#true} #res := ~__retres1~2; {111138#true} is VALID [2022-02-20 19:58:02,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:02,644 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111138#true} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1220#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,645 INFO L290 TraceCheckUtils]: 54: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {111140#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {111178#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {111178#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {111178#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {111178#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:02,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:02,653 INFO L290 TraceCheckUtils]: 71: Hoare triple {111179#(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); {111139#false} is VALID [2022-02-20 19:58:02,653 INFO L272 TraceCheckUtils]: 72: Hoare triple {111139#false} call error1(); {111139#false} is VALID [2022-02-20 19:58:02,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {111139#false} assume !false; {111139#false} is VALID [2022-02-20 19:58:02,654 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:58:02,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:02,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976785253] [2022-02-20 19:58:02,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976785253] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:02,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230618385] [2022-02-20 19:58:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:02,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:02,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:02,665 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:58:02,666 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:58:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:03,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {111138#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111138#true} is VALID [2022-02-20 19:58:03,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {111138#true} is VALID [2022-02-20 19:58:03,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,387 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1212#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,390 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1214#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,390 INFO L272 TraceCheckUtils]: 17: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,393 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1208#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,394 INFO L272 TraceCheckUtils]: 28: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,396 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1210#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,397 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1216#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,398 INFO L272 TraceCheckUtils]: 39: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,402 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1218#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,403 INFO L272 TraceCheckUtils]: 47: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,405 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1220#return; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {111140#(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; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {111140#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {111140#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {111178#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {111178#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {111178#(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; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {111178#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {111178#(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; {111405#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {111405#(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; {111405#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {111405#(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); {111139#false} is VALID [2022-02-20 19:58:03,412 INFO L272 TraceCheckUtils]: 72: Hoare triple {111139#false} call error1(); {111139#false} is VALID [2022-02-20 19:58:03,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {111139#false} assume !false; {111139#false} is VALID [2022-02-20 19:58:03,412 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:58:03,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:03,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {111139#false} assume !false; {111139#false} is VALID [2022-02-20 19:58:03,754 INFO L272 TraceCheckUtils]: 72: Hoare triple {111139#false} call error1(); {111139#false} is VALID [2022-02-20 19:58:03,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {111179#(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); {111139#false} is VALID [2022-02-20 19:58:03,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {111430#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {111430#(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; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {111430#(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; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {111430#(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; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {111430#(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; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {111179#(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; {111430#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:03,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,762 INFO L290 TraceCheckUtils]: 55: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,763 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111138#true} {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1220#return; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {111138#true} #res := ~__retres1~2; {111138#true} is VALID [2022-02-20 19:58:03,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {111138#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111138#true} is VALID [2022-02-20 19:58:03,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {111138#true} havoc ~__retres1~2; {111138#true} is VALID [2022-02-20 19:58:03,764 INFO L272 TraceCheckUtils]: 47: Hoare triple {111179#(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(); {111138#true} is VALID [2022-02-20 19:58:03,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,765 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111138#true} {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1218#return; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {111138#true} assume !(1 == ~q_write_ev~0); {111138#true} is VALID [2022-02-20 19:58:03,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {111138#true} assume !(1 == ~q_read_ev~0); {111138#true} is VALID [2022-02-20 19:58:03,766 INFO L272 TraceCheckUtils]: 39: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {111138#true} is VALID [2022-02-20 19:58:03,766 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111138#true} {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1216#return; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {111138#true} assume !(0 != ~tmp___0~1); {111138#true} is VALID [2022-02-20 19:58:03,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {111138#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111138#true} {111138#true} #1210#return; {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {111138#true} #res := ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {111138#true} ~__retres1~1 := 0; {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {111138#true} assume !(1 == ~c_dr_pc~0); {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {111138#true} havoc ~__retres1~1; {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L272 TraceCheckUtils]: 28: Hoare triple {111138#true} call #t~ret9 := is_do_read_c_triggered(); {111138#true} is VALID [2022-02-20 19:58:03,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {111138#true} assume !(0 != ~tmp~1); {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {111138#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111138#true} {111138#true} #1208#return; {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {111138#true} #res := ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {111138#true} ~__retres1~0 := 0; {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {111138#true} assume !(1 == ~p_dw_pc~0); {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {111138#true} havoc ~__retres1~0; {111138#true} is VALID [2022-02-20 19:58:03,768 INFO L272 TraceCheckUtils]: 19: Hoare triple {111138#true} call #t~ret8 := is_do_write_p_triggered(); {111138#true} is VALID [2022-02-20 19:58:03,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {111138#true} havoc ~tmp~1;havoc ~tmp___0~1; {111138#true} is VALID [2022-02-20 19:58:03,769 INFO L272 TraceCheckUtils]: 17: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {111138#true} is VALID [2022-02-20 19:58:03,769 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111138#true} {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1214#return; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {111138#true} assume !(0 == ~q_write_ev~0); {111138#true} is VALID [2022-02-20 19:58:03,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {111138#true} assume !(0 == ~q_read_ev~0); {111138#true} is VALID [2022-02-20 19:58:03,770 INFO L272 TraceCheckUtils]: 12: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {111138#true} is VALID [2022-02-20 19:58:03,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,772 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111138#true} {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1212#return; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {111138#true} assume true; {111138#true} is VALID [2022-02-20 19:58:03,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {111138#true} assume !(1 == ~q_req_up~0); {111138#true} is VALID [2022-02-20 19:58:03,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {111138#true} is VALID [2022-02-20 19:58:03,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {111179#(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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {111138#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {111179#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:03,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {111138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {111138#true} is VALID [2022-02-20 19:58:03,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {111138#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111138#true} is VALID [2022-02-20 19:58:03,773 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:58:03,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230618385] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:03,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:03,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:03,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145074900] [2022-02-20 19:58:03,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:03,775 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:58:03,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:03,776 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:58:03,879 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:58:03,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:03,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:03,880 INFO L87 Difference]: Start difference. First operand 4347 states and 5473 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) [2022-02-20 19:58:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,827 INFO L93 Difference]: Finished difference Result 8888 states and 11081 transitions. [2022-02-20 19:58:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 19:58:12,828 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:58:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:58:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1094 transitions. [2022-02-20 19:58:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:58:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1094 transitions. [2022-02-20 19:58:12,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 1094 transitions. [2022-02-20 19:58:13,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1094 edges. 1094 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.