./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.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_3.cil+token_ring.07.cil-1.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 b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:11,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:11,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:11,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:11,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:11,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:11,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:11,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:11,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:11,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:11,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:11,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:11,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:11,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:11,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:11,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:11,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:11,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:11,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:11,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:11,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:11,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:11,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:11,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:11,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:11,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:11,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:11,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:11,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:11,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:11,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:11,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:11,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:11,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:11,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:11,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:11,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:11,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:11,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:11,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:11,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:11,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:00:11,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:11,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:11,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:11,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:11,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:11,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:11,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:11,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:11,628 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:11,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:11,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:11,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:11,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:11,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:11,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:11,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:11,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:11,631 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:11,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:11,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:11,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:11,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:11,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:11,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:11,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:11,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:11,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:11,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:11,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:11,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:11,635 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:11,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:11,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:11,636 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 -> b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 [2022-02-20 20:00:11,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:11,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:11,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:11,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:11,884 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:11,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2022-02-20 20:00:11,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc7ff0e5/dd086dba10a945af9da5a5ca60611025/FLAGc5b6b7d5d [2022-02-20 20:00:12,378 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:12,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2022-02-20 20:00:12,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc7ff0e5/dd086dba10a945af9da5a5ca60611025/FLAGc5b6b7d5d [2022-02-20 20:00:12,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc7ff0e5/dd086dba10a945af9da5a5ca60611025 [2022-02-20 20:00:12,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:12,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:12,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:12,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:12,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:12,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a2435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12, skipping insertion in model container [2022-02-20 20:00:12,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:12,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:12,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:12,625 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_3.cil+token_ring.07.cil-1.c[911,924] [2022-02-20 20:00:12,679 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_3.cil+token_ring.07.cil-1.c[8416,8429] [2022-02-20 20:00:12,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:12,785 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:12,794 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_3.cil+token_ring.07.cil-1.c[911,924] [2022-02-20 20:00:12,817 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_3.cil+token_ring.07.cil-1.c[8416,8429] [2022-02-20 20:00:12,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:12,915 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:12,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12 WrapperNode [2022-02-20 20:00:12,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:12,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:12,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:12,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:12,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:12,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,005 INFO L137 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 788 [2022-02-20 20:00:13,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:13,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:13,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:13,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:13,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:13,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:13,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:13,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:13,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (1/1) ... [2022-02-20 20:00:13,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:13,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:13,087 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 20:00:13,088 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 20:00:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:13,126 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:13,126 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:13,127 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:13,130 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:13,130 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:13,130 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:13,130 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:13,131 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:13,131 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:13,131 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:13,131 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:13,132 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:13,132 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:13,132 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:13,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:13,133 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:13,226 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:13,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:13,925 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:13,925 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:00:13,995 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:14,013 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:14,014 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 20:00:14,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:14 BoogieIcfgContainer [2022-02-20 20:00:14,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:14,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:14,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:14,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:14,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:12" (1/3) ... [2022-02-20 20:00:14,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5e0e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:14, skipping insertion in model container [2022-02-20 20:00:14,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:12" (2/3) ... [2022-02-20 20:00:14,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5e0e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:14, skipping insertion in model container [2022-02-20 20:00:14,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:14" (3/3) ... [2022-02-20 20:00:14,025 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-1.c [2022-02-20 20:00:14,030 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:14,030 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:14,086 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:14,093 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 20:00:14,094 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 320 states have (on average 1.6125) internal successors, (516), 326 states have internal predecessors, (516), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:14,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:14,152 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 20:00:14,153 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:14,158 INFO L85 PathProgramCache]: Analyzing trace with hash -334337363, now seen corresponding path program 1 times [2022-02-20 20:00:14,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:14,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53959006] [2022-02-20 20:00:14,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {417#(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#true} is VALID [2022-02-20 20:00:14,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#true} {379#(= 1 ~c_dr_i~0)} #1385#return; {379#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {418#(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; {377#true} is VALID [2022-02-20 20:00:14,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {377#true} is VALID [2022-02-20 20:00:14,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {378#false} #1387#return; {378#false} is VALID [2022-02-20 20:00:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} havoc ~__retres1~0; {377#true} is VALID [2022-02-20 20:00:14,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume 1 == ~p_dw_pc~0; {377#true} is VALID [2022-02-20 20:00:14,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {377#true} is VALID [2022-02-20 20:00:14,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#true} #res := ~__retres1~0; {377#true} is VALID [2022-02-20 20:00:14,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,551 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {377#true} {377#true} #1381#return; {377#true} is VALID [2022-02-20 20:00:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} havoc ~__retres1~1; {377#true} is VALID [2022-02-20 20:00:14,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume 1 == ~c_dr_pc~0; {377#true} is VALID [2022-02-20 20:00:14,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {377#true} is VALID [2022-02-20 20:00:14,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#true} #res := ~__retres1~1; {377#true} is VALID [2022-02-20 20:00:14,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,561 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {377#true} {377#true} #1383#return; {377#true} is VALID [2022-02-20 20:00:14,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#(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; {377#true} is VALID [2022-02-20 20:00:14,562 INFO L272 TraceCheckUtils]: 1: Hoare triple {377#true} call #t~ret8 := is_do_write_p_triggered(); {377#true} is VALID [2022-02-20 20:00:14,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} havoc ~__retres1~0; {377#true} is VALID [2022-02-20 20:00:14,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#true} assume 1 == ~p_dw_pc~0; {377#true} is VALID [2022-02-20 20:00:14,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {377#true} is VALID [2022-02-20 20:00:14,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} #res := ~__retres1~0; {377#true} is VALID [2022-02-20 20:00:14,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,564 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {377#true} {377#true} #1381#return; {377#true} is VALID [2022-02-20 20:00:14,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {377#true} is VALID [2022-02-20 20:00:14,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {377#true} is VALID [2022-02-20 20:00:14,565 INFO L272 TraceCheckUtils]: 10: Hoare triple {377#true} call #t~ret9 := is_do_read_c_triggered(); {377#true} is VALID [2022-02-20 20:00:14,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {377#true} havoc ~__retres1~1; {377#true} is VALID [2022-02-20 20:00:14,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#true} assume 1 == ~c_dr_pc~0; {377#true} is VALID [2022-02-20 20:00:14,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {377#true} is VALID [2022-02-20 20:00:14,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#true} #res := ~__retres1~1; {377#true} is VALID [2022-02-20 20:00:14,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,566 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {377#true} {377#true} #1383#return; {377#true} is VALID [2022-02-20 20:00:14,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {377#true} is VALID [2022-02-20 20:00:14,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {377#true} assume !(0 != ~tmp___0~1); {377#true} is VALID [2022-02-20 20:00:14,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,570 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {377#true} {378#false} #1389#return; {378#false} is VALID [2022-02-20 20:00:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {418#(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; {377#true} is VALID [2022-02-20 20:00:14,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {377#true} is VALID [2022-02-20 20:00:14,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {378#false} #1391#return; {378#false} is VALID [2022-02-20 20:00:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} havoc ~__retres1~2; {377#true} is VALID [2022-02-20 20:00:14,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {377#true} is VALID [2022-02-20 20:00:14,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} #res := ~__retres1~2; {377#true} is VALID [2022-02-20 20:00:14,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,591 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {377#true} {378#false} #1393#return; {378#false} is VALID [2022-02-20 20:00:14,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {377#true} is VALID [2022-02-20 20:00:14,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {377#true} is VALID [2022-02-20 20:00:14,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {379#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:14,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {379#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {379#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:14,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#(= 1 ~c_dr_i~0)} call update_channels1(); {417#(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 20:00:14,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#(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#true} is VALID [2022-02-20 20:00:14,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,601 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {377#true} {379#(= 1 ~c_dr_i~0)} #1385#return; {379#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:14,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {379#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:14,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {379#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {379#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:14,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {378#false} is VALID [2022-02-20 20:00:14,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#false} assume { :end_inline_init_threads1 } true; {378#false} is VALID [2022-02-20 20:00:14,604 INFO L272 TraceCheckUtils]: 12: Hoare triple {378#false} call fire_delta_events1(); {418#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:14,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#(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; {377#true} is VALID [2022-02-20 20:00:14,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {377#true} is VALID [2022-02-20 20:00:14,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,605 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {377#true} {378#false} #1387#return; {378#false} is VALID [2022-02-20 20:00:14,605 INFO L272 TraceCheckUtils]: 17: Hoare triple {378#false} call activate_threads1(); {419#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:14,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {419#(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; {377#true} is VALID [2022-02-20 20:00:14,606 INFO L272 TraceCheckUtils]: 19: Hoare triple {377#true} call #t~ret8 := is_do_write_p_triggered(); {377#true} is VALID [2022-02-20 20:00:14,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {377#true} havoc ~__retres1~0; {377#true} is VALID [2022-02-20 20:00:14,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {377#true} assume 1 == ~p_dw_pc~0; {377#true} is VALID [2022-02-20 20:00:14,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {377#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {377#true} is VALID [2022-02-20 20:00:14,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {377#true} #res := ~__retres1~0; {377#true} is VALID [2022-02-20 20:00:14,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,607 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {377#true} {377#true} #1381#return; {377#true} is VALID [2022-02-20 20:00:14,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {377#true} is VALID [2022-02-20 20:00:14,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {377#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {377#true} is VALID [2022-02-20 20:00:14,608 INFO L272 TraceCheckUtils]: 28: Hoare triple {377#true} call #t~ret9 := is_do_read_c_triggered(); {377#true} is VALID [2022-02-20 20:00:14,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {377#true} havoc ~__retres1~1; {377#true} is VALID [2022-02-20 20:00:14,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {377#true} assume 1 == ~c_dr_pc~0; {377#true} is VALID [2022-02-20 20:00:14,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {377#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {377#true} is VALID [2022-02-20 20:00:14,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {377#true} #res := ~__retres1~1; {377#true} is VALID [2022-02-20 20:00:14,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,610 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {377#true} {377#true} #1383#return; {377#true} is VALID [2022-02-20 20:00:14,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {377#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {377#true} is VALID [2022-02-20 20:00:14,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {377#true} assume !(0 != ~tmp___0~1); {377#true} is VALID [2022-02-20 20:00:14,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,611 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {377#true} {378#false} #1389#return; {378#false} is VALID [2022-02-20 20:00:14,611 INFO L272 TraceCheckUtils]: 39: Hoare triple {378#false} call reset_delta_events1(); {418#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:14,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {418#(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; {377#true} is VALID [2022-02-20 20:00:14,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {377#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {377#true} is VALID [2022-02-20 20:00:14,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,612 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {377#true} {378#false} #1391#return; {378#false} is VALID [2022-02-20 20:00:14,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-02-20 20:00:14,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {378#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; {378#false} is VALID [2022-02-20 20:00:14,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-02-20 20:00:14,613 INFO L272 TraceCheckUtils]: 47: Hoare triple {378#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {377#true} is VALID [2022-02-20 20:00:14,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {377#true} havoc ~__retres1~2; {377#true} is VALID [2022-02-20 20:00:14,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {377#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {377#true} is VALID [2022-02-20 20:00:14,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {377#true} #res := ~__retres1~2; {377#true} is VALID [2022-02-20 20:00:14,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {377#true} assume true; {377#true} is VALID [2022-02-20 20:00:14,617 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {377#true} {378#false} #1393#return; {378#false} is VALID [2022-02-20 20:00:14,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {378#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; {378#false} is VALID [2022-02-20 20:00:14,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {378#false} assume 0 != eval1_~tmp___1~0#1; {378#false} is VALID [2022-02-20 20:00:14,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {378#false} assume !(0 == ~p_dw_st~0); {378#false} is VALID [2022-02-20 20:00:14,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {378#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; {378#false} is VALID [2022-02-20 20:00:14,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {378#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; {378#false} is VALID [2022-02-20 20:00:14,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {378#false} assume !(0 == ~c_dr_pc~0); {378#false} is VALID [2022-02-20 20:00:14,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {378#false} assume 2 == ~c_dr_pc~0; {378#false} is VALID [2022-02-20 20:00:14,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {378#false} do_read_c_~a~0#1 := ~a_t~0; {378#false} is VALID [2022-02-20 20:00:14,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {378#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; {378#false} is VALID [2022-02-20 20:00:14,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {378#false} assume !(~p_last_write~0 == ~c_last_read~0); {378#false} is VALID [2022-02-20 20:00:14,620 INFO L272 TraceCheckUtils]: 63: Hoare triple {378#false} call error1(); {378#false} is VALID [2022-02-20 20:00:14,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-02-20 20:00:14,621 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 20:00:14,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:14,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53959006] [2022-02-20 20:00:14,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53959006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:14,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:14,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:14,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233378775] [2022-02-20 20:00:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:14,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:14,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:14,702 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 20:00:14,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:14,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:14,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:14,734 INFO L87 Difference]: Start difference. First operand has 374 states, 320 states have (on average 1.6125) internal successors, (516), 326 states have internal predecessors, (516), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:16,909 INFO L93 Difference]: Finished difference Result 743 states and 1170 transitions. [2022-02-20 20:00:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:16,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1170 transitions. [2022-02-20 20:00:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1170 transitions. [2022-02-20 20:00:16,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1170 transitions. [2022-02-20 20:00:17,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1170 edges. 1170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:17,880 INFO L225 Difference]: With dead ends: 743 [2022-02-20 20:00:17,881 INFO L226 Difference]: Without dead ends: 382 [2022-02-20 20:00:17,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:17,888 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 586 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:17,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 1507 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:00:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-02-20 20:00:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2022-02-20 20:00:17,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:17,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 364 states, 312 states have (on average 1.5224358974358974) internal successors, (475), 316 states have internal predecessors, (475), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:17,942 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 364 states, 312 states have (on average 1.5224358974358974) internal successors, (475), 316 states have internal predecessors, (475), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:17,943 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 364 states, 312 states have (on average 1.5224358974358974) internal successors, (475), 316 states have internal predecessors, (475), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:17,961 INFO L93 Difference]: Finished difference Result 382 states and 576 transitions. [2022-02-20 20:00:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 576 transitions. [2022-02-20 20:00:17,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:17,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:17,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 312 states have (on average 1.5224358974358974) internal successors, (475), 316 states have internal predecessors, (475), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 382 states. [2022-02-20 20:00:17,968 INFO L87 Difference]: Start difference. First operand has 364 states, 312 states have (on average 1.5224358974358974) internal successors, (475), 316 states have internal predecessors, (475), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 382 states. [2022-02-20 20:00:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:17,986 INFO L93 Difference]: Finished difference Result 382 states and 576 transitions. [2022-02-20 20:00:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 576 transitions. [2022-02-20 20:00:17,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:17,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:17,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:17,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 312 states have (on average 1.5224358974358974) internal successors, (475), 316 states have internal predecessors, (475), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 547 transitions. [2022-02-20 20:00:18,008 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 547 transitions. Word has length 65 [2022-02-20 20:00:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:18,009 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 547 transitions. [2022-02-20 20:00:18,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 547 transitions. [2022-02-20 20:00:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:18,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:18,011 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 20:00:18,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:18,012 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1721122773, now seen corresponding path program 1 times [2022-02-20 20:00:18,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:18,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299813703] [2022-02-20 20:00:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {2722#(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); {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:18,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:18,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2684#(= ~q_read_ev~0 2)} #1385#return; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {2724#(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; {2725#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:18,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2725#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:18,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {2725#(= |old(~q_read_ev~0)| 0)} assume true; {2725#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:18,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2725#(= |old(~q_read_ev~0)| 0)} {2684#(= ~q_read_ev~0 2)} #1387#return; {2683#false} is VALID [2022-02-20 20:00:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {2682#true} havoc ~__retres1~0; {2682#true} is VALID [2022-02-20 20:00:18,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} assume 1 == ~p_dw_pc~0; {2682#true} is VALID [2022-02-20 20:00:18,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2682#true} is VALID [2022-02-20 20:00:18,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {2682#true} #res := ~__retres1~0; {2682#true} is VALID [2022-02-20 20:00:18,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,170 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2682#true} {2682#true} #1381#return; {2682#true} is VALID [2022-02-20 20:00:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {2682#true} havoc ~__retres1~1; {2682#true} is VALID [2022-02-20 20:00:18,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} assume 1 == ~c_dr_pc~0; {2682#true} is VALID [2022-02-20 20:00:18,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2682#true} is VALID [2022-02-20 20:00:18,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {2682#true} #res := ~__retres1~1; {2682#true} is VALID [2022-02-20 20:00:18,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,177 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2682#true} {2682#true} #1383#return; {2682#true} is VALID [2022-02-20 20:00:18,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {2726#(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; {2682#true} is VALID [2022-02-20 20:00:18,178 INFO L272 TraceCheckUtils]: 1: Hoare triple {2682#true} call #t~ret8 := is_do_write_p_triggered(); {2682#true} is VALID [2022-02-20 20:00:18,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} havoc ~__retres1~0; {2682#true} is VALID [2022-02-20 20:00:18,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {2682#true} assume 1 == ~p_dw_pc~0; {2682#true} is VALID [2022-02-20 20:00:18,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {2682#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2682#true} is VALID [2022-02-20 20:00:18,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {2682#true} #res := ~__retres1~0; {2682#true} is VALID [2022-02-20 20:00:18,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,179 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2682#true} {2682#true} #1381#return; {2682#true} is VALID [2022-02-20 20:00:18,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {2682#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2682#true} is VALID [2022-02-20 20:00:18,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {2682#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2682#true} is VALID [2022-02-20 20:00:18,179 INFO L272 TraceCheckUtils]: 10: Hoare triple {2682#true} call #t~ret9 := is_do_read_c_triggered(); {2682#true} is VALID [2022-02-20 20:00:18,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {2682#true} havoc ~__retres1~1; {2682#true} is VALID [2022-02-20 20:00:18,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {2682#true} assume 1 == ~c_dr_pc~0; {2682#true} is VALID [2022-02-20 20:00:18,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {2682#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2682#true} is VALID [2022-02-20 20:00:18,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {2682#true} #res := ~__retres1~1; {2682#true} is VALID [2022-02-20 20:00:18,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,181 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2682#true} {2682#true} #1383#return; {2682#true} is VALID [2022-02-20 20:00:18,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {2682#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2682#true} is VALID [2022-02-20 20:00:18,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {2682#true} assume !(0 != ~tmp___0~1); {2682#true} is VALID [2022-02-20 20:00:18,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,182 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2682#true} {2683#false} #1389#return; {2683#false} is VALID [2022-02-20 20:00:18,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2724#(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; {2682#true} is VALID [2022-02-20 20:00:18,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2682#true} is VALID [2022-02-20 20:00:18,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2683#false} #1391#return; {2683#false} is VALID [2022-02-20 20:00:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:18,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {2682#true} havoc ~__retres1~2; {2682#true} is VALID [2022-02-20 20:00:18,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2682#true} is VALID [2022-02-20 20:00:18,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} #res := ~__retres1~2; {2682#true} is VALID [2022-02-20 20:00:18,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,212 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2682#true} {2683#false} #1393#return; {2683#false} is VALID [2022-02-20 20:00:18,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {2682#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {2682#true} is VALID [2022-02-20 20:00:18,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {2682#true} is VALID [2022-02-20 20:00:18,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {2684#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {2684#(= ~q_read_ev~0 2)} call update_channels1(); {2722#(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 20:00:18,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2722#(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); {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:18,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:18,215 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2723#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2684#(= ~q_read_ev~0 2)} #1385#return; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {2684#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2684#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {2684#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {2684#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2684#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:18,219 INFO L272 TraceCheckUtils]: 12: Hoare triple {2684#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2724#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:18,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#(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; {2725#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:18,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {2725#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2725#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:18,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {2725#(= |old(~q_read_ev~0)| 0)} assume true; {2725#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:18,220 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2725#(= |old(~q_read_ev~0)| 0)} {2684#(= ~q_read_ev~0 2)} #1387#return; {2683#false} is VALID [2022-02-20 20:00:18,221 INFO L272 TraceCheckUtils]: 17: Hoare triple {2683#false} call activate_threads1(); {2726#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:18,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {2726#(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; {2682#true} is VALID [2022-02-20 20:00:18,221 INFO L272 TraceCheckUtils]: 19: Hoare triple {2682#true} call #t~ret8 := is_do_write_p_triggered(); {2682#true} is VALID [2022-02-20 20:00:18,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {2682#true} havoc ~__retres1~0; {2682#true} is VALID [2022-02-20 20:00:18,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {2682#true} assume 1 == ~p_dw_pc~0; {2682#true} is VALID [2022-02-20 20:00:18,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {2682#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2682#true} is VALID [2022-02-20 20:00:18,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {2682#true} #res := ~__retres1~0; {2682#true} is VALID [2022-02-20 20:00:18,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,222 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2682#true} {2682#true} #1381#return; {2682#true} is VALID [2022-02-20 20:00:18,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {2682#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2682#true} is VALID [2022-02-20 20:00:18,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2682#true} is VALID [2022-02-20 20:00:18,223 INFO L272 TraceCheckUtils]: 28: Hoare triple {2682#true} call #t~ret9 := is_do_read_c_triggered(); {2682#true} is VALID [2022-02-20 20:00:18,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#true} havoc ~__retres1~1; {2682#true} is VALID [2022-02-20 20:00:18,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {2682#true} assume 1 == ~c_dr_pc~0; {2682#true} is VALID [2022-02-20 20:00:18,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {2682#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2682#true} is VALID [2022-02-20 20:00:18,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {2682#true} #res := ~__retres1~1; {2682#true} is VALID [2022-02-20 20:00:18,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,231 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2682#true} {2682#true} #1383#return; {2682#true} is VALID [2022-02-20 20:00:18,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {2682#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2682#true} is VALID [2022-02-20 20:00:18,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {2682#true} assume !(0 != ~tmp___0~1); {2682#true} is VALID [2022-02-20 20:00:18,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,232 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2682#true} {2683#false} #1389#return; {2683#false} is VALID [2022-02-20 20:00:18,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {2683#false} call reset_delta_events1(); {2724#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:18,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {2724#(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; {2682#true} is VALID [2022-02-20 20:00:18,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {2682#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2682#true} is VALID [2022-02-20 20:00:18,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,233 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2682#true} {2683#false} #1391#return; {2683#false} is VALID [2022-02-20 20:00:18,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2022-02-20 20:00:18,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {2683#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; {2683#false} is VALID [2022-02-20 20:00:18,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2022-02-20 20:00:18,234 INFO L272 TraceCheckUtils]: 47: Hoare triple {2683#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2682#true} is VALID [2022-02-20 20:00:18,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {2682#true} havoc ~__retres1~2; {2682#true} is VALID [2022-02-20 20:00:18,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {2682#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2682#true} is VALID [2022-02-20 20:00:18,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {2682#true} #res := ~__retres1~2; {2682#true} is VALID [2022-02-20 20:00:18,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {2682#true} assume true; {2682#true} is VALID [2022-02-20 20:00:18,236 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2682#true} {2683#false} #1393#return; {2683#false} is VALID [2022-02-20 20:00:18,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {2683#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; {2683#false} is VALID [2022-02-20 20:00:18,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {2683#false} assume 0 != eval1_~tmp___1~0#1; {2683#false} is VALID [2022-02-20 20:00:18,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {2683#false} assume !(0 == ~p_dw_st~0); {2683#false} is VALID [2022-02-20 20:00:18,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {2683#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; {2683#false} is VALID [2022-02-20 20:00:18,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {2683#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; {2683#false} is VALID [2022-02-20 20:00:18,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {2683#false} assume !(0 == ~c_dr_pc~0); {2683#false} is VALID [2022-02-20 20:00:18,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {2683#false} assume 2 == ~c_dr_pc~0; {2683#false} is VALID [2022-02-20 20:00:18,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {2683#false} do_read_c_~a~0#1 := ~a_t~0; {2683#false} is VALID [2022-02-20 20:00:18,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {2683#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; {2683#false} is VALID [2022-02-20 20:00:18,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {2683#false} assume !(~p_last_write~0 == ~c_last_read~0); {2683#false} is VALID [2022-02-20 20:00:18,238 INFO L272 TraceCheckUtils]: 63: Hoare triple {2683#false} call error1(); {2683#false} is VALID [2022-02-20 20:00:18,239 INFO L290 TraceCheckUtils]: 64: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2022-02-20 20:00:18,239 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 20:00:18,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:18,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299813703] [2022-02-20 20:00:18,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299813703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:18,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:18,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:18,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490710081] [2022-02-20 20:00:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:18,244 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 20:00:18,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:18,244 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 20:00:18,294 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 20:00:18,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:18,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:18,296 INFO L87 Difference]: Start difference. First operand 364 states and 547 transitions. 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 20:00:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:21,543 INFO L93 Difference]: Finished difference Result 619 states and 916 transitions. [2022-02-20 20:00:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:21,544 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 20:00:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:21,544 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 20:00:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 916 transitions. [2022-02-20 20:00:21,558 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 20:00:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 916 transitions. [2022-02-20 20:00:21,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 916 transitions. [2022-02-20 20:00:22,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 916 edges. 916 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:22,290 INFO L225 Difference]: With dead ends: 619 [2022-02-20 20:00:22,290 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 20:00:22,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:22,292 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 705 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:22,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 2054 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 20:00:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 476. [2022-02-20 20:00:22,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:22,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 476 states, 402 states have (on average 1.4950248756218905) internal successors, (601), 408 states have internal predecessors, (601), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:22,320 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 476 states, 402 states have (on average 1.4950248756218905) internal successors, (601), 408 states have internal predecessors, (601), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:22,322 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 476 states, 402 states have (on average 1.4950248756218905) internal successors, (601), 408 states have internal predecessors, (601), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,344 INFO L93 Difference]: Finished difference Result 515 states and 760 transitions. [2022-02-20 20:00:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 760 transitions. [2022-02-20 20:00:22,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:22,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:22,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 476 states, 402 states have (on average 1.4950248756218905) internal successors, (601), 408 states have internal predecessors, (601), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 515 states. [2022-02-20 20:00:22,349 INFO L87 Difference]: Start difference. First operand has 476 states, 402 states have (on average 1.4950248756218905) internal successors, (601), 408 states have internal predecessors, (601), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 515 states. [2022-02-20 20:00:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,370 INFO L93 Difference]: Finished difference Result 515 states and 760 transitions. [2022-02-20 20:00:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 760 transitions. [2022-02-20 20:00:22,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:22,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:22,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:22,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 402 states have (on average 1.4950248756218905) internal successors, (601), 408 states have internal predecessors, (601), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 704 transitions. [2022-02-20 20:00:22,394 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 704 transitions. Word has length 65 [2022-02-20 20:00:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:22,394 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 704 transitions. [2022-02-20 20:00:22,395 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 20:00:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 704 transitions. [2022-02-20 20:00:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:22,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:22,396 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 20:00:22,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:22,397 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -42234133, now seen corresponding path program 1 times [2022-02-20 20:00:22,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:22,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226719648] [2022-02-20 20:00:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {5297#(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); {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:22,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:22,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5259#(= ~q_write_ev~0 ~q_read_ev~0)} #1385#return; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {5298#(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); {5299#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:22,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#(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; {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:22,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:22,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5259#(= ~q_write_ev~0 ~q_read_ev~0)} #1387#return; {5258#false} is VALID [2022-02-20 20:00:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {5257#true} havoc ~__retres1~0; {5257#true} is VALID [2022-02-20 20:00:22,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} assume 1 == ~p_dw_pc~0; {5257#true} is VALID [2022-02-20 20:00:22,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5257#true} is VALID [2022-02-20 20:00:22,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {5257#true} #res := ~__retres1~0; {5257#true} is VALID [2022-02-20 20:00:22,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,549 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5257#true} {5257#true} #1381#return; {5257#true} is VALID [2022-02-20 20:00:22,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {5257#true} havoc ~__retres1~1; {5257#true} is VALID [2022-02-20 20:00:22,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} assume 1 == ~c_dr_pc~0; {5257#true} is VALID [2022-02-20 20:00:22,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5257#true} is VALID [2022-02-20 20:00:22,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {5257#true} #res := ~__retres1~1; {5257#true} is VALID [2022-02-20 20:00:22,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,560 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5257#true} {5257#true} #1383#return; {5257#true} is VALID [2022-02-20 20:00:22,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {5301#(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; {5257#true} is VALID [2022-02-20 20:00:22,561 INFO L272 TraceCheckUtils]: 1: Hoare triple {5257#true} call #t~ret8 := is_do_write_p_triggered(); {5257#true} is VALID [2022-02-20 20:00:22,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} havoc ~__retres1~0; {5257#true} is VALID [2022-02-20 20:00:22,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {5257#true} assume 1 == ~p_dw_pc~0; {5257#true} is VALID [2022-02-20 20:00:22,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {5257#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5257#true} is VALID [2022-02-20 20:00:22,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {5257#true} #res := ~__retres1~0; {5257#true} is VALID [2022-02-20 20:00:22,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,563 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5257#true} {5257#true} #1381#return; {5257#true} is VALID [2022-02-20 20:00:22,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {5257#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5257#true} is VALID [2022-02-20 20:00:22,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {5257#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5257#true} is VALID [2022-02-20 20:00:22,565 INFO L272 TraceCheckUtils]: 10: Hoare triple {5257#true} call #t~ret9 := is_do_read_c_triggered(); {5257#true} is VALID [2022-02-20 20:00:22,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {5257#true} havoc ~__retres1~1; {5257#true} is VALID [2022-02-20 20:00:22,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {5257#true} assume 1 == ~c_dr_pc~0; {5257#true} is VALID [2022-02-20 20:00:22,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5257#true} is VALID [2022-02-20 20:00:22,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {5257#true} #res := ~__retres1~1; {5257#true} is VALID [2022-02-20 20:00:22,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,567 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5257#true} {5257#true} #1383#return; {5257#true} is VALID [2022-02-20 20:00:22,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {5257#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5257#true} is VALID [2022-02-20 20:00:22,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {5257#true} assume !(0 != ~tmp___0~1); {5257#true} is VALID [2022-02-20 20:00:22,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,568 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5257#true} {5258#false} #1389#return; {5258#false} is VALID [2022-02-20 20:00:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {5298#(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); {5257#true} is VALID [2022-02-20 20:00:22,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5257#true} is VALID [2022-02-20 20:00:22,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5257#true} {5258#false} #1391#return; {5258#false} is VALID [2022-02-20 20:00:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:22,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {5257#true} havoc ~__retres1~2; {5257#true} is VALID [2022-02-20 20:00:22,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5257#true} is VALID [2022-02-20 20:00:22,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} #res := ~__retres1~2; {5257#true} is VALID [2022-02-20 20:00:22,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,578 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5257#true} {5258#false} #1393#return; {5258#false} is VALID [2022-02-20 20:00:22,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {5257#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {5257#true} is VALID [2022-02-20 20:00:22,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {5257#true} is VALID [2022-02-20 20:00:22,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {5259#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {5259#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5297#(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 20:00:22,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {5297#(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); {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:22,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:22,582 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5259#(= ~q_write_ev~0 ~q_read_ev~0)} #1385#return; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {5259#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {5259#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {5259#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {5259#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {5259#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:22,584 INFO L272 TraceCheckUtils]: 12: Hoare triple {5259#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:22,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {5298#(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); {5299#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:22,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {5299#(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; {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:22,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:22,586 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5300#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5259#(= ~q_write_ev~0 ~q_read_ev~0)} #1387#return; {5258#false} is VALID [2022-02-20 20:00:22,586 INFO L272 TraceCheckUtils]: 17: Hoare triple {5258#false} call activate_threads1(); {5301#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:22,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {5301#(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; {5257#true} is VALID [2022-02-20 20:00:22,587 INFO L272 TraceCheckUtils]: 19: Hoare triple {5257#true} call #t~ret8 := is_do_write_p_triggered(); {5257#true} is VALID [2022-02-20 20:00:22,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {5257#true} havoc ~__retres1~0; {5257#true} is VALID [2022-02-20 20:00:22,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {5257#true} assume 1 == ~p_dw_pc~0; {5257#true} is VALID [2022-02-20 20:00:22,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {5257#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5257#true} is VALID [2022-02-20 20:00:22,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {5257#true} #res := ~__retres1~0; {5257#true} is VALID [2022-02-20 20:00:22,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,588 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5257#true} {5257#true} #1381#return; {5257#true} is VALID [2022-02-20 20:00:22,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {5257#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5257#true} is VALID [2022-02-20 20:00:22,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {5257#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5257#true} is VALID [2022-02-20 20:00:22,589 INFO L272 TraceCheckUtils]: 28: Hoare triple {5257#true} call #t~ret9 := is_do_read_c_triggered(); {5257#true} is VALID [2022-02-20 20:00:22,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {5257#true} havoc ~__retres1~1; {5257#true} is VALID [2022-02-20 20:00:22,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {5257#true} assume 1 == ~c_dr_pc~0; {5257#true} is VALID [2022-02-20 20:00:22,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {5257#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5257#true} is VALID [2022-02-20 20:00:22,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {5257#true} #res := ~__retres1~1; {5257#true} is VALID [2022-02-20 20:00:22,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,590 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5257#true} {5257#true} #1383#return; {5257#true} is VALID [2022-02-20 20:00:22,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {5257#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5257#true} is VALID [2022-02-20 20:00:22,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {5257#true} assume !(0 != ~tmp___0~1); {5257#true} is VALID [2022-02-20 20:00:22,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,591 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5257#true} {5258#false} #1389#return; {5258#false} is VALID [2022-02-20 20:00:22,591 INFO L272 TraceCheckUtils]: 39: Hoare triple {5258#false} call reset_delta_events1(); {5298#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:22,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {5298#(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); {5257#true} is VALID [2022-02-20 20:00:22,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {5257#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5257#true} is VALID [2022-02-20 20:00:22,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,592 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5257#true} {5258#false} #1391#return; {5258#false} is VALID [2022-02-20 20:00:22,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {5258#false} assume !false; {5258#false} is VALID [2022-02-20 20:00:22,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 20:00:22,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {5258#false} assume !false; {5258#false} is VALID [2022-02-20 20:00:22,593 INFO L272 TraceCheckUtils]: 47: Hoare triple {5258#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5257#true} is VALID [2022-02-20 20:00:22,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {5257#true} havoc ~__retres1~2; {5257#true} is VALID [2022-02-20 20:00:22,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {5257#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5257#true} is VALID [2022-02-20 20:00:22,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {5257#true} #res := ~__retres1~2; {5257#true} is VALID [2022-02-20 20:00:22,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {5257#true} assume true; {5257#true} is VALID [2022-02-20 20:00:22,593 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5257#true} {5258#false} #1393#return; {5258#false} is VALID [2022-02-20 20:00:22,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 20:00:22,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {5258#false} assume 0 != eval1_~tmp___1~0#1; {5258#false} is VALID [2022-02-20 20:00:22,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {5258#false} assume !(0 == ~p_dw_st~0); {5258#false} is VALID [2022-02-20 20:00:22,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 20:00:22,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 20:00:22,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {5258#false} assume !(0 == ~c_dr_pc~0); {5258#false} is VALID [2022-02-20 20:00:22,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {5258#false} assume 2 == ~c_dr_pc~0; {5258#false} is VALID [2022-02-20 20:00:22,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {5258#false} do_read_c_~a~0#1 := ~a_t~0; {5258#false} is VALID [2022-02-20 20:00:22,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 20:00:22,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {5258#false} assume !(~p_last_write~0 == ~c_last_read~0); {5258#false} is VALID [2022-02-20 20:00:22,595 INFO L272 TraceCheckUtils]: 63: Hoare triple {5258#false} call error1(); {5258#false} is VALID [2022-02-20 20:00:22,596 INFO L290 TraceCheckUtils]: 64: Hoare triple {5258#false} assume !false; {5258#false} is VALID [2022-02-20 20:00:22,598 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 20:00:22,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:22,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226719648] [2022-02-20 20:00:22,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226719648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:22,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:22,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:22,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686819107] [2022-02-20 20:00:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:22,600 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 20:00:22,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:22,602 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 20:00:22,642 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 20:00:22,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:22,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:22,644 INFO L87 Difference]: Start difference. First operand 476 states and 704 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 20:00:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:26,119 INFO L93 Difference]: Finished difference Result 873 states and 1269 transitions. [2022-02-20 20:00:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:26,120 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 20:00:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:26,120 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 20:00:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 946 transitions. [2022-02-20 20:00:26,139 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 20:00:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 946 transitions. [2022-02-20 20:00:26,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 946 transitions. [2022-02-20 20:00:26,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 946 edges. 946 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:26,987 INFO L225 Difference]: With dead ends: 873 [2022-02-20 20:00:26,988 INFO L226 Difference]: Without dead ends: 664 [2022-02-20 20:00:26,992 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 20:00:26,997 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 1329 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:26,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1358 Valid, 1911 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-02-20 20:00:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 588. [2022-02-20 20:00:27,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:27,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 664 states. Second operand has 588 states, 492 states have (on average 1.475609756097561) internal successors, (726), 500 states have internal predecessors, (726), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:27,058 INFO L74 IsIncluded]: Start isIncluded. First operand 664 states. Second operand has 588 states, 492 states have (on average 1.475609756097561) internal successors, (726), 500 states have internal predecessors, (726), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:27,059 INFO L87 Difference]: Start difference. First operand 664 states. Second operand has 588 states, 492 states have (on average 1.475609756097561) internal successors, (726), 500 states have internal predecessors, (726), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,087 INFO L93 Difference]: Finished difference Result 664 states and 977 transitions. [2022-02-20 20:00:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 977 transitions. [2022-02-20 20:00:27,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:27,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:27,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 588 states, 492 states have (on average 1.475609756097561) internal successors, (726), 500 states have internal predecessors, (726), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) Second operand 664 states. [2022-02-20 20:00:27,093 INFO L87 Difference]: Start difference. First operand has 588 states, 492 states have (on average 1.475609756097561) internal successors, (726), 500 states have internal predecessors, (726), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) Second operand 664 states. [2022-02-20 20:00:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,120 INFO L93 Difference]: Finished difference Result 664 states and 977 transitions. [2022-02-20 20:00:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 977 transitions. [2022-02-20 20:00:27,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:27,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:27,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:27,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 492 states have (on average 1.475609756097561) internal successors, (726), 500 states have internal predecessors, (726), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 863 transitions. [2022-02-20 20:00:27,149 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 863 transitions. Word has length 65 [2022-02-20 20:00:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:27,149 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 863 transitions. [2022-02-20 20:00:27,150 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 20:00:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 863 transitions. [2022-02-20 20:00:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:27,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:27,153 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 20:00:27,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:27,153 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2070820243, now seen corresponding path program 1 times [2022-02-20 20:00:27,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:27,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984628318] [2022-02-20 20:00:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {8666#(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); {8667#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:27,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {8667#(not (= |old(~q_req_up~0)| 1))} assume true; {8667#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:27,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8667#(not (= |old(~q_req_up~0)| 1))} {8627#(= ~q_req_up~0 ~p_dw_pc~0)} #1385#return; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {8668#(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); {8624#true} is VALID [2022-02-20 20:00:27,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {8624#true} assume !(0 == ~q_write_ev~0); {8624#true} is VALID [2022-02-20 20:00:27,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8624#true} {8631#(not (= ~p_dw_pc~0 1))} #1387#return; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {8624#true} havoc ~__retres1~0; {8624#true} is VALID [2022-02-20 20:00:27,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {8624#true} assume 1 == ~p_dw_pc~0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,284 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} {8624#true} #1381#return; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {8624#true} havoc ~__retres1~1; {8624#true} is VALID [2022-02-20 20:00:27,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {8624#true} assume 1 == ~c_dr_pc~0; {8624#true} is VALID [2022-02-20 20:00:27,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {8624#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8624#true} is VALID [2022-02-20 20:00:27,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {8624#true} #res := ~__retres1~1; {8624#true} is VALID [2022-02-20 20:00:27,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,291 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8624#true} {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} #1383#return; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {8669#(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; {8624#true} is VALID [2022-02-20 20:00:27,291 INFO L272 TraceCheckUtils]: 1: Hoare triple {8624#true} call #t~ret8 := is_do_write_p_triggered(); {8624#true} is VALID [2022-02-20 20:00:27,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {8624#true} havoc ~__retres1~0; {8624#true} is VALID [2022-02-20 20:00:27,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {8624#true} assume 1 == ~p_dw_pc~0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,295 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} {8624#true} #1381#return; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,298 INFO L272 TraceCheckUtils]: 10: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {8624#true} is VALID [2022-02-20 20:00:27,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {8624#true} havoc ~__retres1~1; {8624#true} is VALID [2022-02-20 20:00:27,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {8624#true} assume 1 == ~c_dr_pc~0; {8624#true} is VALID [2022-02-20 20:00:27,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {8624#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8624#true} is VALID [2022-02-20 20:00:27,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {8624#true} #res := ~__retres1~1; {8624#true} is VALID [2022-02-20 20:00:27,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,300 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8624#true} {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} #1383#return; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume !(0 != ~tmp___0~1); {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,302 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} {8631#(not (= ~p_dw_pc~0 1))} #1389#return; {8625#false} is VALID [2022-02-20 20:00:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {8668#(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); {8624#true} is VALID [2022-02-20 20:00:27,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {8624#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8624#true} is VALID [2022-02-20 20:00:27,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8624#true} {8625#false} #1391#return; {8625#false} is VALID [2022-02-20 20:00:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {8624#true} havoc ~__retres1~2; {8624#true} is VALID [2022-02-20 20:00:27,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {8624#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8624#true} is VALID [2022-02-20 20:00:27,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {8624#true} #res := ~__retres1~2; {8624#true} is VALID [2022-02-20 20:00:27,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,315 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8624#true} {8625#false} #1393#return; {8625#false} is VALID [2022-02-20 20:00:27,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {8624#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {8626#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:27,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {8626#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {8626#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:27,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {8626#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {8627#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:27,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {8627#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {8627#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:27,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {8627#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {8666#(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 20:00:27,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {8666#(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); {8667#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:27,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {8667#(not (= |old(~q_req_up~0)| 1))} assume true; {8667#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:27,319 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8667#(not (= |old(~q_req_up~0)| 1))} {8627#(= ~q_req_up~0 ~p_dw_pc~0)} #1385#return; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {8631#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {8631#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {8631#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {8631#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {8631#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {8668#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:27,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {8668#(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); {8624#true} is VALID [2022-02-20 20:00:27,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {8624#true} assume !(0 == ~q_write_ev~0); {8624#true} is VALID [2022-02-20 20:00:27,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,322 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8624#true} {8631#(not (= ~p_dw_pc~0 1))} #1387#return; {8631#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:27,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {8631#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {8669#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:27,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {8669#(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; {8624#true} is VALID [2022-02-20 20:00:27,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {8624#true} call #t~ret8 := is_do_write_p_triggered(); {8624#true} is VALID [2022-02-20 20:00:27,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {8624#true} havoc ~__retres1~0; {8624#true} is VALID [2022-02-20 20:00:27,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {8624#true} assume 1 == ~p_dw_pc~0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,324 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} {8624#true} #1381#return; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,325 INFO L272 TraceCheckUtils]: 28: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {8624#true} is VALID [2022-02-20 20:00:27,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {8624#true} havoc ~__retres1~1; {8624#true} is VALID [2022-02-20 20:00:27,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {8624#true} assume 1 == ~c_dr_pc~0; {8624#true} is VALID [2022-02-20 20:00:27,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {8624#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8624#true} is VALID [2022-02-20 20:00:27,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {8624#true} #res := ~__retres1~1; {8624#true} is VALID [2022-02-20 20:00:27,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,327 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8624#true} {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} #1383#return; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume !(0 != ~tmp___0~1); {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:27,328 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8676#(= (+ (- 1) ~p_dw_pc~0) 0)} {8631#(not (= ~p_dw_pc~0 1))} #1389#return; {8625#false} is VALID [2022-02-20 20:00:27,328 INFO L272 TraceCheckUtils]: 39: Hoare triple {8625#false} call reset_delta_events1(); {8668#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:27,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {8668#(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); {8624#true} is VALID [2022-02-20 20:00:27,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {8624#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8624#true} is VALID [2022-02-20 20:00:27,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,329 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8624#true} {8625#false} #1391#return; {8625#false} is VALID [2022-02-20 20:00:27,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {8625#false} assume !false; {8625#false} is VALID [2022-02-20 20:00:27,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {8625#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; {8625#false} is VALID [2022-02-20 20:00:27,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {8625#false} assume !false; {8625#false} is VALID [2022-02-20 20:00:27,330 INFO L272 TraceCheckUtils]: 47: Hoare triple {8625#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8624#true} is VALID [2022-02-20 20:00:27,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {8624#true} havoc ~__retres1~2; {8624#true} is VALID [2022-02-20 20:00:27,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {8624#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8624#true} is VALID [2022-02-20 20:00:27,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {8624#true} #res := ~__retres1~2; {8624#true} is VALID [2022-02-20 20:00:27,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {8624#true} assume true; {8624#true} is VALID [2022-02-20 20:00:27,330 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8624#true} {8625#false} #1393#return; {8625#false} is VALID [2022-02-20 20:00:27,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {8625#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; {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {8625#false} assume 0 != eval1_~tmp___1~0#1; {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {8625#false} assume !(0 == ~p_dw_st~0); {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {8625#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; {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {8625#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; {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {8625#false} assume !(0 == ~c_dr_pc~0); {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 59: Hoare triple {8625#false} assume 2 == ~c_dr_pc~0; {8625#false} is VALID [2022-02-20 20:00:27,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {8625#false} do_read_c_~a~0#1 := ~a_t~0; {8625#false} is VALID [2022-02-20 20:00:27,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {8625#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; {8625#false} is VALID [2022-02-20 20:00:27,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {8625#false} assume !(~p_last_write~0 == ~c_last_read~0); {8625#false} is VALID [2022-02-20 20:00:27,332 INFO L272 TraceCheckUtils]: 63: Hoare triple {8625#false} call error1(); {8625#false} is VALID [2022-02-20 20:00:27,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {8625#false} assume !false; {8625#false} is VALID [2022-02-20 20:00:27,333 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 20:00:27,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:27,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984628318] [2022-02-20 20:00:27,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984628318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:27,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:27,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:27,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133576500] [2022-02-20 20:00:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:27,336 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:27,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:27,336 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:27,383 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 20:00:27,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:27,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:27,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:27,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:27,385 INFO L87 Difference]: Start difference. First operand 588 states and 863 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,569 INFO L93 Difference]: Finished difference Result 2134 states and 3060 transitions. [2022-02-20 20:00:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:33,570 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:33,572 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1351 transitions. [2022-02-20 20:00:33,585 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1351 transitions. [2022-02-20 20:00:33,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1351 transitions. [2022-02-20 20:00:34,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1351 edges. 1351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:34,810 INFO L225 Difference]: With dead ends: 2134 [2022-02-20 20:00:34,810 INFO L226 Difference]: Without dead ends: 1801 [2022-02-20 20:00:34,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:34,813 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 2991 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:34,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3010 Valid, 2556 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 20:00:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2022-02-20 20:00:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1641. [2022-02-20 20:00:34,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:34,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1801 states. Second operand has 1641 states, 1340 states have (on average 1.3970149253731343) internal successors, (1872), 1363 states have internal predecessors, (1872), 173 states have call successors, (173), 111 states have call predecessors, (173), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:34,904 INFO L74 IsIncluded]: Start isIncluded. First operand 1801 states. Second operand has 1641 states, 1340 states have (on average 1.3970149253731343) internal successors, (1872), 1363 states have internal predecessors, (1872), 173 states have call successors, (173), 111 states have call predecessors, (173), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:34,909 INFO L87 Difference]: Start difference. First operand 1801 states. Second operand has 1641 states, 1340 states have (on average 1.3970149253731343) internal successors, (1872), 1363 states have internal predecessors, (1872), 173 states have call successors, (173), 111 states have call predecessors, (173), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,064 INFO L93 Difference]: Finished difference Result 1801 states and 2464 transitions. [2022-02-20 20:00:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2464 transitions. [2022-02-20 20:00:35,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:35,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:35,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 1641 states, 1340 states have (on average 1.3970149253731343) internal successors, (1872), 1363 states have internal predecessors, (1872), 173 states have call successors, (173), 111 states have call predecessors, (173), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) Second operand 1801 states. [2022-02-20 20:00:35,079 INFO L87 Difference]: Start difference. First operand has 1641 states, 1340 states have (on average 1.3970149253731343) internal successors, (1872), 1363 states have internal predecessors, (1872), 173 states have call successors, (173), 111 states have call predecessors, (173), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) Second operand 1801 states. [2022-02-20 20:00:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,241 INFO L93 Difference]: Finished difference Result 1801 states and 2464 transitions. [2022-02-20 20:00:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2464 transitions. [2022-02-20 20:00:35,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:35,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:35,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:35,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1340 states have (on average 1.3970149253731343) internal successors, (1872), 1363 states have internal predecessors, (1872), 173 states have call successors, (173), 111 states have call predecessors, (173), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2252 transitions. [2022-02-20 20:00:35,427 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2252 transitions. Word has length 65 [2022-02-20 20:00:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:35,427 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2252 transitions. [2022-02-20 20:00:35,428 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2252 transitions. [2022-02-20 20:00:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:35,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:35,432 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 20:00:35,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:35,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash 160145276, now seen corresponding path program 1 times [2022-02-20 20:00:35,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:35,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766084801] [2022-02-20 20:00:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {17474#(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); {17434#true} is VALID [2022-02-20 20:00:35,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17434#true} {17434#true} #1385#return; {17434#true} is VALID [2022-02-20 20:00:35,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {17475#(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); {17434#true} is VALID [2022-02-20 20:00:35,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~q_write_ev~0); {17434#true} is VALID [2022-02-20 20:00:35,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17434#true} #1387#return; {17434#true} is VALID [2022-02-20 20:00:35,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {17434#true} havoc ~__retres1~0; {17434#true} is VALID [2022-02-20 20:00:35,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(1 == ~p_dw_pc~0); {17434#true} is VALID [2022-02-20 20:00:35,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} assume !(2 == ~p_dw_pc~0); {17434#true} is VALID [2022-02-20 20:00:35,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {17434#true} ~__retres1~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {17434#true} #res := ~__retres1~0; {17434#true} is VALID [2022-02-20 20:00:35,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,521 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17434#true} {17434#true} #1381#return; {17434#true} is VALID [2022-02-20 20:00:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {17434#true} havoc ~__retres1~1; {17434#true} is VALID [2022-02-20 20:00:35,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume 1 == ~c_dr_pc~0; {17434#true} is VALID [2022-02-20 20:00:35,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17492#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 20:00:35,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {17492#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {17493#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:35,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {17493#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {17493#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:35,545 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17493#(<= 1 |is_do_read_c_triggered_#res|)} {17434#true} #1383#return; {17490#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:35,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {17476#(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; {17434#true} is VALID [2022-02-20 20:00:35,546 INFO L272 TraceCheckUtils]: 1: Hoare triple {17434#true} call #t~ret8 := is_do_write_p_triggered(); {17434#true} is VALID [2022-02-20 20:00:35,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} havoc ~__retres1~0; {17434#true} is VALID [2022-02-20 20:00:35,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {17434#true} assume !(1 == ~p_dw_pc~0); {17434#true} is VALID [2022-02-20 20:00:35,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {17434#true} assume !(2 == ~p_dw_pc~0); {17434#true} is VALID [2022-02-20 20:00:35,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {17434#true} ~__retres1~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {17434#true} #res := ~__retres1~0; {17434#true} is VALID [2022-02-20 20:00:35,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,547 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {17434#true} {17434#true} #1381#return; {17434#true} is VALID [2022-02-20 20:00:35,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {17434#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17434#true} is VALID [2022-02-20 20:00:35,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {17434#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {17434#true} call #t~ret9 := is_do_read_c_triggered(); {17434#true} is VALID [2022-02-20 20:00:35,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {17434#true} havoc ~__retres1~1; {17434#true} is VALID [2022-02-20 20:00:35,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {17434#true} assume 1 == ~c_dr_pc~0; {17434#true} is VALID [2022-02-20 20:00:35,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {17434#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17492#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 20:00:35,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {17492#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {17493#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:35,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {17493#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {17493#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:35,549 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17493#(<= 1 |is_do_read_c_triggered_#res|)} {17434#true} #1383#return; {17490#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:35,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {17490#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17491#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 20:00:35,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {17491#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {17435#false} is VALID [2022-02-20 20:00:35,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {17435#false} assume true; {17435#false} is VALID [2022-02-20 20:00:35,551 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17435#false} {17434#true} #1389#return; {17435#false} is VALID [2022-02-20 20:00:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {17475#(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); {17434#true} is VALID [2022-02-20 20:00:35,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17434#true} is VALID [2022-02-20 20:00:35,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17435#false} #1391#return; {17435#false} is VALID [2022-02-20 20:00:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {17434#true} havoc ~__retres1~2; {17434#true} is VALID [2022-02-20 20:00:35,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17434#true} is VALID [2022-02-20 20:00:35,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} #res := ~__retres1~2; {17434#true} is VALID [2022-02-20 20:00:35,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,559 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17434#true} {17435#false} #1393#return; {17435#false} is VALID [2022-02-20 20:00:35,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {17434#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {17434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {17434#true} is VALID [2022-02-20 20:00:35,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {17434#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {17434#true} is VALID [2022-02-20 20:00:35,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {17434#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {17434#true} is VALID [2022-02-20 20:00:35,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {17434#true} call update_channels1(); {17474#(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 20:00:35,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {17474#(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); {17434#true} is VALID [2022-02-20 20:00:35,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,561 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17434#true} {17434#true} #1385#return; {17434#true} is VALID [2022-02-20 20:00:35,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {17434#true} assume { :begin_inline_init_threads1 } true; {17434#true} is VALID [2022-02-20 20:00:35,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {17434#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {17434#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {17434#true} assume { :end_inline_init_threads1 } true; {17434#true} is VALID [2022-02-20 20:00:35,562 INFO L272 TraceCheckUtils]: 12: Hoare triple {17434#true} call fire_delta_events1(); {17475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:35,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {17475#(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); {17434#true} is VALID [2022-02-20 20:00:35,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {17434#true} assume !(0 == ~q_write_ev~0); {17434#true} is VALID [2022-02-20 20:00:35,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,562 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17434#true} {17434#true} #1387#return; {17434#true} is VALID [2022-02-20 20:00:35,563 INFO L272 TraceCheckUtils]: 17: Hoare triple {17434#true} call activate_threads1(); {17476#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:35,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {17476#(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; {17434#true} is VALID [2022-02-20 20:00:35,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {17434#true} call #t~ret8 := is_do_write_p_triggered(); {17434#true} is VALID [2022-02-20 20:00:35,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {17434#true} havoc ~__retres1~0; {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {17434#true} assume !(1 == ~p_dw_pc~0); {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {17434#true} assume !(2 == ~p_dw_pc~0); {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {17434#true} ~__retres1~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {17434#true} #res := ~__retres1~0; {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17434#true} {17434#true} #1381#return; {17434#true} is VALID [2022-02-20 20:00:35,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {17434#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17434#true} is VALID [2022-02-20 20:00:35,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {17434#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17434#true} is VALID [2022-02-20 20:00:35,565 INFO L272 TraceCheckUtils]: 29: Hoare triple {17434#true} call #t~ret9 := is_do_read_c_triggered(); {17434#true} is VALID [2022-02-20 20:00:35,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {17434#true} havoc ~__retres1~1; {17434#true} is VALID [2022-02-20 20:00:35,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {17434#true} assume 1 == ~c_dr_pc~0; {17434#true} is VALID [2022-02-20 20:00:35,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {17434#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17492#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 20:00:35,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {17492#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {17493#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:35,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {17493#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {17493#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:35,567 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17493#(<= 1 |is_do_read_c_triggered_#res|)} {17434#true} #1383#return; {17490#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:35,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {17490#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17491#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 20:00:35,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {17491#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {17435#false} is VALID [2022-02-20 20:00:35,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {17435#false} assume true; {17435#false} is VALID [2022-02-20 20:00:35,568 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17435#false} {17434#true} #1389#return; {17435#false} is VALID [2022-02-20 20:00:35,568 INFO L272 TraceCheckUtils]: 40: Hoare triple {17435#false} call reset_delta_events1(); {17475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:35,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {17475#(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); {17434#true} is VALID [2022-02-20 20:00:35,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {17434#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17434#true} is VALID [2022-02-20 20:00:35,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,569 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17434#true} {17435#false} #1391#return; {17435#false} is VALID [2022-02-20 20:00:35,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {17435#false} assume !false; {17435#false} is VALID [2022-02-20 20:00:35,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {17435#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; {17435#false} is VALID [2022-02-20 20:00:35,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {17435#false} assume !false; {17435#false} is VALID [2022-02-20 20:00:35,569 INFO L272 TraceCheckUtils]: 48: Hoare triple {17435#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17434#true} is VALID [2022-02-20 20:00:35,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {17434#true} havoc ~__retres1~2; {17434#true} is VALID [2022-02-20 20:00:35,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {17434#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17434#true} is VALID [2022-02-20 20:00:35,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {17434#true} #res := ~__retres1~2; {17434#true} is VALID [2022-02-20 20:00:35,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {17434#true} assume true; {17434#true} is VALID [2022-02-20 20:00:35,570 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17434#true} {17435#false} #1393#return; {17435#false} is VALID [2022-02-20 20:00:35,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {17435#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; {17435#false} is VALID [2022-02-20 20:00:35,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {17435#false} assume 0 != eval1_~tmp___1~0#1; {17435#false} is VALID [2022-02-20 20:00:35,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {17435#false} assume !(0 == ~p_dw_st~0); {17435#false} is VALID [2022-02-20 20:00:35,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {17435#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; {17435#false} is VALID [2022-02-20 20:00:35,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {17435#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; {17435#false} is VALID [2022-02-20 20:00:35,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {17435#false} assume !(0 == ~c_dr_pc~0); {17435#false} is VALID [2022-02-20 20:00:35,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {17435#false} assume 2 == ~c_dr_pc~0; {17435#false} is VALID [2022-02-20 20:00:35,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {17435#false} do_read_c_~a~0#1 := ~a_t~0; {17435#false} is VALID [2022-02-20 20:00:35,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {17435#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; {17435#false} is VALID [2022-02-20 20:00:35,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {17435#false} assume !(~p_last_write~0 == ~c_last_read~0); {17435#false} is VALID [2022-02-20 20:00:35,572 INFO L272 TraceCheckUtils]: 64: Hoare triple {17435#false} call error1(); {17435#false} is VALID [2022-02-20 20:00:35,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {17435#false} assume !false; {17435#false} is VALID [2022-02-20 20:00:35,572 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 20:00:35,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:35,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766084801] [2022-02-20 20:00:35,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766084801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:35,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:35,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:35,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901215433] [2022-02-20 20:00:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-02-20 20:00:35,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:35,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:35,615 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 20:00:35,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:35,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:35,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:35,616 INFO L87 Difference]: Start difference. First operand 1641 states and 2252 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,160 INFO L93 Difference]: Finished difference Result 3257 states and 4472 transitions. [2022-02-20 20:00:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-02-20 20:00:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 733 transitions. [2022-02-20 20:00:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 733 transitions. [2022-02-20 20:00:39,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 733 transitions. [2022-02-20 20:00:39,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:39,977 INFO L225 Difference]: With dead ends: 3257 [2022-02-20 20:00:39,977 INFO L226 Difference]: Without dead ends: 1877 [2022-02-20 20:00:39,982 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 20:00:39,983 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 690 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:39,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 2144 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2022-02-20 20:00:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1711. [2022-02-20 20:00:40,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:40,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1877 states. Second operand has 1711 states, 1396 states have (on average 1.3810888252148996) internal successors, (1928), 1419 states have internal predecessors, (1928), 173 states have call successors, (173), 111 states have call predecessors, (173), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:40,081 INFO L74 IsIncluded]: Start isIncluded. First operand 1877 states. Second operand has 1711 states, 1396 states have (on average 1.3810888252148996) internal successors, (1928), 1419 states have internal predecessors, (1928), 173 states have call successors, (173), 111 states have call predecessors, (173), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:40,089 INFO L87 Difference]: Start difference. First operand 1877 states. Second operand has 1711 states, 1396 states have (on average 1.3810888252148996) internal successors, (1928), 1419 states have internal predecessors, (1928), 173 states have call successors, (173), 111 states have call predecessors, (173), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,265 INFO L93 Difference]: Finished difference Result 1877 states and 2567 transitions. [2022-02-20 20:00:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2567 transitions. [2022-02-20 20:00:40,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:40,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:40,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 1711 states, 1396 states have (on average 1.3810888252148996) internal successors, (1928), 1419 states have internal predecessors, (1928), 173 states have call successors, (173), 111 states have call predecessors, (173), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) Second operand 1877 states. [2022-02-20 20:00:40,286 INFO L87 Difference]: Start difference. First operand has 1711 states, 1396 states have (on average 1.3810888252148996) internal successors, (1928), 1419 states have internal predecessors, (1928), 173 states have call successors, (173), 111 states have call predecessors, (173), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) Second operand 1877 states. [2022-02-20 20:00:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,484 INFO L93 Difference]: Finished difference Result 1877 states and 2567 transitions. [2022-02-20 20:00:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2567 transitions. [2022-02-20 20:00:40,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:40,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:40,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:40,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1396 states have (on average 1.3810888252148996) internal successors, (1928), 1419 states have internal predecessors, (1928), 173 states have call successors, (173), 111 states have call predecessors, (173), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2322 transitions. [2022-02-20 20:00:40,656 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2322 transitions. Word has length 66 [2022-02-20 20:00:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:40,657 INFO L470 AbstractCegarLoop]: Abstraction has 1711 states and 2322 transitions. [2022-02-20 20:00:40,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2322 transitions. [2022-02-20 20:00:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:40,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:40,658 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 20:00:40,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:40,659 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1226058118, now seen corresponding path program 1 times [2022-02-20 20:00:40,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:40,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036835446] [2022-02-20 20:00:40,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {27949#(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); {27909#true} is VALID [2022-02-20 20:00:40,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27909#true} {27909#true} #1385#return; {27909#true} is VALID [2022-02-20 20:00:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {27950#(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); {27909#true} is VALID [2022-02-20 20:00:40,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume !(0 == ~q_write_ev~0); {27909#true} is VALID [2022-02-20 20:00:40,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #1387#return; {27909#true} is VALID [2022-02-20 20:00:40,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {27909#true} havoc ~__retres1~0; {27909#true} is VALID [2022-02-20 20:00:40,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume !(1 == ~p_dw_pc~0); {27909#true} is VALID [2022-02-20 20:00:40,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume !(2 == ~p_dw_pc~0); {27909#true} is VALID [2022-02-20 20:00:40,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {27909#true} ~__retres1~0 := 0; {27967#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:40,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {27967#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:40,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:40,777 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {27909#true} #1381#return; {27959#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {27909#true} havoc ~__retres1~1; {27909#true} is VALID [2022-02-20 20:00:40,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume 1 == ~c_dr_pc~0; {27909#true} is VALID [2022-02-20 20:00:40,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27909#true} is VALID [2022-02-20 20:00:40,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {27909#true} #res := ~__retres1~1; {27909#true} is VALID [2022-02-20 20:00:40,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,782 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {27909#true} {27910#false} #1383#return; {27910#false} is VALID [2022-02-20 20:00:40,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {27951#(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; {27909#true} is VALID [2022-02-20 20:00:40,782 INFO L272 TraceCheckUtils]: 1: Hoare triple {27909#true} call #t~ret8 := is_do_write_p_triggered(); {27909#true} is VALID [2022-02-20 20:00:40,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} havoc ~__retres1~0; {27909#true} is VALID [2022-02-20 20:00:40,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {27909#true} assume !(1 == ~p_dw_pc~0); {27909#true} is VALID [2022-02-20 20:00:40,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {27909#true} assume !(2 == ~p_dw_pc~0); {27909#true} is VALID [2022-02-20 20:00:40,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~__retres1~0 := 0; {27967#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:40,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {27967#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:40,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:40,784 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {27909#true} #1381#return; {27959#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:40,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {27959#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27960#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:40,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {27960#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {27910#false} is VALID [2022-02-20 20:00:40,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {27910#false} call #t~ret9 := is_do_read_c_triggered(); {27909#true} is VALID [2022-02-20 20:00:40,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {27909#true} havoc ~__retres1~1; {27909#true} is VALID [2022-02-20 20:00:40,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {27909#true} assume 1 == ~c_dr_pc~0; {27909#true} is VALID [2022-02-20 20:00:40,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {27909#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27909#true} is VALID [2022-02-20 20:00:40,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {27909#true} #res := ~__retres1~1; {27909#true} is VALID [2022-02-20 20:00:40,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,787 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27909#true} {27910#false} #1383#return; {27910#false} is VALID [2022-02-20 20:00:40,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {27910#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27910#false} is VALID [2022-02-20 20:00:40,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {27910#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27910#false} is VALID [2022-02-20 20:00:40,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {27910#false} assume true; {27910#false} is VALID [2022-02-20 20:00:40,787 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27910#false} {27909#true} #1389#return; {27910#false} is VALID [2022-02-20 20:00:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {27950#(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); {27909#true} is VALID [2022-02-20 20:00:40,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27909#true} is VALID [2022-02-20 20:00:40,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27910#false} #1391#return; {27910#false} is VALID [2022-02-20 20:00:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {27909#true} havoc ~__retres1~2; {27909#true} is VALID [2022-02-20 20:00:40,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27909#true} is VALID [2022-02-20 20:00:40,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} #res := ~__retres1~2; {27909#true} is VALID [2022-02-20 20:00:40,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,802 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27909#true} {27910#false} #1393#return; {27910#false} is VALID [2022-02-20 20:00:40,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {27909#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {27909#true} is VALID [2022-02-20 20:00:40,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {27909#true} is VALID [2022-02-20 20:00:40,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {27909#true} is VALID [2022-02-20 20:00:40,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {27909#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {27909#true} is VALID [2022-02-20 20:00:40,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call update_channels1(); {27949#(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 20:00:40,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {27949#(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); {27909#true} is VALID [2022-02-20 20:00:40,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,804 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27909#true} {27909#true} #1385#return; {27909#true} is VALID [2022-02-20 20:00:40,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {27909#true} assume { :begin_inline_init_threads1 } true; {27909#true} is VALID [2022-02-20 20:00:40,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {27909#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27909#true} is VALID [2022-02-20 20:00:40,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {27909#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27909#true} is VALID [2022-02-20 20:00:40,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {27909#true} assume { :end_inline_init_threads1 } true; {27909#true} is VALID [2022-02-20 20:00:40,805 INFO L272 TraceCheckUtils]: 12: Hoare triple {27909#true} call fire_delta_events1(); {27950#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:40,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {27950#(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); {27909#true} is VALID [2022-02-20 20:00:40,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {27909#true} assume !(0 == ~q_write_ev~0); {27909#true} is VALID [2022-02-20 20:00:40,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,806 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27909#true} {27909#true} #1387#return; {27909#true} is VALID [2022-02-20 20:00:40,806 INFO L272 TraceCheckUtils]: 17: Hoare triple {27909#true} call activate_threads1(); {27951#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:40,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {27951#(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; {27909#true} is VALID [2022-02-20 20:00:40,806 INFO L272 TraceCheckUtils]: 19: Hoare triple {27909#true} call #t~ret8 := is_do_write_p_triggered(); {27909#true} is VALID [2022-02-20 20:00:40,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {27909#true} havoc ~__retres1~0; {27909#true} is VALID [2022-02-20 20:00:40,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {27909#true} assume !(1 == ~p_dw_pc~0); {27909#true} is VALID [2022-02-20 20:00:40,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {27909#true} assume !(2 == ~p_dw_pc~0); {27909#true} is VALID [2022-02-20 20:00:40,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {27909#true} ~__retres1~0 := 0; {27967#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:40,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {27967#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:40,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:40,808 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27968#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {27909#true} #1381#return; {27959#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:40,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {27959#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27960#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:40,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {27960#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {27910#false} is VALID [2022-02-20 20:00:40,810 INFO L272 TraceCheckUtils]: 29: Hoare triple {27910#false} call #t~ret9 := is_do_read_c_triggered(); {27909#true} is VALID [2022-02-20 20:00:40,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {27909#true} havoc ~__retres1~1; {27909#true} is VALID [2022-02-20 20:00:40,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {27909#true} assume 1 == ~c_dr_pc~0; {27909#true} is VALID [2022-02-20 20:00:40,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {27909#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27909#true} is VALID [2022-02-20 20:00:40,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {27909#true} #res := ~__retres1~1; {27909#true} is VALID [2022-02-20 20:00:40,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,811 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27909#true} {27910#false} #1383#return; {27910#false} is VALID [2022-02-20 20:00:40,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {27910#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27910#false} is VALID [2022-02-20 20:00:40,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {27910#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27910#false} is VALID [2022-02-20 20:00:40,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {27910#false} assume true; {27910#false} is VALID [2022-02-20 20:00:40,811 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27910#false} {27909#true} #1389#return; {27910#false} is VALID [2022-02-20 20:00:40,811 INFO L272 TraceCheckUtils]: 40: Hoare triple {27910#false} call reset_delta_events1(); {27950#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:40,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {27950#(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); {27909#true} is VALID [2022-02-20 20:00:40,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {27909#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27909#true} is VALID [2022-02-20 20:00:40,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,812 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27909#true} {27910#false} #1391#return; {27910#false} is VALID [2022-02-20 20:00:40,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-02-20 20:00:40,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {27910#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; {27910#false} is VALID [2022-02-20 20:00:40,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-02-20 20:00:40,812 INFO L272 TraceCheckUtils]: 48: Hoare triple {27910#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27909#true} is VALID [2022-02-20 20:00:40,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {27909#true} havoc ~__retres1~2; {27909#true} is VALID [2022-02-20 20:00:40,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {27909#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27909#true} is VALID [2022-02-20 20:00:40,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {27909#true} #res := ~__retres1~2; {27909#true} is VALID [2022-02-20 20:00:40,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-02-20 20:00:40,813 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27909#true} {27910#false} #1393#return; {27910#false} is VALID [2022-02-20 20:00:40,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {27910#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; {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {27910#false} assume 0 != eval1_~tmp___1~0#1; {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {27910#false} assume !(0 == ~p_dw_st~0); {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {27910#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; {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#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; {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume !(0 == ~c_dr_pc~0); {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume 2 == ~c_dr_pc~0; {27910#false} is VALID [2022-02-20 20:00:40,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {27910#false} do_read_c_~a~0#1 := ~a_t~0; {27910#false} is VALID [2022-02-20 20:00:40,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {27910#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; {27910#false} is VALID [2022-02-20 20:00:40,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {27910#false} assume !(~p_last_write~0 == ~c_last_read~0); {27910#false} is VALID [2022-02-20 20:00:40,815 INFO L272 TraceCheckUtils]: 64: Hoare triple {27910#false} call error1(); {27910#false} is VALID [2022-02-20 20:00:40,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-02-20 20:00:40,815 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 20:00:40,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:40,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036835446] [2022-02-20 20:00:40,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036835446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:40,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:40,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:40,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574804818] [2022-02-20 20:00:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-02-20 20:00:40,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:40,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:40,859 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 20:00:40,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:40,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:40,860 INFO L87 Difference]: Start difference. First operand 1711 states and 2322 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:44,294 INFO L93 Difference]: Finished difference Result 3325 states and 4495 transitions. [2022-02-20 20:00:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:44,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-02-20 20:00:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 728 transitions. [2022-02-20 20:00:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 728 transitions. [2022-02-20 20:00:44,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 728 transitions. [2022-02-20 20:00:44,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 728 edges. 728 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:44,969 INFO L225 Difference]: With dead ends: 3325 [2022-02-20 20:00:44,969 INFO L226 Difference]: Without dead ends: 1875 [2022-02-20 20:00:44,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:00:44,973 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 692 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:44,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 2144 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-02-20 20:00:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1751. [2022-02-20 20:00:45,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:45,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1875 states. Second operand has 1751 states, 1428 states have (on average 1.3683473389355743) internal successors, (1954), 1451 states have internal predecessors, (1954), 173 states have call successors, (173), 111 states have call predecessors, (173), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:45,082 INFO L74 IsIncluded]: Start isIncluded. First operand 1875 states. Second operand has 1751 states, 1428 states have (on average 1.3683473389355743) internal successors, (1954), 1451 states have internal predecessors, (1954), 173 states have call successors, (173), 111 states have call predecessors, (173), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:45,084 INFO L87 Difference]: Start difference. First operand 1875 states. Second operand has 1751 states, 1428 states have (on average 1.3683473389355743) internal successors, (1954), 1451 states have internal predecessors, (1954), 173 states have call successors, (173), 111 states have call predecessors, (173), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:45,194 INFO L93 Difference]: Finished difference Result 1875 states and 2534 transitions. [2022-02-20 20:00:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2534 transitions. [2022-02-20 20:00:45,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:45,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:45,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 1751 states, 1428 states have (on average 1.3683473389355743) internal successors, (1954), 1451 states have internal predecessors, (1954), 173 states have call successors, (173), 111 states have call predecessors, (173), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) Second operand 1875 states. [2022-02-20 20:00:45,209 INFO L87 Difference]: Start difference. First operand has 1751 states, 1428 states have (on average 1.3683473389355743) internal successors, (1954), 1451 states have internal predecessors, (1954), 173 states have call successors, (173), 111 states have call predecessors, (173), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) Second operand 1875 states. [2022-02-20 20:00:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:45,331 INFO L93 Difference]: Finished difference Result 1875 states and 2534 transitions. [2022-02-20 20:00:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2534 transitions. [2022-02-20 20:00:45,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:45,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:45,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:45,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1428 states have (on average 1.3683473389355743) internal successors, (1954), 1451 states have internal predecessors, (1954), 173 states have call successors, (173), 111 states have call predecessors, (173), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2356 transitions. [2022-02-20 20:00:45,537 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2356 transitions. Word has length 66 [2022-02-20 20:00:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:45,537 INFO L470 AbstractCegarLoop]: Abstraction has 1751 states and 2356 transitions. [2022-02-20 20:00:45,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:00:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2356 transitions. [2022-02-20 20:00:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:45,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:45,539 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 20:00:45,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:45,540 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2039549880, now seen corresponding path program 1 times [2022-02-20 20:00:45,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:45,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361051223] [2022-02-20 20:00:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {38553#(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); {38554#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:45,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {38554#(not (= |old(~q_req_up~0)| 1))} assume true; {38554#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:45,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38554#(not (= |old(~q_req_up~0)| 1))} {38513#(= ~c_dr_pc~0 ~q_req_up~0)} #1385#return; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {38555#(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); {38510#true} is VALID [2022-02-20 20:00:45,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {38510#true} assume !(0 == ~q_write_ev~0); {38510#true} is VALID [2022-02-20 20:00:45,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38510#true} {38517#(not (= ~c_dr_pc~0 1))} #1387#return; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {38510#true} havoc ~__retres1~0; {38510#true} is VALID [2022-02-20 20:00:45,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {38510#true} assume !(1 == ~p_dw_pc~0); {38510#true} is VALID [2022-02-20 20:00:45,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {38510#true} assume !(2 == ~p_dw_pc~0); {38510#true} is VALID [2022-02-20 20:00:45,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {38510#true} ~__retres1~0 := 0; {38510#true} is VALID [2022-02-20 20:00:45,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {38510#true} #res := ~__retres1~0; {38510#true} is VALID [2022-02-20 20:00:45,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,677 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38510#true} {38510#true} #1381#return; {38510#true} is VALID [2022-02-20 20:00:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {38510#true} havoc ~__retres1~1; {38510#true} is VALID [2022-02-20 20:00:45,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {38510#true} assume 1 == ~c_dr_pc~0; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,688 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} {38510#true} #1383#return; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {38556#(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; {38510#true} is VALID [2022-02-20 20:00:45,689 INFO L272 TraceCheckUtils]: 1: Hoare triple {38510#true} call #t~ret8 := is_do_write_p_triggered(); {38510#true} is VALID [2022-02-20 20:00:45,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {38510#true} havoc ~__retres1~0; {38510#true} is VALID [2022-02-20 20:00:45,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {38510#true} assume !(1 == ~p_dw_pc~0); {38510#true} is VALID [2022-02-20 20:00:45,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {38510#true} assume !(2 == ~p_dw_pc~0); {38510#true} is VALID [2022-02-20 20:00:45,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {38510#true} ~__retres1~0 := 0; {38510#true} is VALID [2022-02-20 20:00:45,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {38510#true} #res := ~__retres1~0; {38510#true} is VALID [2022-02-20 20:00:45,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,690 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {38510#true} {38510#true} #1381#return; {38510#true} is VALID [2022-02-20 20:00:45,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {38510#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38510#true} is VALID [2022-02-20 20:00:45,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {38510#true} assume !(0 != ~tmp~1); {38510#true} is VALID [2022-02-20 20:00:45,690 INFO L272 TraceCheckUtils]: 11: Hoare triple {38510#true} call #t~ret9 := is_do_read_c_triggered(); {38510#true} is VALID [2022-02-20 20:00:45,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {38510#true} havoc ~__retres1~1; {38510#true} is VALID [2022-02-20 20:00:45,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {38510#true} assume 1 == ~c_dr_pc~0; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,692 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} {38510#true} #1383#return; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,694 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} {38517#(not (= ~c_dr_pc~0 1))} #1389#return; {38511#false} is VALID [2022-02-20 20:00:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {38555#(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); {38510#true} is VALID [2022-02-20 20:00:45,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {38510#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {38510#true} is VALID [2022-02-20 20:00:45,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38510#true} {38511#false} #1391#return; {38511#false} is VALID [2022-02-20 20:00:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:45,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {38510#true} havoc ~__retres1~2; {38510#true} is VALID [2022-02-20 20:00:45,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {38510#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38510#true} is VALID [2022-02-20 20:00:45,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {38510#true} #res := ~__retres1~2; {38510#true} is VALID [2022-02-20 20:00:45,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,705 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38510#true} {38511#false} #1393#return; {38511#false} is VALID [2022-02-20 20:00:45,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {38510#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {38512#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:45,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {38512#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {38512#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:45,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {38512#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {38513#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:45,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {38513#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {38513#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:45,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {38513#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {38553#(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 20:00:45,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {38553#(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); {38554#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:45,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {38554#(not (= |old(~q_req_up~0)| 1))} assume true; {38554#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:45,709 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38554#(not (= |old(~q_req_up~0)| 1))} {38513#(= ~c_dr_pc~0 ~q_req_up~0)} #1385#return; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {38517#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {38517#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {38517#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {38517#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,711 INFO L272 TraceCheckUtils]: 12: Hoare triple {38517#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {38555#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:45,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {38555#(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); {38510#true} is VALID [2022-02-20 20:00:45,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {38510#true} assume !(0 == ~q_write_ev~0); {38510#true} is VALID [2022-02-20 20:00:45,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38510#true} {38517#(not (= ~c_dr_pc~0 1))} #1387#return; {38517#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:45,712 INFO L272 TraceCheckUtils]: 17: Hoare triple {38517#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {38556#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:45,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {38556#(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; {38510#true} is VALID [2022-02-20 20:00:45,713 INFO L272 TraceCheckUtils]: 19: Hoare triple {38510#true} call #t~ret8 := is_do_write_p_triggered(); {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {38510#true} havoc ~__retres1~0; {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {38510#true} assume !(1 == ~p_dw_pc~0); {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {38510#true} assume !(2 == ~p_dw_pc~0); {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {38510#true} ~__retres1~0 := 0; {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {38510#true} #res := ~__retres1~0; {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,714 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38510#true} {38510#true} #1381#return; {38510#true} is VALID [2022-02-20 20:00:45,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {38510#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38510#true} is VALID [2022-02-20 20:00:45,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {38510#true} assume !(0 != ~tmp~1); {38510#true} is VALID [2022-02-20 20:00:45,715 INFO L272 TraceCheckUtils]: 29: Hoare triple {38510#true} call #t~ret9 := is_do_read_c_triggered(); {38510#true} is VALID [2022-02-20 20:00:45,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {38510#true} havoc ~__retres1~1; {38510#true} is VALID [2022-02-20 20:00:45,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {38510#true} assume 1 == ~c_dr_pc~0; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,717 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} {38510#true} #1383#return; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:45,718 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38570#(= (+ (- 1) ~c_dr_pc~0) 0)} {38517#(not (= ~c_dr_pc~0 1))} #1389#return; {38511#false} is VALID [2022-02-20 20:00:45,718 INFO L272 TraceCheckUtils]: 40: Hoare triple {38511#false} call reset_delta_events1(); {38555#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:45,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {38555#(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); {38510#true} is VALID [2022-02-20 20:00:45,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {38510#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {38510#true} is VALID [2022-02-20 20:00:45,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,719 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {38510#true} {38511#false} #1391#return; {38511#false} is VALID [2022-02-20 20:00:45,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {38511#false} assume !false; {38511#false} is VALID [2022-02-20 20:00:45,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {38511#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; {38511#false} is VALID [2022-02-20 20:00:45,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {38511#false} assume !false; {38511#false} is VALID [2022-02-20 20:00:45,720 INFO L272 TraceCheckUtils]: 48: Hoare triple {38511#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38510#true} is VALID [2022-02-20 20:00:45,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {38510#true} havoc ~__retres1~2; {38510#true} is VALID [2022-02-20 20:00:45,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {38510#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38510#true} is VALID [2022-02-20 20:00:45,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {38510#true} #res := ~__retres1~2; {38510#true} is VALID [2022-02-20 20:00:45,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {38510#true} assume true; {38510#true} is VALID [2022-02-20 20:00:45,720 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38510#true} {38511#false} #1393#return; {38511#false} is VALID [2022-02-20 20:00:45,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {38511#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; {38511#false} is VALID [2022-02-20 20:00:45,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {38511#false} assume 0 != eval1_~tmp___1~0#1; {38511#false} is VALID [2022-02-20 20:00:45,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {38511#false} assume !(0 == ~p_dw_st~0); {38511#false} is VALID [2022-02-20 20:00:45,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {38511#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; {38511#false} is VALID [2022-02-20 20:00:45,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {38511#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; {38511#false} is VALID [2022-02-20 20:00:45,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {38511#false} assume !(0 == ~c_dr_pc~0); {38511#false} is VALID [2022-02-20 20:00:45,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {38511#false} assume 2 == ~c_dr_pc~0; {38511#false} is VALID [2022-02-20 20:00:45,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {38511#false} do_read_c_~a~0#1 := ~a_t~0; {38511#false} is VALID [2022-02-20 20:00:45,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {38511#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; {38511#false} is VALID [2022-02-20 20:00:45,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {38511#false} assume !(~p_last_write~0 == ~c_last_read~0); {38511#false} is VALID [2022-02-20 20:00:45,729 INFO L272 TraceCheckUtils]: 64: Hoare triple {38511#false} call error1(); {38511#false} is VALID [2022-02-20 20:00:45,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {38511#false} assume !false; {38511#false} is VALID [2022-02-20 20:00:45,730 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 20:00:45,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:45,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361051223] [2022-02-20 20:00:45,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361051223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:45,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:45,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:45,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21206638] [2022-02-20 20:00:45,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:45,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2022-02-20 20:00:45,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:45,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:00:45,772 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 20:00:45,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:45,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:45,773 INFO L87 Difference]: Start difference. First operand 1751 states and 2356 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:00:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,547 INFO L93 Difference]: Finished difference Result 5485 states and 7458 transitions. [2022-02-20 20:00:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:52,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2022-02-20 20:00:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:00:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1341 transitions. [2022-02-20 20:00:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:00:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1341 transitions. [2022-02-20 20:00:52,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1341 transitions. [2022-02-20 20:00:53,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1341 edges. 1341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:53,762 INFO L225 Difference]: With dead ends: 5485 [2022-02-20 20:00:53,762 INFO L226 Difference]: Without dead ends: 2148 [2022-02-20 20:00:53,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:53,770 INFO L933 BasicCegarLoop]: 675 mSDtfsCounter, 3027 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:53,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3045 Valid, 2604 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:00:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-02-20 20:00:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1952. [2022-02-20 20:00:53,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:53,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2148 states. Second operand has 1952 states, 1559 states have (on average 1.3290570878768442) internal successors, (2072), 1584 states have internal predecessors, (2072), 213 states have call successors, (213), 139 states have call predecessors, (213), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:53,891 INFO L74 IsIncluded]: Start isIncluded. First operand 2148 states. Second operand has 1952 states, 1559 states have (on average 1.3290570878768442) internal successors, (2072), 1584 states have internal predecessors, (2072), 213 states have call successors, (213), 139 states have call predecessors, (213), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:53,894 INFO L87 Difference]: Start difference. First operand 2148 states. Second operand has 1952 states, 1559 states have (on average 1.3290570878768442) internal successors, (2072), 1584 states have internal predecessors, (2072), 213 states have call successors, (213), 139 states have call predecessors, (213), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:54,093 INFO L93 Difference]: Finished difference Result 2148 states and 2813 transitions. [2022-02-20 20:00:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2813 transitions. [2022-02-20 20:00:54,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:54,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:54,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 1952 states, 1559 states have (on average 1.3290570878768442) internal successors, (2072), 1584 states have internal predecessors, (2072), 213 states have call successors, (213), 139 states have call predecessors, (213), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) Second operand 2148 states. [2022-02-20 20:00:54,104 INFO L87 Difference]: Start difference. First operand has 1952 states, 1559 states have (on average 1.3290570878768442) internal successors, (2072), 1584 states have internal predecessors, (2072), 213 states have call successors, (213), 139 states have call predecessors, (213), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) Second operand 2148 states. [2022-02-20 20:00:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:54,306 INFO L93 Difference]: Finished difference Result 2148 states and 2813 transitions. [2022-02-20 20:00:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2813 transitions. [2022-02-20 20:00:54,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:54,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:54,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:54,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1559 states have (on average 1.3290570878768442) internal successors, (2072), 1584 states have internal predecessors, (2072), 213 states have call successors, (213), 139 states have call predecessors, (213), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2558 transitions. [2022-02-20 20:00:54,570 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2558 transitions. Word has length 66 [2022-02-20 20:00:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:54,570 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2558 transitions. [2022-02-20 20:00:54,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:00:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2558 transitions. [2022-02-20 20:00:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:54,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:54,577 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:54,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:54,578 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1663597100, now seen corresponding path program 1 times [2022-02-20 20:00:54,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:54,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822662183] [2022-02-20 20:00:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {52939#(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); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1385#return; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {52940#(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); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {52940#(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); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1387#return; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {52892#true} havoc ~__retres1~0; {52892#true} is VALID [2022-02-20 20:00:54,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {52892#true} assume !(1 == ~p_dw_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {52892#true} assume !(2 == ~p_dw_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {52892#true} ~__retres1~0 := 0; {52892#true} is VALID [2022-02-20 20:00:54,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {52892#true} #res := ~__retres1~0; {52892#true} is VALID [2022-02-20 20:00:54,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,672 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {52892#true} {52892#true} #1381#return; {52892#true} is VALID [2022-02-20 20:00:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {52892#true} havoc ~__retres1~1; {52892#true} is VALID [2022-02-20 20:00:54,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {52892#true} assume !(1 == ~c_dr_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {52892#true} assume !(2 == ~c_dr_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {52892#true} ~__retres1~1 := 0; {52892#true} is VALID [2022-02-20 20:00:54,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {52892#true} #res := ~__retres1~1; {52892#true} is VALID [2022-02-20 20:00:54,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,677 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {52892#true} {52892#true} #1383#return; {52892#true} is VALID [2022-02-20 20:00:54,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {52941#(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; {52892#true} is VALID [2022-02-20 20:00:54,678 INFO L272 TraceCheckUtils]: 1: Hoare triple {52892#true} call #t~ret8 := is_do_write_p_triggered(); {52892#true} is VALID [2022-02-20 20:00:54,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {52892#true} havoc ~__retres1~0; {52892#true} is VALID [2022-02-20 20:00:54,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {52892#true} assume !(1 == ~p_dw_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {52892#true} assume !(2 == ~p_dw_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {52892#true} ~__retres1~0 := 0; {52892#true} is VALID [2022-02-20 20:00:54,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {52892#true} #res := ~__retres1~0; {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {52892#true} {52892#true} #1381#return; {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {52892#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {52892#true} assume !(0 != ~tmp~1); {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {52892#true} call #t~ret9 := is_do_read_c_triggered(); {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {52892#true} havoc ~__retres1~1; {52892#true} is VALID [2022-02-20 20:00:54,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {52892#true} assume !(1 == ~c_dr_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {52892#true} assume !(2 == ~c_dr_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {52892#true} ~__retres1~1 := 0; {52892#true} is VALID [2022-02-20 20:00:54,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {52892#true} #res := ~__retres1~1; {52892#true} is VALID [2022-02-20 20:00:54,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,680 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {52892#true} {52892#true} #1383#return; {52892#true} is VALID [2022-02-20 20:00:54,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {52892#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {52892#true} is VALID [2022-02-20 20:00:54,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {52892#true} assume !(0 != ~tmp___0~1); {52892#true} is VALID [2022-02-20 20:00:54,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,681 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {52892#true} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1389#return; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {52940#(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); {52956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:54,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {52956#(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; {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:54,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:54,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1391#return; {52893#false} is VALID [2022-02-20 20:00:54,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {52892#true} havoc ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {52892#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52892#true} is VALID [2022-02-20 20:00:54,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {52892#true} #res := ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,712 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {52892#true} {52893#false} #1393#return; {52893#false} is VALID [2022-02-20 20:00:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {52892#true} havoc ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {52892#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52892#true} is VALID [2022-02-20 20:00:54,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {52892#true} #res := ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,717 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {52892#true} {52893#false} #1393#return; {52893#false} is VALID [2022-02-20 20:00:54,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {52892#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {52892#true} is VALID [2022-02-20 20:00:54,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {52892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {52892#true} is VALID [2022-02-20 20:00:54,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {52892#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {52894#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {52939#(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 20:00:54,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {52939#(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); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,720 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1385#return; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,722 INFO L272 TraceCheckUtils]: 12: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {52940#(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); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {52940#(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); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,724 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1387#return; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,724 INFO L272 TraceCheckUtils]: 17: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {52941#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:54,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {52941#(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; {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L272 TraceCheckUtils]: 19: Hoare triple {52892#true} call #t~ret8 := is_do_write_p_triggered(); {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {52892#true} havoc ~__retres1~0; {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {52892#true} assume !(1 == ~p_dw_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {52892#true} assume !(2 == ~p_dw_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {52892#true} ~__retres1~0 := 0; {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {52892#true} #res := ~__retres1~0; {52892#true} is VALID [2022-02-20 20:00:54,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {52892#true} {52892#true} #1381#return; {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {52892#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {52892#true} assume !(0 != ~tmp~1); {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L272 TraceCheckUtils]: 29: Hoare triple {52892#true} call #t~ret9 := is_do_read_c_triggered(); {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {52892#true} havoc ~__retres1~1; {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {52892#true} assume !(1 == ~c_dr_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {52892#true} assume !(2 == ~c_dr_pc~0); {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {52892#true} ~__retres1~1 := 0; {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {52892#true} #res := ~__retres1~1; {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {52892#true} {52892#true} #1383#return; {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {52892#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {52892#true} assume !(0 != ~tmp___0~1); {52892#true} is VALID [2022-02-20 20:00:54,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,728 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {52892#true} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1389#return; {52894#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:54,728 INFO L272 TraceCheckUtils]: 41: Hoare triple {52894#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {52940#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {52940#(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); {52956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:54,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {52956#(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; {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:54,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:54,730 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {52957#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {52894#(= ~q_write_ev~0 ~q_read_ev~0)} #1391#return; {52893#false} is VALID [2022-02-20 20:00:54,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {52893#false} assume !false; {52893#false} is VALID [2022-02-20 20:00:54,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {52893#false} assume !false; {52893#false} is VALID [2022-02-20 20:00:54,730 INFO L272 TraceCheckUtils]: 49: Hoare triple {52893#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {52892#true} is VALID [2022-02-20 20:00:54,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {52892#true} havoc ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {52892#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52892#true} is VALID [2022-02-20 20:00:54,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {52892#true} #res := ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,731 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {52892#true} {52893#false} #1393#return; {52893#false} is VALID [2022-02-20 20:00:54,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {52893#false} assume 0 != eval1_~tmp___1~0#1; {52893#false} is VALID [2022-02-20 20:00:54,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {52893#false} 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; {52893#false} is VALID [2022-02-20 20:00:54,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {52893#false} 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; {52893#false} is VALID [2022-02-20 20:00:54,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {52893#false} assume 0 == ~p_dw_pc~0; {52893#false} is VALID [2022-02-20 20:00:54,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {52893#false} assume !false; {52893#false} is VALID [2022-02-20 20:00:54,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {52893#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {52893#false} is VALID [2022-02-20 20:00:54,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {52893#false} assume { :end_inline_do_write_p } true; {52893#false} is VALID [2022-02-20 20:00:54,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {52893#false} assume !(0 == ~c_dr_st~0); {52893#false} is VALID [2022-02-20 20:00:54,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {52893#false} assume !false; {52893#false} is VALID [2022-02-20 20:00:54,733 INFO L272 TraceCheckUtils]: 65: Hoare triple {52893#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {52892#true} is VALID [2022-02-20 20:00:54,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {52892#true} havoc ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {52892#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52892#true} is VALID [2022-02-20 20:00:54,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {52892#true} #res := ~__retres1~2; {52892#true} is VALID [2022-02-20 20:00:54,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {52892#true} assume true; {52892#true} is VALID [2022-02-20 20:00:54,734 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {52892#true} {52893#false} #1393#return; {52893#false} is VALID [2022-02-20 20:00:54,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {52893#false} assume 0 != eval1_~tmp___1~0#1; {52893#false} is VALID [2022-02-20 20:00:54,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {52893#false} 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; {52893#false} is VALID [2022-02-20 20:00:54,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {52893#false} 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; {52893#false} is VALID [2022-02-20 20:00:54,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {52893#false} assume !(0 == ~p_dw_pc~0); {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {52893#false} assume 1 == ~p_dw_pc~0; {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {52893#false} assume !(0 == ~q_free~0); {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {52893#false} assume !false; {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {52893#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {52893#false} assume { :end_inline_do_write_p } true; {52893#false} is VALID [2022-02-20 20:00:54,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L290 TraceCheckUtils]: 84: Hoare triple {52893#false} assume !(0 == ~c_dr_pc~0); {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L290 TraceCheckUtils]: 85: Hoare triple {52893#false} assume 2 == ~c_dr_pc~0; {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L290 TraceCheckUtils]: 86: Hoare triple {52893#false} do_read_c_~a~0#1 := ~a_t~0; {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L290 TraceCheckUtils]: 87: Hoare triple {52893#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; {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L290 TraceCheckUtils]: 88: Hoare triple {52893#false} assume !(~p_last_write~0 == ~c_last_read~0); {52893#false} is VALID [2022-02-20 20:00:54,736 INFO L272 TraceCheckUtils]: 89: Hoare triple {52893#false} call error1(); {52893#false} is VALID [2022-02-20 20:00:54,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {52893#false} assume !false; {52893#false} is VALID [2022-02-20 20:00:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:54,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:54,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822662183] [2022-02-20 20:00:54,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822662183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:54,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:54,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:54,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746756217] [2022-02-20 20:00:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-02-20 20:00:54,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:54,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 20:00:54,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:54,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:54,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:54,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:54,788 INFO L87 Difference]: Start difference. First operand 1952 states and 2558 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 20:00:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,218 INFO L93 Difference]: Finished difference Result 3489 states and 4546 transitions. [2022-02-20 20:00:58,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 20:00:58,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-02-20 20:00:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 20:00:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 908 transitions. [2022-02-20 20:00:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 20:00:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 908 transitions. [2022-02-20 20:00:58,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 908 transitions. [2022-02-20 20:00:58,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 908 edges. 908 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:59,056 INFO L225 Difference]: With dead ends: 3489 [2022-02-20 20:00:59,056 INFO L226 Difference]: Without dead ends: 2036 [2022-02-20 20:00:59,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 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 20:00:59,060 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 1336 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:59,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 1646 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-02-20 20:00:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1731. [2022-02-20 20:00:59,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:59,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2036 states. Second operand has 1731 states, 1391 states have (on average 1.3306973400431343) internal successors, (1851), 1411 states have internal predecessors, (1851), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:00:59,183 INFO L74 IsIncluded]: Start isIncluded. First operand 2036 states. Second operand has 1731 states, 1391 states have (on average 1.3306973400431343) internal successors, (1851), 1411 states have internal predecessors, (1851), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:00:59,186 INFO L87 Difference]: Start difference. First operand 2036 states. Second operand has 1731 states, 1391 states have (on average 1.3306973400431343) internal successors, (1851), 1411 states have internal predecessors, (1851), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:00:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:59,310 INFO L93 Difference]: Finished difference Result 2036 states and 2666 transitions. [2022-02-20 20:00:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2666 transitions. [2022-02-20 20:00:59,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:59,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:59,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 1731 states, 1391 states have (on average 1.3306973400431343) internal successors, (1851), 1411 states have internal predecessors, (1851), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 2036 states. [2022-02-20 20:00:59,319 INFO L87 Difference]: Start difference. First operand has 1731 states, 1391 states have (on average 1.3306973400431343) internal successors, (1851), 1411 states have internal predecessors, (1851), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 2036 states. [2022-02-20 20:00:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:59,506 INFO L93 Difference]: Finished difference Result 2036 states and 2666 transitions. [2022-02-20 20:00:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2666 transitions. [2022-02-20 20:00:59,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:59,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:59,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:59,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1391 states have (on average 1.3306973400431343) internal successors, (1851), 1411 states have internal predecessors, (1851), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:00:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2269 transitions. [2022-02-20 20:00:59,698 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2269 transitions. Word has length 91 [2022-02-20 20:00:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:59,699 INFO L470 AbstractCegarLoop]: Abstraction has 1731 states and 2269 transitions. [2022-02-20 20:00:59,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 20:00:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2269 transitions. [2022-02-20 20:00:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:59,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:59,701 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:59,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:59,701 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash -692208150, now seen corresponding path program 1 times [2022-02-20 20:00:59,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:59,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59326030] [2022-02-20 20:00:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {64058#(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); {64011#true} is VALID [2022-02-20 20:00:59,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64011#true} {64011#true} #1385#return; {64011#true} is VALID [2022-02-20 20:00:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {64059#(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); {64011#true} is VALID [2022-02-20 20:00:59,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume !(0 == ~q_write_ev~0); {64011#true} is VALID [2022-02-20 20:00:59,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64011#true} {64016#(= ~c_dr_st~0 0)} #1387#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {64011#true} havoc ~__retres1~0; {64011#true} is VALID [2022-02-20 20:00:59,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume !(1 == ~p_dw_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} assume !(2 == ~p_dw_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {64011#true} ~__retres1~0 := 0; {64011#true} is VALID [2022-02-20 20:00:59,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {64011#true} #res := ~__retres1~0; {64011#true} is VALID [2022-02-20 20:00:59,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,787 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64011#true} {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1381#return; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {64011#true} havoc ~__retres1~1; {64011#true} is VALID [2022-02-20 20:00:59,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume !(1 == ~c_dr_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} assume !(2 == ~c_dr_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {64011#true} ~__retres1~1 := 0; {64011#true} is VALID [2022-02-20 20:00:59,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {64011#true} #res := ~__retres1~1; {64011#true} is VALID [2022-02-20 20:00:59,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,792 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64011#true} {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1383#return; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {64060#(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; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,793 INFO L272 TraceCheckUtils]: 1: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {64011#true} is VALID [2022-02-20 20:00:59,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} havoc ~__retres1~0; {64011#true} is VALID [2022-02-20 20:00:59,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {64011#true} assume !(1 == ~p_dw_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {64011#true} assume !(2 == ~p_dw_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {64011#true} ~__retres1~0 := 0; {64011#true} is VALID [2022-02-20 20:00:59,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {64011#true} #res := ~__retres1~0; {64011#true} is VALID [2022-02-20 20:00:59,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,794 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {64011#true} {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1381#return; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,795 INFO L272 TraceCheckUtils]: 11: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {64011#true} is VALID [2022-02-20 20:00:59,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {64011#true} havoc ~__retres1~1; {64011#true} is VALID [2022-02-20 20:00:59,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {64011#true} assume !(1 == ~c_dr_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {64011#true} assume !(2 == ~c_dr_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {64011#true} ~__retres1~1 := 0; {64011#true} is VALID [2022-02-20 20:00:59,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {64011#true} #res := ~__retres1~1; {64011#true} is VALID [2022-02-20 20:00:59,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,797 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {64011#true} {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1383#return; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,798 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {64016#(= ~c_dr_st~0 0)} #1389#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {64059#(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); {64011#true} is VALID [2022-02-20 20:00:59,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume !(1 == ~q_write_ev~0); {64011#true} is VALID [2022-02-20 20:00:59,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64011#true} {64016#(= ~c_dr_st~0 0)} #1391#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {64011#true} havoc ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64011#true} is VALID [2022-02-20 20:00:59,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} #res := ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,808 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64011#true} {64016#(= ~c_dr_st~0 0)} #1393#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {64011#true} havoc ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64011#true} is VALID [2022-02-20 20:00:59,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} #res := ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,811 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64011#true} {64012#false} #1393#return; {64012#false} is VALID [2022-02-20 20:00:59,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {64011#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {64011#true} is VALID [2022-02-20 20:00:59,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {64011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {64011#true} is VALID [2022-02-20 20:00:59,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {64011#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {64011#true} is VALID [2022-02-20 20:00:59,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {64011#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {64011#true} is VALID [2022-02-20 20:00:59,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {64011#true} call update_channels1(); {64058#(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 20:00:59,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {64058#(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); {64011#true} is VALID [2022-02-20 20:00:59,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,813 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64011#true} {64011#true} #1385#return; {64011#true} is VALID [2022-02-20 20:00:59,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {64011#true} assume { :begin_inline_init_threads1 } true; {64011#true} is VALID [2022-02-20 20:00:59,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {64011#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {64011#true} is VALID [2022-02-20 20:00:59,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {64011#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {64016#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,814 INFO L272 TraceCheckUtils]: 12: Hoare triple {64016#(= ~c_dr_st~0 0)} call fire_delta_events1(); {64059#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:59,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {64059#(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); {64011#true} is VALID [2022-02-20 20:00:59,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {64011#true} assume !(0 == ~q_write_ev~0); {64011#true} is VALID [2022-02-20 20:00:59,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64011#true} {64016#(= ~c_dr_st~0 0)} #1387#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,815 INFO L272 TraceCheckUtils]: 17: Hoare triple {64016#(= ~c_dr_st~0 0)} call activate_threads1(); {64060#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:59,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {64060#(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; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,816 INFO L272 TraceCheckUtils]: 19: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {64011#true} is VALID [2022-02-20 20:00:59,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {64011#true} havoc ~__retres1~0; {64011#true} is VALID [2022-02-20 20:00:59,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {64011#true} assume !(1 == ~p_dw_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {64011#true} assume !(2 == ~p_dw_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {64011#true} ~__retres1~0 := 0; {64011#true} is VALID [2022-02-20 20:00:59,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {64011#true} #res := ~__retres1~0; {64011#true} is VALID [2022-02-20 20:00:59,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,817 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {64011#true} {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1381#return; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,818 INFO L272 TraceCheckUtils]: 29: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {64011#true} is VALID [2022-02-20 20:00:59,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {64011#true} havoc ~__retres1~1; {64011#true} is VALID [2022-02-20 20:00:59,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {64011#true} assume !(1 == ~c_dr_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {64011#true} assume !(2 == ~c_dr_pc~0); {64011#true} is VALID [2022-02-20 20:00:59,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {64011#true} ~__retres1~1 := 0; {64011#true} is VALID [2022-02-20 20:00:59,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {64011#true} #res := ~__retres1~1; {64011#true} is VALID [2022-02-20 20:00:59,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,819 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {64011#true} {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1383#return; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:59,821 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {64061#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {64016#(= ~c_dr_st~0 0)} #1389#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,821 INFO L272 TraceCheckUtils]: 41: Hoare triple {64016#(= ~c_dr_st~0 0)} call reset_delta_events1(); {64059#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:59,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {64059#(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); {64011#true} is VALID [2022-02-20 20:00:59,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {64011#true} assume !(1 == ~q_write_ev~0); {64011#true} is VALID [2022-02-20 20:00:59,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,822 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {64011#true} {64016#(= ~c_dr_st~0 0)} #1391#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {64016#(= ~c_dr_st~0 0)} assume !false; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {64016#(= ~c_dr_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; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {64016#(= ~c_dr_st~0 0)} assume !false; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,823 INFO L272 TraceCheckUtils]: 49: Hoare triple {64016#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64011#true} is VALID [2022-02-20 20:00:59,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {64011#true} havoc ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {64011#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64011#true} is VALID [2022-02-20 20:00:59,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {64011#true} #res := ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,824 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {64011#true} {64016#(= ~c_dr_st~0 0)} #1393#return; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {64016#(= ~c_dr_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; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {64016#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {64016#(= ~c_dr_st~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; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {64016#(= ~c_dr_st~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; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {64016#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {64016#(= ~c_dr_st~0 0)} assume !false; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {64016#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {64016#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {64016#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:59,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {64016#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {64012#false} is VALID [2022-02-20 20:00:59,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {64012#false} assume !false; {64012#false} is VALID [2022-02-20 20:00:59,828 INFO L272 TraceCheckUtils]: 65: Hoare triple {64012#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64011#true} is VALID [2022-02-20 20:00:59,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {64011#true} havoc ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {64011#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64011#true} is VALID [2022-02-20 20:00:59,828 INFO L290 TraceCheckUtils]: 68: Hoare triple {64011#true} #res := ~__retres1~2; {64011#true} is VALID [2022-02-20 20:00:59,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {64011#true} assume true; {64011#true} is VALID [2022-02-20 20:00:59,828 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {64011#true} {64012#false} #1393#return; {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 71: Hoare triple {64012#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; {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {64012#false} assume 0 != eval1_~tmp___1~0#1; {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {64012#false} 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; {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 74: Hoare triple {64012#false} 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; {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 75: Hoare triple {64012#false} assume !(0 == ~p_dw_pc~0); {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 76: Hoare triple {64012#false} assume 1 == ~p_dw_pc~0; {64012#false} is VALID [2022-02-20 20:00:59,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {64012#false} assume !(0 == ~q_free~0); {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 78: Hoare triple {64012#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; {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {64012#false} assume !false; {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 80: Hoare triple {64012#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {64012#false} assume { :end_inline_do_write_p } true; {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {64012#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; {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {64012#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; {64012#false} is VALID [2022-02-20 20:00:59,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {64012#false} assume !(0 == ~c_dr_pc~0); {64012#false} is VALID [2022-02-20 20:00:59,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {64012#false} assume 2 == ~c_dr_pc~0; {64012#false} is VALID [2022-02-20 20:00:59,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {64012#false} do_read_c_~a~0#1 := ~a_t~0; {64012#false} is VALID [2022-02-20 20:00:59,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {64012#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; {64012#false} is VALID [2022-02-20 20:00:59,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {64012#false} assume !(~p_last_write~0 == ~c_last_read~0); {64012#false} is VALID [2022-02-20 20:00:59,831 INFO L272 TraceCheckUtils]: 89: Hoare triple {64012#false} call error1(); {64012#false} is VALID [2022-02-20 20:00:59,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {64012#false} assume !false; {64012#false} is VALID [2022-02-20 20:00:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:00:59,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:59,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59326030] [2022-02-20 20:00:59,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59326030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:59,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:59,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:59,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820667033] [2022-02-20 20:00:59,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:00:59,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:59,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:59,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:59,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:59,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:59,889 INFO L87 Difference]: Start difference. First operand 1731 states and 2269 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:01,718 INFO L93 Difference]: Finished difference Result 3307 states and 4329 transitions. [2022-02-20 20:01:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:01,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 697 transitions. [2022-02-20 20:01:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 697 transitions. [2022-02-20 20:01:01,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 697 transitions. [2022-02-20 20:01:02,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 697 edges. 697 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:02,342 INFO L225 Difference]: With dead ends: 3307 [2022-02-20 20:01:02,343 INFO L226 Difference]: Without dead ends: 1838 [2022-02-20 20:01:02,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-20 20:01:02,346 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 1144 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:02,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1173 Valid, 1203 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:01:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-02-20 20:01:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1731. [2022-02-20 20:01:02,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:02,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1838 states. Second operand has 1731 states, 1391 states have (on average 1.3048166786484543) internal successors, (1815), 1411 states have internal predecessors, (1815), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:02,463 INFO L74 IsIncluded]: Start isIncluded. First operand 1838 states. Second operand has 1731 states, 1391 states have (on average 1.3048166786484543) internal successors, (1815), 1411 states have internal predecessors, (1815), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:02,465 INFO L87 Difference]: Start difference. First operand 1838 states. Second operand has 1731 states, 1391 states have (on average 1.3048166786484543) internal successors, (1815), 1411 states have internal predecessors, (1815), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:02,620 INFO L93 Difference]: Finished difference Result 1838 states and 2382 transitions. [2022-02-20 20:01:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2382 transitions. [2022-02-20 20:01:02,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:02,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:02,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 1731 states, 1391 states have (on average 1.3048166786484543) internal successors, (1815), 1411 states have internal predecessors, (1815), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 1838 states. [2022-02-20 20:01:02,637 INFO L87 Difference]: Start difference. First operand has 1731 states, 1391 states have (on average 1.3048166786484543) internal successors, (1815), 1411 states have internal predecessors, (1815), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 1838 states. [2022-02-20 20:01:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:02,793 INFO L93 Difference]: Finished difference Result 1838 states and 2382 transitions. [2022-02-20 20:01:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2382 transitions. [2022-02-20 20:01:02,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:02,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:02,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:02,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1391 states have (on average 1.3048166786484543) internal successors, (1815), 1411 states have internal predecessors, (1815), 185 states have call successors, (185), 120 states have call predecessors, (185), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2233 transitions. [2022-02-20 20:01:02,991 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2233 transitions. Word has length 91 [2022-02-20 20:01:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:02,991 INFO L470 AbstractCegarLoop]: Abstraction has 1731 states and 2233 transitions. [2022-02-20 20:01:02,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2233 transitions. [2022-02-20 20:01:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:02,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:02,992 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:02,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:02,993 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1486977360, now seen corresponding path program 1 times [2022-02-20 20:01:02,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:02,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028294544] [2022-02-20 20:01:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {74555#(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); {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:03,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:03,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {74509#(= ~q_read_ev~0 2)} #1385#return; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {74557#(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); {74507#true} is VALID [2022-02-20 20:01:03,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume !(0 == ~q_write_ev~0); {74507#true} is VALID [2022-02-20 20:01:03,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74507#true} {74509#(= ~q_read_ev~0 2)} #1387#return; {74507#true} is VALID [2022-02-20 20:01:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {74507#true} havoc ~__retres1~0; {74507#true} is VALID [2022-02-20 20:01:03,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume !(1 == ~p_dw_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} assume !(2 == ~p_dw_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {74507#true} ~__retres1~0 := 0; {74507#true} is VALID [2022-02-20 20:01:03,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {74507#true} #res := ~__retres1~0; {74507#true} is VALID [2022-02-20 20:01:03,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,089 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {74507#true} {74507#true} #1381#return; {74507#true} is VALID [2022-02-20 20:01:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {74507#true} havoc ~__retres1~1; {74507#true} is VALID [2022-02-20 20:01:03,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume !(1 == ~c_dr_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} assume !(2 == ~c_dr_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {74507#true} ~__retres1~1 := 0; {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {74507#true} #res := ~__retres1~1; {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {74507#true} {74507#true} #1383#return; {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {74558#(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; {74507#true} is VALID [2022-02-20 20:01:03,094 INFO L272 TraceCheckUtils]: 1: Hoare triple {74507#true} call #t~ret8 := is_do_write_p_triggered(); {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} havoc ~__retres1~0; {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {74507#true} assume !(1 == ~p_dw_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L290 TraceCheckUtils]: 4: Hoare triple {74507#true} assume !(2 == ~p_dw_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {74507#true} ~__retres1~0 := 0; {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {74507#true} #res := ~__retres1~0; {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,095 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {74507#true} {74507#true} #1381#return; {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {74507#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {74507#true} assume !(0 != ~tmp~1); {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L272 TraceCheckUtils]: 11: Hoare triple {74507#true} call #t~ret9 := is_do_read_c_triggered(); {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {74507#true} havoc ~__retres1~1; {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {74507#true} assume !(1 == ~c_dr_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {74507#true} assume !(2 == ~c_dr_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {74507#true} ~__retres1~1 := 0; {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {74507#true} #res := ~__retres1~1; {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {74507#true} {74507#true} #1383#return; {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {74507#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {74507#true} assume !(0 != ~tmp___0~1); {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,097 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {74507#true} {74507#true} #1389#return; {74507#true} is VALID [2022-02-20 20:01:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {74557#(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); {74507#true} is VALID [2022-02-20 20:01:03,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume !(1 == ~q_write_ev~0); {74507#true} is VALID [2022-02-20 20:01:03,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74507#true} {74507#true} #1391#return; {74507#true} is VALID [2022-02-20 20:01:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {74507#true} havoc ~__retres1~2; {74507#true} is VALID [2022-02-20 20:01:03,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74507#true} is VALID [2022-02-20 20:01:03,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} #res := ~__retres1~2; {74507#true} is VALID [2022-02-20 20:01:03,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,104 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {74507#true} {74507#true} #1393#return; {74507#true} is VALID [2022-02-20 20:01:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {74507#true} havoc ~__retres1~2; {74507#true} is VALID [2022-02-20 20:01:03,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74573#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:03,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {74573#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {74573#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:03,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {74573#(= ~p_dw_st~0 0)} assume true; {74573#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:03,116 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {74573#(= ~p_dw_st~0 0)} {74549#(not (= ~p_dw_st~0 0))} #1393#return; {74508#false} is VALID [2022-02-20 20:01:03,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {74507#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {74507#true} is VALID [2022-02-20 20:01:03,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {74507#true} is VALID [2022-02-20 20:01:03,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {74507#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {74509#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {74509#(= ~q_read_ev~0 2)} call update_channels1(); {74555#(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 20:01:03,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {74555#(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); {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:03,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:03,119 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74556#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {74509#(= ~q_read_ev~0 2)} #1385#return; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {74509#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {74509#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {74509#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {74509#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {74509#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:03,121 INFO L272 TraceCheckUtils]: 12: Hoare triple {74509#(= ~q_read_ev~0 2)} call fire_delta_events1(); {74557#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:03,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {74557#(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); {74507#true} is VALID [2022-02-20 20:01:03,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {74507#true} assume !(0 == ~q_write_ev~0); {74507#true} is VALID [2022-02-20 20:01:03,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,122 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {74507#true} {74509#(= ~q_read_ev~0 2)} #1387#return; {74507#true} is VALID [2022-02-20 20:01:03,122 INFO L272 TraceCheckUtils]: 17: Hoare triple {74507#true} call activate_threads1(); {74558#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:03,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {74558#(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; {74507#true} is VALID [2022-02-20 20:01:03,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {74507#true} call #t~ret8 := is_do_write_p_triggered(); {74507#true} is VALID [2022-02-20 20:01:03,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {74507#true} havoc ~__retres1~0; {74507#true} is VALID [2022-02-20 20:01:03,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {74507#true} assume !(1 == ~p_dw_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {74507#true} assume !(2 == ~p_dw_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {74507#true} ~__retres1~0 := 0; {74507#true} is VALID [2022-02-20 20:01:03,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {74507#true} #res := ~__retres1~0; {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {74507#true} {74507#true} #1381#return; {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {74507#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {74507#true} assume !(0 != ~tmp~1); {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L272 TraceCheckUtils]: 29: Hoare triple {74507#true} call #t~ret9 := is_do_read_c_triggered(); {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {74507#true} havoc ~__retres1~1; {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {74507#true} assume !(1 == ~c_dr_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {74507#true} assume !(2 == ~c_dr_pc~0); {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {74507#true} ~__retres1~1 := 0; {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {74507#true} #res := ~__retres1~1; {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {74507#true} {74507#true} #1383#return; {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {74507#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {74507#true} assume !(0 != ~tmp___0~1); {74507#true} is VALID [2022-02-20 20:01:03,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,126 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {74507#true} {74507#true} #1389#return; {74507#true} is VALID [2022-02-20 20:01:03,126 INFO L272 TraceCheckUtils]: 41: Hoare triple {74507#true} call reset_delta_events1(); {74557#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:03,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {74557#(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); {74507#true} is VALID [2022-02-20 20:01:03,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {74507#true} assume !(1 == ~q_write_ev~0); {74507#true} is VALID [2022-02-20 20:01:03,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {74507#true} {74507#true} #1391#return; {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {74507#true} assume !false; {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {74507#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; {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {74507#true} assume !false; {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L272 TraceCheckUtils]: 49: Hoare triple {74507#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {74507#true} havoc ~__retres1~2; {74507#true} is VALID [2022-02-20 20:01:03,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {74507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {74507#true} #res := ~__retres1~2; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {74507#true} assume true; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {74507#true} {74507#true} #1393#return; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L290 TraceCheckUtils]: 55: Hoare triple {74507#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; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {74507#true} assume 0 != eval1_~tmp___1~0#1; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {74507#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; {74507#true} is VALID [2022-02-20 20:01:03,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {74507#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; {74507#true} is VALID [2022-02-20 20:01:03,129 INFO L290 TraceCheckUtils]: 59: Hoare triple {74507#true} assume 0 == ~p_dw_pc~0; {74507#true} is VALID [2022-02-20 20:01:03,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {74507#true} assume !false; {74507#true} is VALID [2022-02-20 20:01:03,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {74507#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {74549#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:03,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {74549#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {74549#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:03,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {74549#(not (= ~p_dw_st~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; {74549#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:03,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {74549#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {74549#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:03,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {74549#(not (= ~p_dw_st~0 0))} assume !false; {74549#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:03,131 INFO L272 TraceCheckUtils]: 66: Hoare triple {74549#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {74507#true} is VALID [2022-02-20 20:01:03,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {74507#true} havoc ~__retres1~2; {74507#true} is VALID [2022-02-20 20:01:03,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {74507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74573#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:03,132 INFO L290 TraceCheckUtils]: 69: Hoare triple {74573#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {74573#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:03,132 INFO L290 TraceCheckUtils]: 70: Hoare triple {74573#(= ~p_dw_st~0 0)} assume true; {74573#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:03,132 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74573#(= ~p_dw_st~0 0)} {74549#(not (= ~p_dw_st~0 0))} #1393#return; {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 72: Hoare triple {74508#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; {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 73: Hoare triple {74508#false} assume 0 != eval1_~tmp___1~0#1; {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 74: Hoare triple {74508#false} 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; {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 75: Hoare triple {74508#false} 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; {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 76: Hoare triple {74508#false} assume !(0 == ~p_dw_pc~0); {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 77: Hoare triple {74508#false} assume 1 == ~p_dw_pc~0; {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 78: Hoare triple {74508#false} assume !(0 == ~q_free~0); {74508#false} is VALID [2022-02-20 20:01:03,133 INFO L290 TraceCheckUtils]: 79: Hoare triple {74508#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; {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 80: Hoare triple {74508#false} assume !false; {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 81: Hoare triple {74508#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 82: Hoare triple {74508#false} assume { :end_inline_do_write_p } true; {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 83: Hoare triple {74508#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; {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 84: Hoare triple {74508#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; {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 85: Hoare triple {74508#false} assume !(0 == ~c_dr_pc~0); {74508#false} is VALID [2022-02-20 20:01:03,134 INFO L290 TraceCheckUtils]: 86: Hoare triple {74508#false} assume 2 == ~c_dr_pc~0; {74508#false} is VALID [2022-02-20 20:01:03,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {74508#false} do_read_c_~a~0#1 := ~a_t~0; {74508#false} is VALID [2022-02-20 20:01:03,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {74508#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; {74508#false} is VALID [2022-02-20 20:01:03,135 INFO L290 TraceCheckUtils]: 89: Hoare triple {74508#false} assume !(~p_last_write~0 == ~c_last_read~0); {74508#false} is VALID [2022-02-20 20:01:03,135 INFO L272 TraceCheckUtils]: 90: Hoare triple {74508#false} call error1(); {74508#false} is VALID [2022-02-20 20:01:03,135 INFO L290 TraceCheckUtils]: 91: Hoare triple {74508#false} assume !false; {74508#false} is VALID [2022-02-20 20:01:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:01:03,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:03,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028294544] [2022-02-20 20:01:03,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028294544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:03,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:03,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:03,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907096601] [2022-02-20 20:01:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:03,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:03,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:03,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:03,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:03,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:03,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:03,194 INFO L87 Difference]: Start difference. First operand 1731 states and 2233 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)