./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9629d1cdaf2a4c1ffb7c786f584a153b15eed3823334fbbe8ec635b18d57c1af --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:12,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:12,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:12,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:12,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:12,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:12,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:12,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:12,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:12,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:12,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:12,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:12,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:12,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:12,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:12,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:12,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:12,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:12,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:12,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:12,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:12,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:12,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:12,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:12,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:12,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:12,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:12,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:12,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:12,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:12,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:12,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:12,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:12,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:12,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:12,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:12,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:12,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:12,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:12,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:12,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:12,801 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:12,830 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:12,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:12,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:12,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:12,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:12,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:12,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:12,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:12,841 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:12,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:12,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:12,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:12,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:12,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:12,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:12,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:12,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:12,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:12,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:12,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:12,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:12,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:12,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:12,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:12,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:12,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:12,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:12,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:12,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:12,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:12,846 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:12,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:12,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:12,847 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 -> 9629d1cdaf2a4c1ffb7c786f584a153b15eed3823334fbbe8ec635b18d57c1af [2022-02-20 20:00:13,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:13,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:13,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:13,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:13,125 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:13,126 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-2.c [2022-02-20 20:00:13,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258c750a7/68c0bc45ee984d488589236f9113e03f/FLAG63a4d5506 [2022-02-20 20:00:13,599 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:13,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c [2022-02-20 20:00:13,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258c750a7/68c0bc45ee984d488589236f9113e03f/FLAG63a4d5506 [2022-02-20 20:00:13,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258c750a7/68c0bc45ee984d488589236f9113e03f [2022-02-20 20:00:13,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:13,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:13,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:13,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:13,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:13,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:13" (1/1) ... [2022-02-20 20:00:13,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2110aa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:13, skipping insertion in model container [2022-02-20 20:00:13,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:13" (1/1) ... [2022-02-20 20:00:13,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:13,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:14,120 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-2.c[911,924] [2022-02-20 20:00:14,201 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-2.c[8416,8429] [2022-02-20 20:00:14,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:14,273 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:14,283 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-2.c[911,924] [2022-02-20 20:00:14,309 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-2.c[8416,8429] [2022-02-20 20:00:14,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:14,398 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:14,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:14 WrapperNode [2022-02-20 20:00:14,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:14,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:14,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:14,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:14,407 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:14" (1/1) ... [2022-02-20 20:00:14,421 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:14" (1/1) ... [2022-02-20 20:00:14,492 INFO L137 Inliner]: procedures = 69, calls = 83, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 793 [2022-02-20 20:00:14,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:14,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:14,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:14,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:14,523 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:14" (1/1) ... [2022-02-20 20:00:14,524 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:14" (1/1) ... [2022-02-20 20:00:14,533 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:14" (1/1) ... [2022-02-20 20:00:14,534 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:14" (1/1) ... [2022-02-20 20:00:14,546 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:14" (1/1) ... [2022-02-20 20:00:14,566 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:14" (1/1) ... [2022-02-20 20:00:14,577 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:14" (1/1) ... [2022-02-20 20:00:14,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:14,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:14,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:14,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:14,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:14" (1/1) ... [2022-02-20 20:00:14,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:14,624 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:14,650 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:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:14,673 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:14,673 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:14,675 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:14,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:14,679 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 20:00:14,679 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 20:00:14,839 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:14,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:15,590 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:15,591 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:15,657 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:15,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:15,677 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 20:00:15,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:15 BoogieIcfgContainer [2022-02-20 20:00:15,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:15,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:15,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:15,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:15,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:13" (1/3) ... [2022-02-20 20:00:15,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c413ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:15, skipping insertion in model container [2022-02-20 20:00:15,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:14" (2/3) ... [2022-02-20 20:00:15,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c413ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:15, skipping insertion in model container [2022-02-20 20:00:15,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:15" (3/3) ... [2022-02-20 20:00:15,691 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-2.c [2022-02-20 20:00:15,695 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:15,696 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:15,739 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:15,746 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:15,747 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 325 states have (on average 1.6184615384615384) internal successors, (526), 333 states have internal predecessors, (526), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 20:00:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:15,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:15,790 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:15,790 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1097425506, now seen corresponding path program 1 times [2022-02-20 20:00:15,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:15,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956586015] [2022-02-20 20:00:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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); {385#true} is VALID [2022-02-20 20:00:16,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {387#(= 1 ~c_dr_i~0)} #1414#return; {387#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#(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; {385#true} is VALID [2022-02-20 20:00:16,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {385#true} is VALID [2022-02-20 20:00:16,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {386#false} #1416#return; {386#false} is VALID [2022-02-20 20:00:16,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#true} havoc ~__retres1~0; {385#true} is VALID [2022-02-20 20:00:16,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume 1 == ~p_dw_pc~0; {385#true} is VALID [2022-02-20 20:00:16,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {385#true} is VALID [2022-02-20 20:00:16,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {385#true} #res := ~__retres1~0; {385#true} is VALID [2022-02-20 20:00:16,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,163 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {385#true} {385#true} #1410#return; {385#true} is VALID [2022-02-20 20:00:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#true} havoc ~__retres1~1; {385#true} is VALID [2022-02-20 20:00:16,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume 1 == ~c_dr_pc~0; {385#true} is VALID [2022-02-20 20:00:16,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {385#true} is VALID [2022-02-20 20:00:16,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {385#true} #res := ~__retres1~1; {385#true} is VALID [2022-02-20 20:00:16,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,170 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {385#true} {385#true} #1412#return; {385#true} is VALID [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#(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; {385#true} is VALID [2022-02-20 20:00:16,171 INFO L272 TraceCheckUtils]: 1: Hoare triple {385#true} call #t~ret8 := is_do_write_p_triggered(); {385#true} is VALID [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} havoc ~__retres1~0; {385#true} is VALID [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {385#true} assume 1 == ~p_dw_pc~0; {385#true} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {385#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {385#true} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} #res := ~__retres1~0; {385#true} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,172 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {385#true} {385#true} #1410#return; {385#true} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {385#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {385#true} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {385#true} is VALID [2022-02-20 20:00:16,173 INFO L272 TraceCheckUtils]: 10: Hoare triple {385#true} call #t~ret9 := is_do_read_c_triggered(); {385#true} is VALID [2022-02-20 20:00:16,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {385#true} havoc ~__retres1~1; {385#true} is VALID [2022-02-20 20:00:16,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {385#true} assume 1 == ~c_dr_pc~0; {385#true} is VALID [2022-02-20 20:00:16,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {385#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {385#true} is VALID [2022-02-20 20:00:16,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {385#true} #res := ~__retres1~1; {385#true} is VALID [2022-02-20 20:00:16,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,174 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {385#true} {385#true} #1412#return; {385#true} is VALID [2022-02-20 20:00:16,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {385#true} is VALID [2022-02-20 20:00:16,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {385#true} assume !(0 != ~tmp___0~1); {385#true} is VALID [2022-02-20 20:00:16,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,174 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {385#true} {386#false} #1418#return; {386#false} is VALID [2022-02-20 20:00:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#(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; {385#true} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {385#true} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {386#false} #1420#return; {386#false} is VALID [2022-02-20 20:00:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#true} havoc ~__retres1~2; {385#true} is VALID [2022-02-20 20:00:16,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {385#true} is VALID [2022-02-20 20:00:16,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} #res := ~__retres1~2; {385#true} is VALID [2022-02-20 20:00:16,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,202 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {385#true} {386#false} #1422#return; {386#false} is VALID [2022-02-20 20:00:16,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#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; {385#true} is VALID [2022-02-20 20:00:16,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {385#true} is VALID [2022-02-20 20:00:16,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {387#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:16,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#(= 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; {387#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:16,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {387#(= 1 ~c_dr_i~0)} call update_channels1(); {425#(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:16,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#(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); {385#true} is VALID [2022-02-20 20:00:16,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,207 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {385#true} {387#(= 1 ~c_dr_i~0)} #1414#return; {387#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:16,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {387#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:16,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {387#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:16,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {387#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {386#false} is VALID [2022-02-20 20:00:16,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume { :end_inline_init_threads1 } true; {386#false} is VALID [2022-02-20 20:00:16,210 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call fire_delta_events1(); {426#(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:16,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {426#(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; {385#true} is VALID [2022-02-20 20:00:16,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {385#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {385#true} is VALID [2022-02-20 20:00:16,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,211 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {385#true} {386#false} #1416#return; {386#false} is VALID [2022-02-20 20:00:16,211 INFO L272 TraceCheckUtils]: 17: Hoare triple {386#false} call activate_threads1(); {427#(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:16,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {427#(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; {385#true} is VALID [2022-02-20 20:00:16,212 INFO L272 TraceCheckUtils]: 19: Hoare triple {385#true} call #t~ret8 := is_do_write_p_triggered(); {385#true} is VALID [2022-02-20 20:00:16,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {385#true} havoc ~__retres1~0; {385#true} is VALID [2022-02-20 20:00:16,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {385#true} assume 1 == ~p_dw_pc~0; {385#true} is VALID [2022-02-20 20:00:16,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {385#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {385#true} is VALID [2022-02-20 20:00:16,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {385#true} #res := ~__retres1~0; {385#true} is VALID [2022-02-20 20:00:16,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,213 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {385#true} {385#true} #1410#return; {385#true} is VALID [2022-02-20 20:00:16,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {385#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {385#true} is VALID [2022-02-20 20:00:16,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {385#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {385#true} is VALID [2022-02-20 20:00:16,213 INFO L272 TraceCheckUtils]: 28: Hoare triple {385#true} call #t~ret9 := is_do_read_c_triggered(); {385#true} is VALID [2022-02-20 20:00:16,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {385#true} havoc ~__retres1~1; {385#true} is VALID [2022-02-20 20:00:16,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {385#true} assume 1 == ~c_dr_pc~0; {385#true} is VALID [2022-02-20 20:00:16,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {385#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {385#true} is VALID [2022-02-20 20:00:16,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {385#true} #res := ~__retres1~1; {385#true} is VALID [2022-02-20 20:00:16,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,214 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {385#true} {385#true} #1412#return; {385#true} is VALID [2022-02-20 20:00:16,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {385#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {385#true} is VALID [2022-02-20 20:00:16,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {385#true} assume !(0 != ~tmp___0~1); {385#true} is VALID [2022-02-20 20:00:16,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,215 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {385#true} {386#false} #1418#return; {386#false} is VALID [2022-02-20 20:00:16,215 INFO L272 TraceCheckUtils]: 39: Hoare triple {386#false} call reset_delta_events1(); {426#(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:16,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {426#(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; {385#true} is VALID [2022-02-20 20:00:16,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {385#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {385#true} is VALID [2022-02-20 20:00:16,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,216 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {385#true} {386#false} #1420#return; {386#false} is VALID [2022-02-20 20:00:16,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-02-20 20:00:16,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {386#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; {386#false} is VALID [2022-02-20 20:00:16,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-02-20 20:00:16,217 INFO L272 TraceCheckUtils]: 47: Hoare triple {386#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {385#true} is VALID [2022-02-20 20:00:16,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {385#true} havoc ~__retres1~2; {385#true} is VALID [2022-02-20 20:00:16,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {385#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {385#true} is VALID [2022-02-20 20:00:16,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {385#true} #res := ~__retres1~2; {385#true} is VALID [2022-02-20 20:00:16,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {385#true} assume true; {385#true} is VALID [2022-02-20 20:00:16,220 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {385#true} {386#false} #1422#return; {386#false} is VALID [2022-02-20 20:00:16,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {386#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; {386#false} is VALID [2022-02-20 20:00:16,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {386#false} assume 0 != eval1_~tmp___1~0#1; {386#false} is VALID [2022-02-20 20:00:16,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {386#false} assume !(0 == ~p_dw_st~0); {386#false} is VALID [2022-02-20 20:00:16,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {386#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; {386#false} is VALID [2022-02-20 20:00:16,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {386#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; {386#false} is VALID [2022-02-20 20:00:16,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {386#false} assume !(0 == ~c_dr_pc~0); {386#false} is VALID [2022-02-20 20:00:16,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {386#false} assume 2 == ~c_dr_pc~0; {386#false} is VALID [2022-02-20 20:00:16,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {386#false} do_read_c_~a~0#1 := ~a_t~0; {386#false} is VALID [2022-02-20 20:00:16,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {386#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; {386#false} is VALID [2022-02-20 20:00:16,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {386#false} assume !(~p_last_write~0 == ~c_last_read~0); {386#false} is VALID [2022-02-20 20:00:16,226 INFO L272 TraceCheckUtils]: 63: Hoare triple {386#false} call error1(); {386#false} is VALID [2022-02-20 20:00:16,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-02-20 20:00:16,227 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:16,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:16,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956586015] [2022-02-20 20:00:16,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956586015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:16,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:16,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:16,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755726023] [2022-02-20 20:00:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:16,237 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,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:16,242 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:16,301 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:16,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:16,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:16,332 INFO L87 Difference]: Start difference. First operand has 382 states, 325 states have (on average 1.6184615384615384) internal successors, (526), 333 states have internal predecessors, (526), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) 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:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:18,568 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2022-02-20 20:00:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:18,568 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:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:18,570 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:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2022-02-20 20:00:18,597 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:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2022-02-20 20:00:18,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1198 transitions. [2022-02-20 20:00:19,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1198 edges. 1198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:19,578 INFO L225 Difference]: With dead ends: 758 [2022-02-20 20:00:19,578 INFO L226 Difference]: Without dead ends: 389 [2022-02-20 20:00:19,586 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:19,589 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 596 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:19,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [609 Valid, 1552 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:00:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-02-20 20:00:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 371. [2022-02-20 20:00:19,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:19,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 371 states, 317 states have (on average 1.5299684542586751) internal successors, (485), 322 states have internal predecessors, (485), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:19,671 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 371 states, 317 states have (on average 1.5299684542586751) internal successors, (485), 322 states have internal predecessors, (485), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:19,672 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 371 states, 317 states have (on average 1.5299684542586751) internal successors, (485), 322 states have internal predecessors, (485), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,694 INFO L93 Difference]: Finished difference Result 389 states and 588 transitions. [2022-02-20 20:00:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 588 transitions. [2022-02-20 20:00:19,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 317 states have (on average 1.5299684542586751) internal successors, (485), 322 states have internal predecessors, (485), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 389 states. [2022-02-20 20:00:19,709 INFO L87 Difference]: Start difference. First operand has 371 states, 317 states have (on average 1.5299684542586751) internal successors, (485), 322 states have internal predecessors, (485), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 389 states. [2022-02-20 20:00:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,730 INFO L93 Difference]: Finished difference Result 389 states and 588 transitions. [2022-02-20 20:00:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 588 transitions. [2022-02-20 20:00:19,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:19,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 317 states have (on average 1.5299684542586751) internal successors, (485), 322 states have internal predecessors, (485), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 20:00:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 559 transitions. [2022-02-20 20:00:19,769 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 559 transitions. Word has length 65 [2022-02-20 20:00:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:19,770 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 559 transitions. [2022-02-20 20:00:19,770 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:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 559 transitions. [2022-02-20 20:00:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:19,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:19,773 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:19,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:19,774 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1810756380, now seen corresponding path program 1 times [2022-02-20 20:00:19,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:19,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014131709] [2022-02-20 20:00:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {2774#(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); {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:19,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:19,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2736#(= ~q_read_ev~0 2)} #1414#return; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {2776#(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; {2777#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:19,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2777#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:19,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2777#(= |old(~q_read_ev~0)| 0)} assume true; {2777#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:19,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2777#(= |old(~q_read_ev~0)| 0)} {2736#(= ~q_read_ev~0 2)} #1416#return; {2735#false} is VALID [2022-02-20 20:00:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {2734#true} havoc ~__retres1~0; {2734#true} is VALID [2022-02-20 20:00:19,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} assume 1 == ~p_dw_pc~0; {2734#true} is VALID [2022-02-20 20:00:19,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2734#true} is VALID [2022-02-20 20:00:19,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {2734#true} #res := ~__retres1~0; {2734#true} is VALID [2022-02-20 20:00:19,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,919 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2734#true} {2734#true} #1410#return; {2734#true} is VALID [2022-02-20 20:00:19,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {2734#true} havoc ~__retres1~1; {2734#true} is VALID [2022-02-20 20:00:19,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} assume 1 == ~c_dr_pc~0; {2734#true} is VALID [2022-02-20 20:00:19,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2734#true} is VALID [2022-02-20 20:00:19,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {2734#true} #res := ~__retres1~1; {2734#true} is VALID [2022-02-20 20:00:19,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,923 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2734#true} {2734#true} #1412#return; {2734#true} is VALID [2022-02-20 20:00:19,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {2778#(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; {2734#true} is VALID [2022-02-20 20:00:19,924 INFO L272 TraceCheckUtils]: 1: Hoare triple {2734#true} call #t~ret8 := is_do_write_p_triggered(); {2734#true} is VALID [2022-02-20 20:00:19,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} havoc ~__retres1~0; {2734#true} is VALID [2022-02-20 20:00:19,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {2734#true} assume 1 == ~p_dw_pc~0; {2734#true} is VALID [2022-02-20 20:00:19,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {2734#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2734#true} is VALID [2022-02-20 20:00:19,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {2734#true} #res := ~__retres1~0; {2734#true} is VALID [2022-02-20 20:00:19,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,925 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2734#true} {2734#true} #1410#return; {2734#true} is VALID [2022-02-20 20:00:19,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {2734#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2734#true} is VALID [2022-02-20 20:00:19,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {2734#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2734#true} is VALID [2022-02-20 20:00:19,926 INFO L272 TraceCheckUtils]: 10: Hoare triple {2734#true} call #t~ret9 := is_do_read_c_triggered(); {2734#true} is VALID [2022-02-20 20:00:19,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {2734#true} havoc ~__retres1~1; {2734#true} is VALID [2022-02-20 20:00:19,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {2734#true} assume 1 == ~c_dr_pc~0; {2734#true} is VALID [2022-02-20 20:00:19,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {2734#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2734#true} is VALID [2022-02-20 20:00:19,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {2734#true} #res := ~__retres1~1; {2734#true} is VALID [2022-02-20 20:00:19,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,927 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2734#true} {2734#true} #1412#return; {2734#true} is VALID [2022-02-20 20:00:19,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {2734#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2734#true} is VALID [2022-02-20 20:00:19,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {2734#true} assume !(0 != ~tmp___0~1); {2734#true} is VALID [2022-02-20 20:00:19,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,928 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2734#true} {2735#false} #1418#return; {2735#false} is VALID [2022-02-20 20:00:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {2776#(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; {2734#true} is VALID [2022-02-20 20:00:19,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2734#true} is VALID [2022-02-20 20:00:19,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2734#true} {2735#false} #1420#return; {2735#false} is VALID [2022-02-20 20:00:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {2734#true} havoc ~__retres1~2; {2734#true} is VALID [2022-02-20 20:00:19,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2734#true} is VALID [2022-02-20 20:00:19,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} #res := ~__retres1~2; {2734#true} is VALID [2022-02-20 20:00:19,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,939 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2734#true} {2735#false} #1422#return; {2735#false} is VALID [2022-02-20 20:00:19,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {2734#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; {2734#true} is VALID [2022-02-20 20:00:19,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {2734#true} is VALID [2022-02-20 20:00:19,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {2736#(= ~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; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {2736#(= ~q_read_ev~0 2)} call update_channels1(); {2774#(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:19,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {2774#(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); {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:19,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:19,943 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2775#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2736#(= ~q_read_ev~0 2)} #1414#return; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {2736#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {2736#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {2736#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {2736#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2736#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:19,952 INFO L272 TraceCheckUtils]: 12: Hoare triple {2736#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2776#(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:19,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {2776#(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; {2777#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:19,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {2777#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2777#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:19,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {2777#(= |old(~q_read_ev~0)| 0)} assume true; {2777#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:19,954 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2777#(= |old(~q_read_ev~0)| 0)} {2736#(= ~q_read_ev~0 2)} #1416#return; {2735#false} is VALID [2022-02-20 20:00:19,954 INFO L272 TraceCheckUtils]: 17: Hoare triple {2735#false} call activate_threads1(); {2778#(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:19,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {2778#(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; {2734#true} is VALID [2022-02-20 20:00:19,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {2734#true} call #t~ret8 := is_do_write_p_triggered(); {2734#true} is VALID [2022-02-20 20:00:19,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {2734#true} havoc ~__retres1~0; {2734#true} is VALID [2022-02-20 20:00:19,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {2734#true} assume 1 == ~p_dw_pc~0; {2734#true} is VALID [2022-02-20 20:00:19,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {2734#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2734#true} is VALID [2022-02-20 20:00:19,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {2734#true} #res := ~__retres1~0; {2734#true} is VALID [2022-02-20 20:00:19,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,955 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2734#true} {2734#true} #1410#return; {2734#true} is VALID [2022-02-20 20:00:19,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {2734#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2734#true} is VALID [2022-02-20 20:00:19,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {2734#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2734#true} is VALID [2022-02-20 20:00:19,956 INFO L272 TraceCheckUtils]: 28: Hoare triple {2734#true} call #t~ret9 := is_do_read_c_triggered(); {2734#true} is VALID [2022-02-20 20:00:19,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {2734#true} havoc ~__retres1~1; {2734#true} is VALID [2022-02-20 20:00:19,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {2734#true} assume 1 == ~c_dr_pc~0; {2734#true} is VALID [2022-02-20 20:00:19,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {2734#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2734#true} is VALID [2022-02-20 20:00:19,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {2734#true} #res := ~__retres1~1; {2734#true} is VALID [2022-02-20 20:00:19,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,957 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2734#true} {2734#true} #1412#return; {2734#true} is VALID [2022-02-20 20:00:19,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {2734#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2734#true} is VALID [2022-02-20 20:00:19,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {2734#true} assume !(0 != ~tmp___0~1); {2734#true} is VALID [2022-02-20 20:00:19,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,958 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2734#true} {2735#false} #1418#return; {2735#false} is VALID [2022-02-20 20:00:19,958 INFO L272 TraceCheckUtils]: 39: Hoare triple {2735#false} call reset_delta_events1(); {2776#(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:19,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {2776#(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; {2734#true} is VALID [2022-02-20 20:00:19,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {2734#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2734#true} is VALID [2022-02-20 20:00:19,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,959 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2734#true} {2735#false} #1420#return; {2735#false} is VALID [2022-02-20 20:00:19,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {2735#false} assume !false; {2735#false} is VALID [2022-02-20 20:00:19,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {2735#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; {2735#false} is VALID [2022-02-20 20:00:19,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {2735#false} assume !false; {2735#false} is VALID [2022-02-20 20:00:19,960 INFO L272 TraceCheckUtils]: 47: Hoare triple {2735#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2734#true} is VALID [2022-02-20 20:00:19,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {2734#true} havoc ~__retres1~2; {2734#true} is VALID [2022-02-20 20:00:19,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {2734#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2734#true} is VALID [2022-02-20 20:00:19,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {2734#true} #res := ~__retres1~2; {2734#true} is VALID [2022-02-20 20:00:19,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {2734#true} assume true; {2734#true} is VALID [2022-02-20 20:00:19,960 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2734#true} {2735#false} #1422#return; {2735#false} is VALID [2022-02-20 20:00:19,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {2735#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; {2735#false} is VALID [2022-02-20 20:00:19,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {2735#false} assume 0 != eval1_~tmp___1~0#1; {2735#false} is VALID [2022-02-20 20:00:19,961 INFO L290 TraceCheckUtils]: 55: Hoare triple {2735#false} assume !(0 == ~p_dw_st~0); {2735#false} is VALID [2022-02-20 20:00:19,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {2735#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; {2735#false} is VALID [2022-02-20 20:00:19,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {2735#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; {2735#false} is VALID [2022-02-20 20:00:19,962 INFO L290 TraceCheckUtils]: 58: Hoare triple {2735#false} assume !(0 == ~c_dr_pc~0); {2735#false} is VALID [2022-02-20 20:00:19,962 INFO L290 TraceCheckUtils]: 59: Hoare triple {2735#false} assume 2 == ~c_dr_pc~0; {2735#false} is VALID [2022-02-20 20:00:19,962 INFO L290 TraceCheckUtils]: 60: Hoare triple {2735#false} do_read_c_~a~0#1 := ~a_t~0; {2735#false} is VALID [2022-02-20 20:00:19,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {2735#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; {2735#false} is VALID [2022-02-20 20:00:19,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {2735#false} assume !(~p_last_write~0 == ~c_last_read~0); {2735#false} is VALID [2022-02-20 20:00:19,962 INFO L272 TraceCheckUtils]: 63: Hoare triple {2735#false} call error1(); {2735#false} is VALID [2022-02-20 20:00:19,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {2735#false} assume !false; {2735#false} is VALID [2022-02-20 20:00:19,963 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:19,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:19,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014131709] [2022-02-20 20:00:19,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014131709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:19,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:19,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:19,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587909741] [2022-02-20 20:00:19,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:19,966 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:19,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:19,966 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:20,011 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:20,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:20,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:20,012 INFO L87 Difference]: Start difference. First operand 371 states and 559 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:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,046 INFO L93 Difference]: Finished difference Result 626 states and 928 transitions. [2022-02-20 20:00:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:23,047 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:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:23,047 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:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 928 transitions. [2022-02-20 20:00:23,066 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:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 928 transitions. [2022-02-20 20:00:23,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 928 transitions. [2022-02-20 20:00:23,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 928 edges. 928 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:23,818 INFO L225 Difference]: With dead ends: 626 [2022-02-20 20:00:23,818 INFO L226 Difference]: Without dead ends: 522 [2022-02-20 20:00:23,819 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:23,820 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 989 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:23,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 1867 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-02-20 20:00:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 483. [2022-02-20 20:00:23,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:23,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand has 483 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 414 states have internal predecessors, (611), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:23,841 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand has 483 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 414 states have internal predecessors, (611), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:23,842 INFO L87 Difference]: Start difference. First operand 522 states. Second operand has 483 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 414 states have internal predecessors, (611), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,862 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2022-02-20 20:00:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 772 transitions. [2022-02-20 20:00:23,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:23,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:23,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 414 states have internal predecessors, (611), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 522 states. [2022-02-20 20:00:23,867 INFO L87 Difference]: Start difference. First operand has 483 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 414 states have internal predecessors, (611), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 522 states. [2022-02-20 20:00:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,898 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2022-02-20 20:00:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 772 transitions. [2022-02-20 20:00:23,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:23,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:23,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:23,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 407 states have (on average 1.5012285012285012) internal successors, (611), 414 states have internal predecessors, (611), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 20:00:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2022-02-20 20:00:23,922 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 65 [2022-02-20 20:00:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:23,922 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2022-02-20 20:00:23,922 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:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2022-02-20 20:00:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:23,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:23,924 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:23,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:23,924 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash -805322276, now seen corresponding path program 1 times [2022-02-20 20:00:23,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:23,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687473963] [2022-02-20 20:00:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:23,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {5383#(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); {5384#(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:23,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {5384#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5384#(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:23,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5384#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5345#(= ~q_write_ev~0 ~q_read_ev~0)} #1414#return; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {5384#(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); {5385#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:24,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {5385#(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; {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:24,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:24,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5345#(= ~q_write_ev~0 ~q_read_ev~0)} #1416#return; {5344#false} is VALID [2022-02-20 20:00:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#true} havoc ~__retres1~0; {5343#true} is VALID [2022-02-20 20:00:24,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#true} assume 1 == ~p_dw_pc~0; {5343#true} is VALID [2022-02-20 20:00:24,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5343#true} is VALID [2022-02-20 20:00:24,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#true} #res := ~__retres1~0; {5343#true} is VALID [2022-02-20 20:00:24,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,030 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5343#true} {5343#true} #1410#return; {5343#true} is VALID [2022-02-20 20:00:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#true} havoc ~__retres1~1; {5343#true} is VALID [2022-02-20 20:00:24,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#true} assume 1 == ~c_dr_pc~0; {5343#true} is VALID [2022-02-20 20:00:24,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5343#true} is VALID [2022-02-20 20:00:24,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#true} #res := ~__retres1~1; {5343#true} is VALID [2022-02-20 20:00:24,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,033 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5343#true} {5343#true} #1412#return; {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {5387#(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; {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L272 TraceCheckUtils]: 1: Hoare triple {5343#true} call #t~ret8 := is_do_write_p_triggered(); {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#true} havoc ~__retres1~0; {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#true} assume 1 == ~p_dw_pc~0; {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#true} #res := ~__retres1~0; {5343#true} is VALID [2022-02-20 20:00:24,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5343#true} {5343#true} #1410#return; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {5343#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {5343#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L272 TraceCheckUtils]: 10: Hoare triple {5343#true} call #t~ret9 := is_do_read_c_triggered(); {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {5343#true} havoc ~__retres1~1; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {5343#true} assume 1 == ~c_dr_pc~0; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {5343#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5343#true} is VALID [2022-02-20 20:00:24,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {5343#true} #res := ~__retres1~1; {5343#true} is VALID [2022-02-20 20:00:24,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,036 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5343#true} {5343#true} #1412#return; {5343#true} is VALID [2022-02-20 20:00:24,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {5343#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5343#true} is VALID [2022-02-20 20:00:24,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {5343#true} assume !(0 != ~tmp___0~1); {5343#true} is VALID [2022-02-20 20:00:24,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,036 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5343#true} {5344#false} #1418#return; {5344#false} is VALID [2022-02-20 20:00:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {5384#(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); {5343#true} is VALID [2022-02-20 20:00:24,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5343#true} is VALID [2022-02-20 20:00:24,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5343#true} {5344#false} #1420#return; {5344#false} is VALID [2022-02-20 20:00:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#true} havoc ~__retres1~2; {5343#true} is VALID [2022-02-20 20:00:24,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5343#true} is VALID [2022-02-20 20:00:24,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#true} #res := ~__retres1~2; {5343#true} is VALID [2022-02-20 20:00:24,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,050 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5343#true} {5344#false} #1422#return; {5344#false} is VALID [2022-02-20 20:00:24,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#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; {5343#true} is VALID [2022-02-20 20:00:24,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {5343#true} is VALID [2022-02-20 20:00:24,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {5345#(= ~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; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {5345#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5383#(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:24,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {5383#(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); {5384#(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:24,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {5384#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5384#(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:24,053 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5384#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5345#(= ~q_write_ev~0 ~q_read_ev~0)} #1414#return; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {5345#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {5345#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {5345#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {5345#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {5345#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,055 INFO L272 TraceCheckUtils]: 12: Hoare triple {5345#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5384#(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:24,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {5384#(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); {5385#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:24,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {5385#(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; {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:24,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:24,057 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5386#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5345#(= ~q_write_ev~0 ~q_read_ev~0)} #1416#return; {5344#false} is VALID [2022-02-20 20:00:24,057 INFO L272 TraceCheckUtils]: 17: Hoare triple {5344#false} call activate_threads1(); {5387#(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:24,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {5387#(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; {5343#true} is VALID [2022-02-20 20:00:24,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {5343#true} call #t~ret8 := is_do_write_p_triggered(); {5343#true} is VALID [2022-02-20 20:00:24,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {5343#true} havoc ~__retres1~0; {5343#true} is VALID [2022-02-20 20:00:24,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {5343#true} assume 1 == ~p_dw_pc~0; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {5343#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {5343#true} #res := ~__retres1~0; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5343#true} {5343#true} #1410#return; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {5343#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5343#true} is VALID [2022-02-20 20:00:24,058 INFO L272 TraceCheckUtils]: 28: Hoare triple {5343#true} call #t~ret9 := is_do_read_c_triggered(); {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {5343#true} havoc ~__retres1~1; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {5343#true} assume 1 == ~c_dr_pc~0; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {5343#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {5343#true} #res := ~__retres1~1; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5343#true} {5343#true} #1412#return; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {5343#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5343#true} is VALID [2022-02-20 20:00:24,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {5343#true} assume !(0 != ~tmp___0~1); {5343#true} is VALID [2022-02-20 20:00:24,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,060 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5343#true} {5344#false} #1418#return; {5344#false} is VALID [2022-02-20 20:00:24,060 INFO L272 TraceCheckUtils]: 39: Hoare triple {5344#false} call reset_delta_events1(); {5384#(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:24,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {5384#(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); {5343#true} is VALID [2022-02-20 20:00:24,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {5343#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5343#true} is VALID [2022-02-20 20:00:24,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,060 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5343#true} {5344#false} #1420#return; {5344#false} is VALID [2022-02-20 20:00:24,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {5344#false} assume !false; {5344#false} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {5344#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; {5344#false} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {5344#false} assume !false; {5344#false} is VALID [2022-02-20 20:00:24,061 INFO L272 TraceCheckUtils]: 47: Hoare triple {5344#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5343#true} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {5343#true} havoc ~__retres1~2; {5343#true} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {5343#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5343#true} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {5343#true} #res := ~__retres1~2; {5343#true} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {5343#true} assume true; {5343#true} is VALID [2022-02-20 20:00:24,061 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5343#true} {5344#false} #1422#return; {5344#false} is VALID [2022-02-20 20:00:24,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {5344#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; {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {5344#false} assume 0 != eval1_~tmp___1~0#1; {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {5344#false} assume !(0 == ~p_dw_st~0); {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {5344#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; {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {5344#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; {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {5344#false} assume !(0 == ~c_dr_pc~0); {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {5344#false} assume 2 == ~c_dr_pc~0; {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {5344#false} do_read_c_~a~0#1 := ~a_t~0; {5344#false} is VALID [2022-02-20 20:00:24,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {5344#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; {5344#false} is VALID [2022-02-20 20:00:24,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {5344#false} assume !(~p_last_write~0 == ~c_last_read~0); {5344#false} is VALID [2022-02-20 20:00:24,063 INFO L272 TraceCheckUtils]: 63: Hoare triple {5344#false} call error1(); {5344#false} is VALID [2022-02-20 20:00:24,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {5344#false} assume !false; {5344#false} is VALID [2022-02-20 20:00:24,063 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:24,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:24,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687473963] [2022-02-20 20:00:24,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687473963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:24,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:24,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:24,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905540887] [2022-02-20 20:00:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:24,064 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:24,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:24,065 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:24,104 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:24,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:24,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:24,105 INFO L87 Difference]: Start difference. First operand 483 states and 716 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:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,725 INFO L93 Difference]: Finished difference Result 880 states and 1281 transitions. [2022-02-20 20:00:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:27,726 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:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:27,726 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:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 958 transitions. [2022-02-20 20:00:27,739 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:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 958 transitions. [2022-02-20 20:00:27,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 958 transitions. [2022-02-20 20:00:28,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 958 edges. 958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:28,547 INFO L225 Difference]: With dead ends: 880 [2022-02-20 20:00:28,548 INFO L226 Difference]: Without dead ends: 671 [2022-02-20 20:00:28,549 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:28,550 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 1070 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:28,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1099 Valid, 2278 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:00:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-02-20 20:00:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 595. [2022-02-20 20:00:28,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:28,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 671 states. Second operand has 595 states, 497 states have (on average 1.4808853118712273) internal successors, (736), 506 states have internal predecessors, (736), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:28,577 INFO L74 IsIncluded]: Start isIncluded. First operand 671 states. Second operand has 595 states, 497 states have (on average 1.4808853118712273) internal successors, (736), 506 states have internal predecessors, (736), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:28,579 INFO L87 Difference]: Start difference. First operand 671 states. Second operand has 595 states, 497 states have (on average 1.4808853118712273) internal successors, (736), 506 states have internal predecessors, (736), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,606 INFO L93 Difference]: Finished difference Result 671 states and 989 transitions. [2022-02-20 20:00:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 989 transitions. [2022-02-20 20:00:28,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:28,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:28,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 497 states have (on average 1.4808853118712273) internal successors, (736), 506 states have internal predecessors, (736), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) Second operand 671 states. [2022-02-20 20:00:28,612 INFO L87 Difference]: Start difference. First operand has 595 states, 497 states have (on average 1.4808853118712273) internal successors, (736), 506 states have internal predecessors, (736), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) Second operand 671 states. [2022-02-20 20:00:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,649 INFO L93 Difference]: Finished difference Result 671 states and 989 transitions. [2022-02-20 20:00:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 989 transitions. [2022-02-20 20:00:28,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:28,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:28,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:28,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 497 states have (on average 1.4808853118712273) internal successors, (736), 506 states have internal predecessors, (736), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2022-02-20 20:00:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 875 transitions. [2022-02-20 20:00:28,681 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 875 transitions. Word has length 65 [2022-02-20 20:00:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:28,681 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 875 transitions. [2022-02-20 20:00:28,681 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:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 875 transitions. [2022-02-20 20:00:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:28,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:28,685 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:28,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:28,685 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:28,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1461058910, now seen corresponding path program 1 times [2022-02-20 20:00:28,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:28,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697027750] [2022-02-20 20:00:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {8786#(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); {8787#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:28,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {8787#(not (= |old(~q_req_up~0)| 1))} assume true; {8787#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:28,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8787#(not (= |old(~q_req_up~0)| 1))} {8747#(= ~q_req_up~0 ~p_dw_pc~0)} #1414#return; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {8788#(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); {8744#true} is VALID [2022-02-20 20:00:28,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {8744#true} assume !(0 == ~q_write_ev~0); {8744#true} is VALID [2022-02-20 20:00:28,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8744#true} {8751#(not (= ~p_dw_pc~0 1))} #1416#return; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#true} havoc ~__retres1~0; {8744#true} is VALID [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {8744#true} assume 1 == ~p_dw_pc~0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,837 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} {8744#true} #1410#return; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#true} havoc ~__retres1~1; {8744#true} is VALID [2022-02-20 20:00:28,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {8744#true} assume 1 == ~c_dr_pc~0; {8744#true} is VALID [2022-02-20 20:00:28,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {8744#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8744#true} is VALID [2022-02-20 20:00:28,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {8744#true} #res := ~__retres1~1; {8744#true} is VALID [2022-02-20 20:00:28,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,844 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8744#true} {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} #1412#return; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {8789#(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; {8744#true} is VALID [2022-02-20 20:00:28,844 INFO L272 TraceCheckUtils]: 1: Hoare triple {8744#true} call #t~ret8 := is_do_write_p_triggered(); {8744#true} is VALID [2022-02-20 20:00:28,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {8744#true} havoc ~__retres1~0; {8744#true} is VALID [2022-02-20 20:00:28,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {8744#true} assume 1 == ~p_dw_pc~0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,847 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} {8744#true} #1410#return; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,848 INFO L272 TraceCheckUtils]: 10: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {8744#true} is VALID [2022-02-20 20:00:28,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {8744#true} havoc ~__retres1~1; {8744#true} is VALID [2022-02-20 20:00:28,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {8744#true} assume 1 == ~c_dr_pc~0; {8744#true} is VALID [2022-02-20 20:00:28,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {8744#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8744#true} is VALID [2022-02-20 20:00:28,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {8744#true} #res := ~__retres1~1; {8744#true} is VALID [2022-02-20 20:00:28,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,851 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8744#true} {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} #1412#return; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume !(0 != ~tmp___0~1); {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,860 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} {8751#(not (= ~p_dw_pc~0 1))} #1418#return; {8745#false} is VALID [2022-02-20 20:00:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {8788#(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); {8744#true} is VALID [2022-02-20 20:00:28,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {8744#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8744#true} is VALID [2022-02-20 20:00:28,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8744#true} {8745#false} #1420#return; {8745#false} is VALID [2022-02-20 20:00:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#true} havoc ~__retres1~2; {8744#true} is VALID [2022-02-20 20:00:28,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {8744#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8744#true} is VALID [2022-02-20 20:00:28,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {8744#true} #res := ~__retres1~2; {8744#true} is VALID [2022-02-20 20:00:28,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,878 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8744#true} {8745#false} #1422#return; {8745#false} is VALID [2022-02-20 20:00:28,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#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; {8746#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:28,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {8746#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {8746#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:28,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {8746#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {8747#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:28,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {8747#(= ~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; {8747#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:28,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {8747#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {8786#(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:28,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {8786#(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); {8787#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:28,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {8787#(not (= |old(~q_req_up~0)| 1))} assume true; {8787#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:28,883 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8787#(not (= |old(~q_req_up~0)| 1))} {8747#(= ~q_req_up~0 ~p_dw_pc~0)} #1414#return; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {8751#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {8751#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {8751#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {8751#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,885 INFO L272 TraceCheckUtils]: 12: Hoare triple {8751#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {8788#(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:28,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {8788#(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); {8744#true} is VALID [2022-02-20 20:00:28,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {8744#true} assume !(0 == ~q_write_ev~0); {8744#true} is VALID [2022-02-20 20:00:28,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,886 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8744#true} {8751#(not (= ~p_dw_pc~0 1))} #1416#return; {8751#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:28,887 INFO L272 TraceCheckUtils]: 17: Hoare triple {8751#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {8789#(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:28,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {8789#(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; {8744#true} is VALID [2022-02-20 20:00:28,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {8744#true} call #t~ret8 := is_do_write_p_triggered(); {8744#true} is VALID [2022-02-20 20:00:28,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {8744#true} havoc ~__retres1~0; {8744#true} is VALID [2022-02-20 20:00:28,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {8744#true} assume 1 == ~p_dw_pc~0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,889 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} {8744#true} #1410#return; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,890 INFO L272 TraceCheckUtils]: 28: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {8744#true} is VALID [2022-02-20 20:00:28,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {8744#true} havoc ~__retres1~1; {8744#true} is VALID [2022-02-20 20:00:28,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {8744#true} assume 1 == ~c_dr_pc~0; {8744#true} is VALID [2022-02-20 20:00:28,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {8744#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8744#true} is VALID [2022-02-20 20:00:28,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {8744#true} #res := ~__retres1~1; {8744#true} is VALID [2022-02-20 20:00:28,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,891 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8744#true} {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} #1412#return; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume !(0 != ~tmp___0~1); {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:28,894 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8796#(= (+ (- 1) ~p_dw_pc~0) 0)} {8751#(not (= ~p_dw_pc~0 1))} #1418#return; {8745#false} is VALID [2022-02-20 20:00:28,894 INFO L272 TraceCheckUtils]: 39: Hoare triple {8745#false} call reset_delta_events1(); {8788#(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:28,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {8788#(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); {8744#true} is VALID [2022-02-20 20:00:28,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {8744#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8744#true} is VALID [2022-02-20 20:00:28,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,896 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8744#true} {8745#false} #1420#return; {8745#false} is VALID [2022-02-20 20:00:28,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2022-02-20 20:00:28,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {8745#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; {8745#false} is VALID [2022-02-20 20:00:28,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2022-02-20 20:00:28,896 INFO L272 TraceCheckUtils]: 47: Hoare triple {8745#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8744#true} is VALID [2022-02-20 20:00:28,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {8744#true} havoc ~__retres1~2; {8744#true} is VALID [2022-02-20 20:00:28,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {8744#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8744#true} is VALID [2022-02-20 20:00:28,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {8744#true} #res := ~__retres1~2; {8744#true} is VALID [2022-02-20 20:00:28,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {8744#true} assume true; {8744#true} is VALID [2022-02-20 20:00:28,897 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8744#true} {8745#false} #1422#return; {8745#false} is VALID [2022-02-20 20:00:28,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {8745#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; {8745#false} is VALID [2022-02-20 20:00:28,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {8745#false} assume 0 != eval1_~tmp___1~0#1; {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {8745#false} assume !(0 == ~p_dw_st~0); {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {8745#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; {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {8745#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; {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {8745#false} assume !(0 == ~c_dr_pc~0); {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {8745#false} assume 2 == ~c_dr_pc~0; {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {8745#false} do_read_c_~a~0#1 := ~a_t~0; {8745#false} is VALID [2022-02-20 20:00:28,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {8745#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; {8745#false} is VALID [2022-02-20 20:00:28,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {8745#false} assume !(~p_last_write~0 == ~c_last_read~0); {8745#false} is VALID [2022-02-20 20:00:28,899 INFO L272 TraceCheckUtils]: 63: Hoare triple {8745#false} call error1(); {8745#false} is VALID [2022-02-20 20:00:28,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2022-02-20 20:00:28,901 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:28,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:28,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697027750] [2022-02-20 20:00:28,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697027750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:28,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:28,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:28,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80592118] [2022-02-20 20:00:28,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:28,903 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:28,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:28,903 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:28,945 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:28,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:28,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:28,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:28,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:28,947 INFO L87 Difference]: Start difference. First operand 595 states and 875 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:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,205 INFO L93 Difference]: Finished difference Result 2141 states and 3072 transitions. [2022-02-20 20:00:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:35,206 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:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:35,206 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:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1363 transitions. [2022-02-20 20:00:35,222 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:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1363 transitions. [2022-02-20 20:00:35,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1363 transitions. [2022-02-20 20:00:36,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1363 edges. 1363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:36,502 INFO L225 Difference]: With dead ends: 2141 [2022-02-20 20:00:36,502 INFO L226 Difference]: Without dead ends: 1808 [2022-02-20 20:00:36,504 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:36,513 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 3003 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3022 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:36,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3022 Valid, 2617 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 20:00:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-02-20 20:00:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1648. [2022-02-20 20:00:36,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:36,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1808 states. Second operand has 1648 states, 1345 states have (on average 1.3992565055762083) internal successors, (1882), 1369 states have internal predecessors, (1882), 175 states have call successors, (175), 112 states have call predecessors, (175), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:36,601 INFO L74 IsIncluded]: Start isIncluded. First operand 1808 states. Second operand has 1648 states, 1345 states have (on average 1.3992565055762083) internal successors, (1882), 1369 states have internal predecessors, (1882), 175 states have call successors, (175), 112 states have call predecessors, (175), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:36,604 INFO L87 Difference]: Start difference. First operand 1808 states. Second operand has 1648 states, 1345 states have (on average 1.3992565055762083) internal successors, (1882), 1369 states have internal predecessors, (1882), 175 states have call successors, (175), 112 states have call predecessors, (175), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,752 INFO L93 Difference]: Finished difference Result 1808 states and 2476 transitions. [2022-02-20 20:00:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2476 transitions. [2022-02-20 20:00:36,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:36,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:36,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1345 states have (on average 1.3992565055762083) internal successors, (1882), 1369 states have internal predecessors, (1882), 175 states have call successors, (175), 112 states have call predecessors, (175), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) Second operand 1808 states. [2022-02-20 20:00:36,766 INFO L87 Difference]: Start difference. First operand has 1648 states, 1345 states have (on average 1.3992565055762083) internal successors, (1882), 1369 states have internal predecessors, (1882), 175 states have call successors, (175), 112 states have call predecessors, (175), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) Second operand 1808 states. [2022-02-20 20:00:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,907 INFO L93 Difference]: Finished difference Result 1808 states and 2476 transitions. [2022-02-20 20:00:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2476 transitions. [2022-02-20 20:00:36,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:36,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:36,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:36,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1345 states have (on average 1.3992565055762083) internal successors, (1882), 1369 states have internal predecessors, (1882), 175 states have call successors, (175), 112 states have call predecessors, (175), 126 states have return successors, (207), 169 states have call predecessors, (207), 171 states have call successors, (207) [2022-02-20 20:00:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2264 transitions. [2022-02-20 20:00:37,085 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2264 transitions. Word has length 65 [2022-02-20 20:00:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:37,085 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2264 transitions. [2022-02-20 20:00:37,085 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:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2264 transitions. [2022-02-20 20:00:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:37,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:37,087 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:37,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:37,087 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1639333971, now seen corresponding path program 1 times [2022-02-20 20:00:37,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:37,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235345790] [2022-02-20 20:00:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {17628#(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); {17588#true} is VALID [2022-02-20 20:00:37,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17588#true} {17588#true} #1414#return; {17588#true} is VALID [2022-02-20 20:00:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {17629#(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); {17588#true} is VALID [2022-02-20 20:00:37,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume !(0 == ~q_write_ev~0); {17588#true} is VALID [2022-02-20 20:00:37,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17588#true} {17588#true} #1416#return; {17588#true} is VALID [2022-02-20 20:00:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {17588#true} havoc ~__retres1~0; {17588#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume !(1 == ~p_dw_pc~0); {17588#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume !(2 == ~p_dw_pc~0); {17588#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {17588#true} ~__retres1~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {17588#true} #res := ~__retres1~0; {17588#true} is VALID [2022-02-20 20:00:37,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,176 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17588#true} {17588#true} #1410#return; {17588#true} is VALID [2022-02-20 20:00:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {17588#true} havoc ~__retres1~1; {17588#true} is VALID [2022-02-20 20:00:37,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume 1 == ~c_dr_pc~0; {17588#true} is VALID [2022-02-20 20:00:37,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17646#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 20:00:37,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {17646#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {17647#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:37,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {17647#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {17647#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:37,197 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17647#(<= 1 |is_do_read_c_triggered_#res|)} {17588#true} #1412#return; {17644#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:37,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {17630#(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; {17588#true} is VALID [2022-02-20 20:00:37,198 INFO L272 TraceCheckUtils]: 1: Hoare triple {17588#true} call #t~ret8 := is_do_write_p_triggered(); {17588#true} is VALID [2022-02-20 20:00:37,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} havoc ~__retres1~0; {17588#true} is VALID [2022-02-20 20:00:37,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {17588#true} assume !(1 == ~p_dw_pc~0); {17588#true} is VALID [2022-02-20 20:00:37,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {17588#true} assume !(2 == ~p_dw_pc~0); {17588#true} is VALID [2022-02-20 20:00:37,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {17588#true} ~__retres1~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {17588#true} #res := ~__retres1~0; {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {17588#true} {17588#true} #1410#return; {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {17588#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {17588#true} call #t~ret9 := is_do_read_c_triggered(); {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {17588#true} havoc ~__retres1~1; {17588#true} is VALID [2022-02-20 20:00:37,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {17588#true} assume 1 == ~c_dr_pc~0; {17588#true} is VALID [2022-02-20 20:00:37,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {17588#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17646#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 20:00:37,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {17646#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {17647#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:37,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {17647#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {17647#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:37,202 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17647#(<= 1 |is_do_read_c_triggered_#res|)} {17588#true} #1412#return; {17644#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:37,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {17644#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17645#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 20:00:37,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {17645#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {17589#false} is VALID [2022-02-20 20:00:37,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {17589#false} assume true; {17589#false} is VALID [2022-02-20 20:00:37,203 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17589#false} {17588#true} #1418#return; {17589#false} is VALID [2022-02-20 20:00:37,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {17629#(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); {17588#true} is VALID [2022-02-20 20:00:37,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17588#true} is VALID [2022-02-20 20:00:37,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17588#true} {17589#false} #1420#return; {17589#false} is VALID [2022-02-20 20:00:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:37,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {17588#true} havoc ~__retres1~2; {17588#true} is VALID [2022-02-20 20:00:37,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17588#true} is VALID [2022-02-20 20:00:37,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} #res := ~__retres1~2; {17588#true} is VALID [2022-02-20 20:00:37,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,215 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17588#true} {17589#false} #1422#return; {17589#false} is VALID [2022-02-20 20:00:37,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {17588#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; {17588#true} is VALID [2022-02-20 20:00:37,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {17588#true} is VALID [2022-02-20 20:00:37,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {17588#true} is VALID [2022-02-20 20:00:37,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {17588#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; {17588#true} is VALID [2022-02-20 20:00:37,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {17588#true} call update_channels1(); {17628#(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:37,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {17628#(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); {17588#true} is VALID [2022-02-20 20:00:37,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,217 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17588#true} {17588#true} #1414#return; {17588#true} is VALID [2022-02-20 20:00:37,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {17588#true} assume { :begin_inline_init_threads1 } true; {17588#true} is VALID [2022-02-20 20:00:37,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {17588#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {17588#true} assume { :end_inline_init_threads1 } true; {17588#true} is VALID [2022-02-20 20:00:37,218 INFO L272 TraceCheckUtils]: 12: Hoare triple {17588#true} call fire_delta_events1(); {17629#(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:37,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {17629#(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); {17588#true} is VALID [2022-02-20 20:00:37,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {17588#true} assume !(0 == ~q_write_ev~0); {17588#true} is VALID [2022-02-20 20:00:37,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,219 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17588#true} {17588#true} #1416#return; {17588#true} is VALID [2022-02-20 20:00:37,219 INFO L272 TraceCheckUtils]: 17: Hoare triple {17588#true} call activate_threads1(); {17630#(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:37,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {17630#(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; {17588#true} is VALID [2022-02-20 20:00:37,219 INFO L272 TraceCheckUtils]: 19: Hoare triple {17588#true} call #t~ret8 := is_do_write_p_triggered(); {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {17588#true} havoc ~__retres1~0; {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {17588#true} assume !(1 == ~p_dw_pc~0); {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {17588#true} assume !(2 == ~p_dw_pc~0); {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {17588#true} ~__retres1~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {17588#true} #res := ~__retres1~0; {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,220 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17588#true} {17588#true} #1410#return; {17588#true} is VALID [2022-02-20 20:00:37,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {17588#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17588#true} is VALID [2022-02-20 20:00:37,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {17588#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17588#true} is VALID [2022-02-20 20:00:37,221 INFO L272 TraceCheckUtils]: 29: Hoare triple {17588#true} call #t~ret9 := is_do_read_c_triggered(); {17588#true} is VALID [2022-02-20 20:00:37,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {17588#true} havoc ~__retres1~1; {17588#true} is VALID [2022-02-20 20:00:37,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {17588#true} assume 1 == ~c_dr_pc~0; {17588#true} is VALID [2022-02-20 20:00:37,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {17588#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17646#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 20:00:37,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {17646#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {17647#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:37,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {17647#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {17647#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 20:00:37,223 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17647#(<= 1 |is_do_read_c_triggered_#res|)} {17588#true} #1412#return; {17644#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:37,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {17644#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17645#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 20:00:37,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {17645#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {17589#false} is VALID [2022-02-20 20:00:37,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {17589#false} assume true; {17589#false} is VALID [2022-02-20 20:00:37,224 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17589#false} {17588#true} #1418#return; {17589#false} is VALID [2022-02-20 20:00:37,224 INFO L272 TraceCheckUtils]: 40: Hoare triple {17589#false} call reset_delta_events1(); {17629#(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:37,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {17629#(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); {17588#true} is VALID [2022-02-20 20:00:37,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {17588#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17588#true} is VALID [2022-02-20 20:00:37,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,225 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17588#true} {17589#false} #1420#return; {17589#false} is VALID [2022-02-20 20:00:37,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {17589#false} assume !false; {17589#false} is VALID [2022-02-20 20:00:37,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {17589#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; {17589#false} is VALID [2022-02-20 20:00:37,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {17589#false} assume !false; {17589#false} is VALID [2022-02-20 20:00:37,225 INFO L272 TraceCheckUtils]: 48: Hoare triple {17589#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17588#true} is VALID [2022-02-20 20:00:37,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {17588#true} havoc ~__retres1~2; {17588#true} is VALID [2022-02-20 20:00:37,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {17588#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17588#true} is VALID [2022-02-20 20:00:37,226 INFO L290 TraceCheckUtils]: 51: Hoare triple {17588#true} #res := ~__retres1~2; {17588#true} is VALID [2022-02-20 20:00:37,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-02-20 20:00:37,226 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17588#true} {17589#false} #1422#return; {17589#false} is VALID [2022-02-20 20:00:37,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {17589#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; {17589#false} is VALID [2022-02-20 20:00:37,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {17589#false} assume 0 != eval1_~tmp___1~0#1; {17589#false} is VALID [2022-02-20 20:00:37,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {17589#false} assume !(0 == ~p_dw_st~0); {17589#false} is VALID [2022-02-20 20:00:37,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {17589#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; {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {17589#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; {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {17589#false} assume !(0 == ~c_dr_pc~0); {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {17589#false} assume 2 == ~c_dr_pc~0; {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {17589#false} do_read_c_~a~0#1 := ~a_t~0; {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {17589#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; {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {17589#false} assume !(~p_last_write~0 == ~c_last_read~0); {17589#false} is VALID [2022-02-20 20:00:37,227 INFO L272 TraceCheckUtils]: 64: Hoare triple {17589#false} call error1(); {17589#false} is VALID [2022-02-20 20:00:37,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {17589#false} assume !false; {17589#false} is VALID [2022-02-20 20:00:37,228 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:37,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:37,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235345790] [2022-02-20 20:00:37,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235345790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:37,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:37,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:37,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273014266] [2022-02-20 20:00:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:37,230 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:37,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:37,231 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:37,269 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:37,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:37,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:37,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:37,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:37,271 INFO L87 Difference]: Start difference. First operand 1648 states and 2264 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:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,891 INFO L93 Difference]: Finished difference Result 3264 states and 4484 transitions. [2022-02-20 20:00:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:40,891 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,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:40,891 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:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 745 transitions. [2022-02-20 20:00:40,899 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:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 745 transitions. [2022-02-20 20:00:40,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 745 transitions. [2022-02-20 20:00:41,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 745 edges. 745 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:41,640 INFO L225 Difference]: With dead ends: 3264 [2022-02-20 20:00:41,640 INFO L226 Difference]: Without dead ends: 1884 [2022-02-20 20:00:41,642 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:41,643 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 693 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:41,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [695 Valid, 2219 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-02-20 20:00:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1718. [2022-02-20 20:00:41,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:41,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1884 states. Second operand has 1718 states, 1401 states have (on average 1.3832976445396146) internal successors, (1938), 1425 states have internal predecessors, (1938), 175 states have call successors, (175), 112 states have call predecessors, (175), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:41,736 INFO L74 IsIncluded]: Start isIncluded. First operand 1884 states. Second operand has 1718 states, 1401 states have (on average 1.3832976445396146) internal successors, (1938), 1425 states have internal predecessors, (1938), 175 states have call successors, (175), 112 states have call predecessors, (175), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:41,740 INFO L87 Difference]: Start difference. First operand 1884 states. Second operand has 1718 states, 1401 states have (on average 1.3832976445396146) internal successors, (1938), 1425 states have internal predecessors, (1938), 175 states have call successors, (175), 112 states have call predecessors, (175), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,880 INFO L93 Difference]: Finished difference Result 1884 states and 2579 transitions. [2022-02-20 20:00:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2579 transitions. [2022-02-20 20:00:41,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 1718 states, 1401 states have (on average 1.3832976445396146) internal successors, (1938), 1425 states have internal predecessors, (1938), 175 states have call successors, (175), 112 states have call predecessors, (175), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) Second operand 1884 states. [2022-02-20 20:00:41,893 INFO L87 Difference]: Start difference. First operand has 1718 states, 1401 states have (on average 1.3832976445396146) internal successors, (1938), 1425 states have internal predecessors, (1938), 175 states have call successors, (175), 112 states have call predecessors, (175), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) Second operand 1884 states. [2022-02-20 20:00:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:42,016 INFO L93 Difference]: Finished difference Result 1884 states and 2579 transitions. [2022-02-20 20:00:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2579 transitions. [2022-02-20 20:00:42,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:42,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:42,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:42,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1401 states have (on average 1.3832976445396146) internal successors, (1938), 1425 states have internal predecessors, (1938), 175 states have call successors, (175), 112 states have call predecessors, (175), 140 states have return successors, (221), 183 states have call predecessors, (221), 171 states have call successors, (221) [2022-02-20 20:00:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2334 transitions. [2022-02-20 20:00:42,158 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2334 transitions. Word has length 66 [2022-02-20 20:00:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:42,158 INFO L470 AbstractCegarLoop]: Abstraction has 1718 states and 2334 transitions. [2022-02-20 20:00:42,159 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:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2334 transitions. [2022-02-20 20:00:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:42,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:42,160 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:42,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:42,160 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 253130577, now seen corresponding path program 1 times [2022-02-20 20:00:42,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:42,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216438915] [2022-02-20 20:00:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {28137#(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); {28097#true} is VALID [2022-02-20 20:00:42,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28097#true} {28097#true} #1414#return; {28097#true} is VALID [2022-02-20 20:00:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {28138#(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); {28097#true} is VALID [2022-02-20 20:00:42,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume !(0 == ~q_write_ev~0); {28097#true} is VALID [2022-02-20 20:00:42,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28097#true} {28097#true} #1416#return; {28097#true} is VALID [2022-02-20 20:00:42,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {28097#true} havoc ~__retres1~0; {28097#true} is VALID [2022-02-20 20:00:42,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume !(1 == ~p_dw_pc~0); {28097#true} is VALID [2022-02-20 20:00:42,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} assume !(2 == ~p_dw_pc~0); {28097#true} is VALID [2022-02-20 20:00:42,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {28097#true} ~__retres1~0 := 0; {28155#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:42,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {28155#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:42,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:42,277 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {28097#true} #1410#return; {28147#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {28097#true} havoc ~__retres1~1; {28097#true} is VALID [2022-02-20 20:00:42,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume 1 == ~c_dr_pc~0; {28097#true} is VALID [2022-02-20 20:00:42,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {28097#true} is VALID [2022-02-20 20:00:42,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {28097#true} #res := ~__retres1~1; {28097#true} is VALID [2022-02-20 20:00:42,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,304 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28097#true} {28098#false} #1412#return; {28098#false} is VALID [2022-02-20 20:00:42,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {28139#(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; {28097#true} is VALID [2022-02-20 20:00:42,304 INFO L272 TraceCheckUtils]: 1: Hoare triple {28097#true} call #t~ret8 := is_do_write_p_triggered(); {28097#true} is VALID [2022-02-20 20:00:42,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} havoc ~__retres1~0; {28097#true} is VALID [2022-02-20 20:00:42,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {28097#true} assume !(1 == ~p_dw_pc~0); {28097#true} is VALID [2022-02-20 20:00:42,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {28097#true} assume !(2 == ~p_dw_pc~0); {28097#true} is VALID [2022-02-20 20:00:42,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {28097#true} ~__retres1~0 := 0; {28155#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:42,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {28155#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:42,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:42,306 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {28097#true} #1410#return; {28147#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:42,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {28147#(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; {28148#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:42,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {28148#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {28098#false} is VALID [2022-02-20 20:00:42,307 INFO L272 TraceCheckUtils]: 11: Hoare triple {28098#false} call #t~ret9 := is_do_read_c_triggered(); {28097#true} is VALID [2022-02-20 20:00:42,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {28097#true} havoc ~__retres1~1; {28097#true} is VALID [2022-02-20 20:00:42,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {28097#true} assume 1 == ~c_dr_pc~0; {28097#true} is VALID [2022-02-20 20:00:42,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {28097#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {28097#true} is VALID [2022-02-20 20:00:42,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {28097#true} #res := ~__retres1~1; {28097#true} is VALID [2022-02-20 20:00:42,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {28097#true} {28098#false} #1412#return; {28098#false} is VALID [2022-02-20 20:00:42,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {28098#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28098#false} is VALID [2022-02-20 20:00:42,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {28098#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {28098#false} is VALID [2022-02-20 20:00:42,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {28098#false} assume true; {28098#false} is VALID [2022-02-20 20:00:42,309 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28098#false} {28097#true} #1418#return; {28098#false} is VALID [2022-02-20 20:00:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {28138#(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); {28097#true} is VALID [2022-02-20 20:00:42,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {28097#true} is VALID [2022-02-20 20:00:42,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28097#true} {28098#false} #1420#return; {28098#false} is VALID [2022-02-20 20:00:42,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {28097#true} havoc ~__retres1~2; {28097#true} is VALID [2022-02-20 20:00:42,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28097#true} is VALID [2022-02-20 20:00:42,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} #res := ~__retres1~2; {28097#true} is VALID [2022-02-20 20:00:42,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,319 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28097#true} {28098#false} #1422#return; {28098#false} is VALID [2022-02-20 20:00:42,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {28097#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; {28097#true} is VALID [2022-02-20 20:00:42,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {28097#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {28097#true} is VALID [2022-02-20 20:00:42,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {28097#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {28097#true} is VALID [2022-02-20 20:00:42,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {28097#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; {28097#true} is VALID [2022-02-20 20:00:42,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {28097#true} call update_channels1(); {28137#(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:42,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {28137#(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); {28097#true} is VALID [2022-02-20 20:00:42,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,320 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28097#true} {28097#true} #1414#return; {28097#true} is VALID [2022-02-20 20:00:42,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {28097#true} assume { :begin_inline_init_threads1 } true; {28097#true} is VALID [2022-02-20 20:00:42,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {28097#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28097#true} is VALID [2022-02-20 20:00:42,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {28097#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28097#true} is VALID [2022-02-20 20:00:42,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {28097#true} assume { :end_inline_init_threads1 } true; {28097#true} is VALID [2022-02-20 20:00:42,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {28097#true} call fire_delta_events1(); {28138#(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:42,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {28138#(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); {28097#true} is VALID [2022-02-20 20:00:42,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {28097#true} assume !(0 == ~q_write_ev~0); {28097#true} is VALID [2022-02-20 20:00:42,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,322 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28097#true} {28097#true} #1416#return; {28097#true} is VALID [2022-02-20 20:00:42,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {28097#true} call activate_threads1(); {28139#(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:42,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {28139#(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; {28097#true} is VALID [2022-02-20 20:00:42,323 INFO L272 TraceCheckUtils]: 19: Hoare triple {28097#true} call #t~ret8 := is_do_write_p_triggered(); {28097#true} is VALID [2022-02-20 20:00:42,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {28097#true} havoc ~__retres1~0; {28097#true} is VALID [2022-02-20 20:00:42,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {28097#true} assume !(1 == ~p_dw_pc~0); {28097#true} is VALID [2022-02-20 20:00:42,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {28097#true} assume !(2 == ~p_dw_pc~0); {28097#true} is VALID [2022-02-20 20:00:42,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {28097#true} ~__retres1~0 := 0; {28155#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:42,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {28155#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:42,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:42,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28156#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {28097#true} #1410#return; {28147#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:42,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {28147#(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; {28148#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:42,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {28148#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {28098#false} is VALID [2022-02-20 20:00:42,326 INFO L272 TraceCheckUtils]: 29: Hoare triple {28098#false} call #t~ret9 := is_do_read_c_triggered(); {28097#true} is VALID [2022-02-20 20:00:42,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {28097#true} havoc ~__retres1~1; {28097#true} is VALID [2022-02-20 20:00:42,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {28097#true} assume 1 == ~c_dr_pc~0; {28097#true} is VALID [2022-02-20 20:00:42,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {28097#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {28097#true} is VALID [2022-02-20 20:00:42,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {28097#true} #res := ~__retres1~1; {28097#true} is VALID [2022-02-20 20:00:42,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,330 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {28097#true} {28098#false} #1412#return; {28098#false} is VALID [2022-02-20 20:00:42,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {28098#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28098#false} is VALID [2022-02-20 20:00:42,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {28098#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {28098#false} is VALID [2022-02-20 20:00:42,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {28098#false} assume true; {28098#false} is VALID [2022-02-20 20:00:42,331 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28098#false} {28097#true} #1418#return; {28098#false} is VALID [2022-02-20 20:00:42,331 INFO L272 TraceCheckUtils]: 40: Hoare triple {28098#false} call reset_delta_events1(); {28138#(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:42,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {28138#(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); {28097#true} is VALID [2022-02-20 20:00:42,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {28097#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {28097#true} is VALID [2022-02-20 20:00:42,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,331 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {28097#true} {28098#false} #1420#return; {28098#false} is VALID [2022-02-20 20:00:42,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {28098#false} assume !false; {28098#false} is VALID [2022-02-20 20:00:42,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {28098#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; {28098#false} is VALID [2022-02-20 20:00:42,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {28098#false} assume !false; {28098#false} is VALID [2022-02-20 20:00:42,332 INFO L272 TraceCheckUtils]: 48: Hoare triple {28098#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28097#true} is VALID [2022-02-20 20:00:42,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {28097#true} havoc ~__retres1~2; {28097#true} is VALID [2022-02-20 20:00:42,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {28097#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28097#true} is VALID [2022-02-20 20:00:42,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {28097#true} #res := ~__retres1~2; {28097#true} is VALID [2022-02-20 20:00:42,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {28097#true} assume true; {28097#true} is VALID [2022-02-20 20:00:42,332 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {28097#true} {28098#false} #1422#return; {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {28098#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; {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {28098#false} assume 0 != eval1_~tmp___1~0#1; {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {28098#false} assume !(0 == ~p_dw_st~0); {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {28098#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; {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {28098#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; {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {28098#false} assume !(0 == ~c_dr_pc~0); {28098#false} is VALID [2022-02-20 20:00:42,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {28098#false} assume 2 == ~c_dr_pc~0; {28098#false} is VALID [2022-02-20 20:00:42,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {28098#false} do_read_c_~a~0#1 := ~a_t~0; {28098#false} is VALID [2022-02-20 20:00:42,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {28098#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; {28098#false} is VALID [2022-02-20 20:00:42,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {28098#false} assume !(~p_last_write~0 == ~c_last_read~0); {28098#false} is VALID [2022-02-20 20:00:42,334 INFO L272 TraceCheckUtils]: 64: Hoare triple {28098#false} call error1(); {28098#false} is VALID [2022-02-20 20:00:42,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {28098#false} assume !false; {28098#false} is VALID [2022-02-20 20:00:42,334 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:42,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:42,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216438915] [2022-02-20 20:00:42,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216438915] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:42,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:42,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:42,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818806269] [2022-02-20 20:00:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:42,336 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:42,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:42,336 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:42,375 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:42,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:42,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:42,377 INFO L87 Difference]: Start difference. First operand 1718 states and 2334 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:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:45,880 INFO L93 Difference]: Finished difference Result 3332 states and 4507 transitions. [2022-02-20 20:00:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:45,880 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:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:45,880 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:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 740 transitions. [2022-02-20 20:00:45,884 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:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 740 transitions. [2022-02-20 20:00:45,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 740 transitions. [2022-02-20 20:00:46,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 740 edges. 740 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:46,559 INFO L225 Difference]: With dead ends: 3332 [2022-02-20 20:00:46,559 INFO L226 Difference]: Without dead ends: 1882 [2022-02-20 20:00:46,562 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:46,562 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 468 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:46,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 2470 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-02-20 20:00:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1758. [2022-02-20 20:00:46,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:46,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1882 states. Second operand has 1758 states, 1433 states have (on average 1.3705512909979065) internal successors, (1964), 1457 states have internal predecessors, (1964), 175 states have call successors, (175), 112 states have call predecessors, (175), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:46,676 INFO L74 IsIncluded]: Start isIncluded. First operand 1882 states. Second operand has 1758 states, 1433 states have (on average 1.3705512909979065) internal successors, (1964), 1457 states have internal predecessors, (1964), 175 states have call successors, (175), 112 states have call predecessors, (175), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:46,678 INFO L87 Difference]: Start difference. First operand 1882 states. Second operand has 1758 states, 1433 states have (on average 1.3705512909979065) internal successors, (1964), 1457 states have internal predecessors, (1964), 175 states have call successors, (175), 112 states have call predecessors, (175), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,798 INFO L93 Difference]: Finished difference Result 1882 states and 2546 transitions. [2022-02-20 20:00:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2546 transitions. [2022-02-20 20:00:46,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:46,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:46,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 1758 states, 1433 states have (on average 1.3705512909979065) internal successors, (1964), 1457 states have internal predecessors, (1964), 175 states have call successors, (175), 112 states have call predecessors, (175), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) Second operand 1882 states. [2022-02-20 20:00:46,808 INFO L87 Difference]: Start difference. First operand has 1758 states, 1433 states have (on average 1.3705512909979065) internal successors, (1964), 1457 states have internal predecessors, (1964), 175 states have call successors, (175), 112 states have call predecessors, (175), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) Second operand 1882 states. [2022-02-20 20:00:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,945 INFO L93 Difference]: Finished difference Result 1882 states and 2546 transitions. [2022-02-20 20:00:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2546 transitions. [2022-02-20 20:00:46,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:46,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:46,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:46,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1433 states have (on average 1.3705512909979065) internal successors, (1964), 1457 states have internal predecessors, (1964), 175 states have call successors, (175), 112 states have call predecessors, (175), 148 states have return successors, (229), 191 states have call predecessors, (229), 171 states have call successors, (229) [2022-02-20 20:00:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2368 transitions. [2022-02-20 20:00:47,131 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2368 transitions. Word has length 66 [2022-02-20 20:00:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:47,131 INFO L470 AbstractCegarLoop]: Abstraction has 1758 states and 2368 transitions. [2022-02-20 20:00:47,131 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:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2368 transitions. [2022-02-20 20:00:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:47,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:47,133 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:47,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:47,133 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash -776228721, now seen corresponding path program 1 times [2022-02-20 20:00:47,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:47,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104270581] [2022-02-20 20:00:47,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {38775#(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); {38776#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:47,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {38776#(not (= |old(~q_req_up~0)| 1))} assume true; {38776#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:47,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38776#(not (= |old(~q_req_up~0)| 1))} {38735#(= ~c_dr_pc~0 ~q_req_up~0)} #1414#return; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {38777#(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); {38732#true} is VALID [2022-02-20 20:00:47,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {38732#true} assume !(0 == ~q_write_ev~0); {38732#true} is VALID [2022-02-20 20:00:47,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38732#true} {38739#(not (= ~c_dr_pc~0 1))} #1416#return; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {38732#true} havoc ~__retres1~0; {38732#true} is VALID [2022-02-20 20:00:47,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {38732#true} assume !(1 == ~p_dw_pc~0); {38732#true} is VALID [2022-02-20 20:00:47,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {38732#true} assume !(2 == ~p_dw_pc~0); {38732#true} is VALID [2022-02-20 20:00:47,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {38732#true} ~__retres1~0 := 0; {38732#true} is VALID [2022-02-20 20:00:47,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {38732#true} #res := ~__retres1~0; {38732#true} is VALID [2022-02-20 20:00:47,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,232 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38732#true} {38732#true} #1410#return; {38732#true} is VALID [2022-02-20 20:00:47,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {38732#true} havoc ~__retres1~1; {38732#true} is VALID [2022-02-20 20:00:47,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {38732#true} assume 1 == ~c_dr_pc~0; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,259 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} {38732#true} #1412#return; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {38778#(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; {38732#true} is VALID [2022-02-20 20:00:47,260 INFO L272 TraceCheckUtils]: 1: Hoare triple {38732#true} call #t~ret8 := is_do_write_p_triggered(); {38732#true} is VALID [2022-02-20 20:00:47,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {38732#true} havoc ~__retres1~0; {38732#true} is VALID [2022-02-20 20:00:47,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {38732#true} assume !(1 == ~p_dw_pc~0); {38732#true} is VALID [2022-02-20 20:00:47,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {38732#true} assume !(2 == ~p_dw_pc~0); {38732#true} is VALID [2022-02-20 20:00:47,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {38732#true} ~__retres1~0 := 0; {38732#true} is VALID [2022-02-20 20:00:47,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {38732#true} #res := ~__retres1~0; {38732#true} is VALID [2022-02-20 20:00:47,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,261 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {38732#true} {38732#true} #1410#return; {38732#true} is VALID [2022-02-20 20:00:47,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {38732#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38732#true} is VALID [2022-02-20 20:00:47,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {38732#true} assume !(0 != ~tmp~1); {38732#true} is VALID [2022-02-20 20:00:47,261 INFO L272 TraceCheckUtils]: 11: Hoare triple {38732#true} call #t~ret9 := is_do_read_c_triggered(); {38732#true} is VALID [2022-02-20 20:00:47,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {38732#true} havoc ~__retres1~1; {38732#true} is VALID [2022-02-20 20:00:47,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {38732#true} assume 1 == ~c_dr_pc~0; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,263 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} {38732#true} #1412#return; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,265 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} {38739#(not (= ~c_dr_pc~0 1))} #1418#return; {38733#false} is VALID [2022-02-20 20:00:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {38777#(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); {38732#true} is VALID [2022-02-20 20:00:47,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {38732#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {38732#true} is VALID [2022-02-20 20:00:47,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38732#true} {38733#false} #1420#return; {38733#false} is VALID [2022-02-20 20:00:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {38732#true} havoc ~__retres1~2; {38732#true} is VALID [2022-02-20 20:00:47,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {38732#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38732#true} is VALID [2022-02-20 20:00:47,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {38732#true} #res := ~__retres1~2; {38732#true} is VALID [2022-02-20 20:00:47,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,284 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38732#true} {38733#false} #1422#return; {38733#false} is VALID [2022-02-20 20:00:47,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {38732#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; {38734#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:47,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {38734#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {38734#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:47,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {38734#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {38735#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:47,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {38735#(= ~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; {38735#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:47,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {38735#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {38775#(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:47,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {38775#(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); {38776#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:47,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {38776#(not (= |old(~q_req_up~0)| 1))} assume true; {38776#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:47,288 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38776#(not (= |old(~q_req_up~0)| 1))} {38735#(= ~c_dr_pc~0 ~q_req_up~0)} #1414#return; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {38739#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {38739#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {38739#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {38739#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {38739#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {38777#(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:47,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {38777#(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); {38732#true} is VALID [2022-02-20 20:00:47,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {38732#true} assume !(0 == ~q_write_ev~0); {38732#true} is VALID [2022-02-20 20:00:47,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,290 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38732#true} {38739#(not (= ~c_dr_pc~0 1))} #1416#return; {38739#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:47,291 INFO L272 TraceCheckUtils]: 17: Hoare triple {38739#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {38778#(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:47,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {38778#(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; {38732#true} is VALID [2022-02-20 20:00:47,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {38732#true} call #t~ret8 := is_do_write_p_triggered(); {38732#true} is VALID [2022-02-20 20:00:47,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {38732#true} havoc ~__retres1~0; {38732#true} is VALID [2022-02-20 20:00:47,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {38732#true} assume !(1 == ~p_dw_pc~0); {38732#true} is VALID [2022-02-20 20:00:47,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {38732#true} assume !(2 == ~p_dw_pc~0); {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {38732#true} ~__retres1~0 := 0; {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {38732#true} #res := ~__retres1~0; {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38732#true} {38732#true} #1410#return; {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {38732#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {38732#true} assume !(0 != ~tmp~1); {38732#true} is VALID [2022-02-20 20:00:47,292 INFO L272 TraceCheckUtils]: 29: Hoare triple {38732#true} call #t~ret9 := is_do_read_c_triggered(); {38732#true} is VALID [2022-02-20 20:00:47,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {38732#true} havoc ~__retres1~1; {38732#true} is VALID [2022-02-20 20:00:47,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {38732#true} assume 1 == ~c_dr_pc~0; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,294 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} {38732#true} #1412#return; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:47,296 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38792#(= (+ (- 1) ~c_dr_pc~0) 0)} {38739#(not (= ~c_dr_pc~0 1))} #1418#return; {38733#false} is VALID [2022-02-20 20:00:47,296 INFO L272 TraceCheckUtils]: 40: Hoare triple {38733#false} call reset_delta_events1(); {38777#(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:47,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {38777#(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); {38732#true} is VALID [2022-02-20 20:00:47,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {38732#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {38732#true} is VALID [2022-02-20 20:00:47,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,297 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {38732#true} {38733#false} #1420#return; {38733#false} is VALID [2022-02-20 20:00:47,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {38733#false} assume !false; {38733#false} is VALID [2022-02-20 20:00:47,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 20:00:47,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {38733#false} assume !false; {38733#false} is VALID [2022-02-20 20:00:47,298 INFO L272 TraceCheckUtils]: 48: Hoare triple {38733#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38732#true} is VALID [2022-02-20 20:00:47,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {38732#true} havoc ~__retres1~2; {38732#true} is VALID [2022-02-20 20:00:47,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {38732#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38732#true} is VALID [2022-02-20 20:00:47,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {38732#true} #res := ~__retres1~2; {38732#true} is VALID [2022-02-20 20:00:47,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {38732#true} assume true; {38732#true} is VALID [2022-02-20 20:00:47,299 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38732#true} {38733#false} #1422#return; {38733#false} is VALID [2022-02-20 20:00:47,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 20:00:47,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {38733#false} assume 0 != eval1_~tmp___1~0#1; {38733#false} is VALID [2022-02-20 20:00:47,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {38733#false} assume !(0 == ~p_dw_st~0); {38733#false} is VALID [2022-02-20 20:00:47,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 20:00:47,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 20:00:47,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {38733#false} assume !(0 == ~c_dr_pc~0); {38733#false} is VALID [2022-02-20 20:00:47,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {38733#false} assume 2 == ~c_dr_pc~0; {38733#false} is VALID [2022-02-20 20:00:47,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {38733#false} do_read_c_~a~0#1 := ~a_t~0; {38733#false} is VALID [2022-02-20 20:00:47,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {38733#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; {38733#false} is VALID [2022-02-20 20:00:47,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {38733#false} assume !(~p_last_write~0 == ~c_last_read~0); {38733#false} is VALID [2022-02-20 20:00:47,304 INFO L272 TraceCheckUtils]: 64: Hoare triple {38733#false} call error1(); {38733#false} is VALID [2022-02-20 20:00:47,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {38733#false} assume !false; {38733#false} is VALID [2022-02-20 20:00:47,304 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:47,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:47,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104270581] [2022-02-20 20:00:47,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104270581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:47,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:47,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:47,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604308381] [2022-02-20 20:00:47,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:47,306 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:47,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:47,306 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:47,347 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:47,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:47,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:47,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:47,348 INFO L87 Difference]: Start difference. First operand 1758 states and 2368 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:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:54,040 INFO L93 Difference]: Finished difference Result 5492 states and 7470 transitions. [2022-02-20 20:00:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:54,040 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:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:54,040 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:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1353 transitions. [2022-02-20 20:00:54,049 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:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1353 transitions. [2022-02-20 20:00:54,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1353 transitions. [2022-02-20 20:00:55,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1353 edges. 1353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:55,251 INFO L225 Difference]: With dead ends: 5492 [2022-02-20 20:00:55,251 INFO L226 Difference]: Without dead ends: 2155 [2022-02-20 20:00:55,257 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:55,259 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 3442 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3460 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:55,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3460 Valid, 2317 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:00:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2022-02-20 20:00:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1959. [2022-02-20 20:00:55,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:55,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2155 states. Second operand has 1959 states, 1564 states have (on average 1.3312020460358056) internal successors, (2082), 1590 states have internal predecessors, (2082), 215 states have call successors, (215), 140 states have call predecessors, (215), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:55,401 INFO L74 IsIncluded]: Start isIncluded. First operand 2155 states. Second operand has 1959 states, 1564 states have (on average 1.3312020460358056) internal successors, (2082), 1590 states have internal predecessors, (2082), 215 states have call successors, (215), 140 states have call predecessors, (215), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:55,403 INFO L87 Difference]: Start difference. First operand 2155 states. Second operand has 1959 states, 1564 states have (on average 1.3312020460358056) internal successors, (2082), 1590 states have internal predecessors, (2082), 215 states have call successors, (215), 140 states have call predecessors, (215), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:55,589 INFO L93 Difference]: Finished difference Result 2155 states and 2825 transitions. [2022-02-20 20:00:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2825 transitions. [2022-02-20 20:00:55,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:55,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:55,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 1959 states, 1564 states have (on average 1.3312020460358056) internal successors, (2082), 1590 states have internal predecessors, (2082), 215 states have call successors, (215), 140 states have call predecessors, (215), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) Second operand 2155 states. [2022-02-20 20:00:55,599 INFO L87 Difference]: Start difference. First operand has 1959 states, 1564 states have (on average 1.3312020460358056) internal successors, (2082), 1590 states have internal predecessors, (2082), 215 states have call successors, (215), 140 states have call predecessors, (215), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) Second operand 2155 states. [2022-02-20 20:00:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:55,783 INFO L93 Difference]: Finished difference Result 2155 states and 2825 transitions. [2022-02-20 20:00:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2825 transitions. [2022-02-20 20:00:55,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:55,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:55,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:55,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1564 states have (on average 1.3312020460358056) internal successors, (2082), 1590 states have internal predecessors, (2082), 215 states have call successors, (215), 140 states have call predecessors, (215), 178 states have return successors, (273), 231 states have call predecessors, (273), 211 states have call successors, (273) [2022-02-20 20:00:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2570 transitions. [2022-02-20 20:00:56,018 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2570 transitions. Word has length 66 [2022-02-20 20:00:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:56,018 INFO L470 AbstractCegarLoop]: Abstraction has 1959 states and 2570 transitions. [2022-02-20 20:00:56,018 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:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2570 transitions. [2022-02-20 20:00:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:56,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:56,024 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:56,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:56,025 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1088286627, now seen corresponding path program 1 times [2022-02-20 20:00:56,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:56,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007280222] [2022-02-20 20:00:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {53195#(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); {53196#(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:56,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53196#(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:56,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1414#return; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {53196#(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); {53196#(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:56,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {53196#(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); {53196#(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:56,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53196#(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:56,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1416#return; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {53148#true} havoc ~__retres1~0; {53148#true} is VALID [2022-02-20 20:00:56,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {53148#true} assume !(1 == ~p_dw_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {53148#true} assume !(2 == ~p_dw_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {53148#true} ~__retres1~0 := 0; {53148#true} is VALID [2022-02-20 20:00:56,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {53148#true} #res := ~__retres1~0; {53148#true} is VALID [2022-02-20 20:00:56,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,102 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53148#true} {53148#true} #1410#return; {53148#true} is VALID [2022-02-20 20:00:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {53148#true} havoc ~__retres1~1; {53148#true} is VALID [2022-02-20 20:00:56,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {53148#true} assume !(1 == ~c_dr_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {53148#true} assume !(2 == ~c_dr_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {53148#true} ~__retres1~1 := 0; {53148#true} is VALID [2022-02-20 20:00:56,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {53148#true} #res := ~__retres1~1; {53148#true} is VALID [2022-02-20 20:00:56,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,107 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53148#true} {53148#true} #1412#return; {53148#true} is VALID [2022-02-20 20:00:56,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {53197#(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; {53148#true} is VALID [2022-02-20 20:00:56,107 INFO L272 TraceCheckUtils]: 1: Hoare triple {53148#true} call #t~ret8 := is_do_write_p_triggered(); {53148#true} is VALID [2022-02-20 20:00:56,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {53148#true} havoc ~__retres1~0; {53148#true} is VALID [2022-02-20 20:00:56,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {53148#true} assume !(1 == ~p_dw_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {53148#true} assume !(2 == ~p_dw_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {53148#true} ~__retres1~0 := 0; {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {53148#true} #res := ~__retres1~0; {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {53148#true} {53148#true} #1410#return; {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {53148#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {53148#true} assume !(0 != ~tmp~1); {53148#true} is VALID [2022-02-20 20:00:56,108 INFO L272 TraceCheckUtils]: 11: Hoare triple {53148#true} call #t~ret9 := is_do_read_c_triggered(); {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {53148#true} havoc ~__retres1~1; {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {53148#true} assume !(1 == ~c_dr_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {53148#true} assume !(2 == ~c_dr_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {53148#true} ~__retres1~1 := 0; {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {53148#true} #res := ~__retres1~1; {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,109 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {53148#true} {53148#true} #1412#return; {53148#true} is VALID [2022-02-20 20:00:56,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {53148#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53148#true} is VALID [2022-02-20 20:00:56,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {53148#true} assume !(0 != ~tmp___0~1); {53148#true} is VALID [2022-02-20 20:00:56,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,110 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {53148#true} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1418#return; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {53196#(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); {53212#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:56,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {53212#(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; {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1420#return; {53149#false} is VALID [2022-02-20 20:00:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {53148#true} havoc ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {53148#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53148#true} is VALID [2022-02-20 20:00:56,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {53148#true} #res := ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,140 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53148#true} {53149#false} #1422#return; {53149#false} is VALID [2022-02-20 20:00:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {53148#true} havoc ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {53148#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53148#true} is VALID [2022-02-20 20:00:56,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {53148#true} #res := ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,145 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53148#true} {53149#false} #1422#return; {53149#false} is VALID [2022-02-20 20:00:56,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {53148#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; {53148#true} is VALID [2022-02-20 20:00:56,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {53148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {53148#true} is VALID [2022-02-20 20:00:56,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {53148#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {53150#(= ~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; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {53195#(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:56,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {53195#(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); {53196#(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:56,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53196#(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:56,148 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1414#return; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,149 INFO L272 TraceCheckUtils]: 12: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {53196#(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:56,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {53196#(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); {53196#(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:56,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {53196#(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); {53196#(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:56,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53196#(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:56,151 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53196#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1416#return; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,151 INFO L272 TraceCheckUtils]: 17: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {53197#(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:56,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {53197#(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; {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L272 TraceCheckUtils]: 19: Hoare triple {53148#true} call #t~ret8 := is_do_write_p_triggered(); {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {53148#true} havoc ~__retres1~0; {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {53148#true} assume !(1 == ~p_dw_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {53148#true} assume !(2 == ~p_dw_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {53148#true} ~__retres1~0 := 0; {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {53148#true} #res := ~__retres1~0; {53148#true} is VALID [2022-02-20 20:00:56,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53148#true} {53148#true} #1410#return; {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {53148#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {53148#true} assume !(0 != ~tmp~1); {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L272 TraceCheckUtils]: 29: Hoare triple {53148#true} call #t~ret9 := is_do_read_c_triggered(); {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {53148#true} havoc ~__retres1~1; {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {53148#true} assume !(1 == ~c_dr_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {53148#true} assume !(2 == ~c_dr_pc~0); {53148#true} is VALID [2022-02-20 20:00:56,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {53148#true} ~__retres1~1 := 0; {53148#true} is VALID [2022-02-20 20:00:56,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {53148#true} #res := ~__retres1~1; {53148#true} is VALID [2022-02-20 20:00:56,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,154 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53148#true} {53148#true} #1412#return; {53148#true} is VALID [2022-02-20 20:00:56,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {53148#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53148#true} is VALID [2022-02-20 20:00:56,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {53148#true} assume !(0 != ~tmp___0~1); {53148#true} is VALID [2022-02-20 20:00:56,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,155 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {53148#true} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1418#return; {53150#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,155 INFO L272 TraceCheckUtils]: 41: Hoare triple {53150#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {53196#(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:56,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {53196#(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); {53212#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:56,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {53212#(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; {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,157 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {53213#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {53150#(= ~q_write_ev~0 ~q_read_ev~0)} #1420#return; {53149#false} is VALID [2022-02-20 20:00:56,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {53149#false} assume !false; {53149#false} is VALID [2022-02-20 20:00:56,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {53149#false} assume !false; {53149#false} is VALID [2022-02-20 20:00:56,157 INFO L272 TraceCheckUtils]: 49: Hoare triple {53149#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53148#true} is VALID [2022-02-20 20:00:56,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {53148#true} havoc ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {53148#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53148#true} is VALID [2022-02-20 20:00:56,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {53148#true} #res := ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,158 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {53148#true} {53149#false} #1422#return; {53149#false} is VALID [2022-02-20 20:00:56,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {53149#false} assume 0 != eval1_~tmp___1~0#1; {53149#false} is VALID [2022-02-20 20:00:56,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {53149#false} assume 0 == ~p_dw_pc~0; {53149#false} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {53149#false} assume !false; {53149#false} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {53149#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {53149#false} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {53149#false} assume { :end_inline_do_write_p } true; {53149#false} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {53149#false} assume !(0 == ~c_dr_st~0); {53149#false} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {53149#false} assume !false; {53149#false} is VALID [2022-02-20 20:00:56,159 INFO L272 TraceCheckUtils]: 65: Hoare triple {53149#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53148#true} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {53148#true} havoc ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {53148#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53148#true} is VALID [2022-02-20 20:00:56,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {53148#true} #res := ~__retres1~2; {53148#true} is VALID [2022-02-20 20:00:56,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {53148#true} assume true; {53148#true} is VALID [2022-02-20 20:00:56,160 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {53148#true} {53149#false} #1422#return; {53149#false} is VALID [2022-02-20 20:00:56,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {53149#false} assume 0 != eval1_~tmp___1~0#1; {53149#false} is VALID [2022-02-20 20:00:56,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {53149#false} assume !(0 == ~p_dw_pc~0); {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {53149#false} assume 1 == ~p_dw_pc~0; {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {53149#false} assume !(0 == ~q_free~0); {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 79: Hoare triple {53149#false} assume !false; {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 80: Hoare triple {53149#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 81: Hoare triple {53149#false} assume { :end_inline_do_write_p } true; {53149#false} is VALID [2022-02-20 20:00:56,161 INFO L290 TraceCheckUtils]: 82: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {53149#false} assume !(0 == ~c_dr_pc~0); {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {53149#false} assume 2 == ~c_dr_pc~0; {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {53149#false} do_read_c_~a~0#1 := ~a_t~0; {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {53149#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; {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L290 TraceCheckUtils]: 88: Hoare triple {53149#false} assume !(~p_last_write~0 == ~c_last_read~0); {53149#false} is VALID [2022-02-20 20:00:56,162 INFO L272 TraceCheckUtils]: 89: Hoare triple {53149#false} call error1(); {53149#false} is VALID [2022-02-20 20:00:56,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {53149#false} assume !false; {53149#false} is VALID [2022-02-20 20:00:56,163 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:56,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:56,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007280222] [2022-02-20 20:00:56,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007280222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:56,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:56,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:56,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682271305] [2022-02-20 20:00:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:56,164 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:56,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:56,165 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:56,215 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:56,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:56,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:56,216 INFO L87 Difference]: Start difference. First operand 1959 states and 2570 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:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:59,706 INFO L93 Difference]: Finished difference Result 3496 states and 4558 transitions. [2022-02-20 20:00:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 20:00:59,706 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:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:59,706 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:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 920 transitions. [2022-02-20 20:00:59,712 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:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 920 transitions. [2022-02-20 20:00:59,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 920 transitions. [2022-02-20 20:01:00,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 920 edges. 920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:00,546 INFO L225 Difference]: With dead ends: 3496 [2022-02-20 20:01:00,546 INFO L226 Difference]: Without dead ends: 2043 [2022-02-20 20:01:00,549 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:01:00,549 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1345 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:00,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1372 Valid, 1694 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:01:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2022-02-20 20:01:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1738. [2022-02-20 20:01:00,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:00,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2043 states. Second operand has 1738 states, 1396 states have (on average 1.3330945558739256) internal successors, (1861), 1417 states have internal predecessors, (1861), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:00,657 INFO L74 IsIncluded]: Start isIncluded. First operand 2043 states. Second operand has 1738 states, 1396 states have (on average 1.3330945558739256) internal successors, (1861), 1417 states have internal predecessors, (1861), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:00,660 INFO L87 Difference]: Start difference. First operand 2043 states. Second operand has 1738 states, 1396 states have (on average 1.3330945558739256) internal successors, (1861), 1417 states have internal predecessors, (1861), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:00,829 INFO L93 Difference]: Finished difference Result 2043 states and 2678 transitions. [2022-02-20 20:01:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2678 transitions. [2022-02-20 20:01:00,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:00,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:00,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 1738 states, 1396 states have (on average 1.3330945558739256) internal successors, (1861), 1417 states have internal predecessors, (1861), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 2043 states. [2022-02-20 20:01:00,840 INFO L87 Difference]: Start difference. First operand has 1738 states, 1396 states have (on average 1.3330945558739256) internal successors, (1861), 1417 states have internal predecessors, (1861), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 2043 states. [2022-02-20 20:01:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:01,013 INFO L93 Difference]: Finished difference Result 2043 states and 2678 transitions. [2022-02-20 20:01:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2678 transitions. [2022-02-20 20:01:01,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:01,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:01,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:01,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1396 states have (on average 1.3330945558739256) internal successors, (1861), 1417 states have internal predecessors, (1861), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2281 transitions. [2022-02-20 20:01:01,199 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2281 transitions. Word has length 91 [2022-02-20 20:01:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:01,199 INFO L470 AbstractCegarLoop]: Abstraction has 1738 states and 2281 transitions. [2022-02-20 20:01:01,199 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:01:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2281 transitions. [2022-02-20 20:01:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:01,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:01,200 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:01:01,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:01,201 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1267518623, now seen corresponding path program 1 times [2022-02-20 20:01:01,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:01,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368928565] [2022-02-20 20:01:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {64348#(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); {64301#true} is VALID [2022-02-20 20:01:01,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64301#true} {64301#true} #1414#return; {64301#true} is VALID [2022-02-20 20:01:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {64349#(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); {64301#true} is VALID [2022-02-20 20:01:01,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume !(0 == ~q_write_ev~0); {64301#true} is VALID [2022-02-20 20:01:01,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64301#true} {64306#(= ~c_dr_st~0 0)} #1416#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {64301#true} havoc ~__retres1~0; {64301#true} is VALID [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume !(1 == ~p_dw_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} assume !(2 == ~p_dw_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {64301#true} ~__retres1~0 := 0; {64301#true} is VALID [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {64301#true} #res := ~__retres1~0; {64301#true} is VALID [2022-02-20 20:01:01,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,277 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64301#true} {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1410#return; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {64301#true} havoc ~__retres1~1; {64301#true} is VALID [2022-02-20 20:01:01,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume !(1 == ~c_dr_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} assume !(2 == ~c_dr_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {64301#true} ~__retres1~1 := 0; {64301#true} is VALID [2022-02-20 20:01:01,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {64301#true} #res := ~__retres1~1; {64301#true} is VALID [2022-02-20 20:01:01,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,281 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64301#true} {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1412#return; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {64350#(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; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,282 INFO L272 TraceCheckUtils]: 1: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {64301#true} is VALID [2022-02-20 20:01:01,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} havoc ~__retres1~0; {64301#true} is VALID [2022-02-20 20:01:01,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {64301#true} assume !(1 == ~p_dw_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {64301#true} assume !(2 == ~p_dw_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {64301#true} ~__retres1~0 := 0; {64301#true} is VALID [2022-02-20 20:01:01,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {64301#true} #res := ~__retres1~0; {64301#true} is VALID [2022-02-20 20:01:01,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,283 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {64301#true} {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1410#return; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,284 INFO L272 TraceCheckUtils]: 11: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {64301#true} is VALID [2022-02-20 20:01:01,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {64301#true} havoc ~__retres1~1; {64301#true} is VALID [2022-02-20 20:01:01,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {64301#true} assume !(1 == ~c_dr_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {64301#true} assume !(2 == ~c_dr_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {64301#true} ~__retres1~1 := 0; {64301#true} is VALID [2022-02-20 20:01:01,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {64301#true} #res := ~__retres1~1; {64301#true} is VALID [2022-02-20 20:01:01,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,285 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {64301#true} {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1412#return; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,286 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {64306#(= ~c_dr_st~0 0)} #1418#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {64349#(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); {64301#true} is VALID [2022-02-20 20:01:01,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume !(1 == ~q_write_ev~0); {64301#true} is VALID [2022-02-20 20:01:01,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64301#true} {64306#(= ~c_dr_st~0 0)} #1420#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {64301#true} havoc ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64301#true} is VALID [2022-02-20 20:01:01,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} #res := ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64301#true} {64306#(= ~c_dr_st~0 0)} #1422#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {64301#true} havoc ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64301#true} is VALID [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} #res := ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,307 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64301#true} {64302#false} #1422#return; {64302#false} is VALID [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {64301#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; {64301#true} is VALID [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {64301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {64301#true} is VALID [2022-02-20 20:01:01,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {64301#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {64301#true} is VALID [2022-02-20 20:01:01,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {64301#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; {64301#true} is VALID [2022-02-20 20:01:01,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {64301#true} call update_channels1(); {64348#(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:01,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {64348#(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); {64301#true} is VALID [2022-02-20 20:01:01,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,309 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64301#true} {64301#true} #1414#return; {64301#true} is VALID [2022-02-20 20:01:01,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {64301#true} assume { :begin_inline_init_threads1 } true; {64301#true} is VALID [2022-02-20 20:01:01,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {64301#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {64301#true} is VALID [2022-02-20 20:01:01,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {64301#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {64306#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,310 INFO L272 TraceCheckUtils]: 12: Hoare triple {64306#(= ~c_dr_st~0 0)} call fire_delta_events1(); {64349#(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:01,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {64349#(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); {64301#true} is VALID [2022-02-20 20:01:01,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {64301#true} assume !(0 == ~q_write_ev~0); {64301#true} is VALID [2022-02-20 20:01:01,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,311 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64301#true} {64306#(= ~c_dr_st~0 0)} #1416#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,311 INFO L272 TraceCheckUtils]: 17: Hoare triple {64306#(= ~c_dr_st~0 0)} call activate_threads1(); {64350#(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:01,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {64350#(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; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,312 INFO L272 TraceCheckUtils]: 19: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {64301#true} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {64301#true} havoc ~__retres1~0; {64301#true} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {64301#true} assume !(1 == ~p_dw_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {64301#true} assume !(2 == ~p_dw_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {64301#true} ~__retres1~0 := 0; {64301#true} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {64301#true} #res := ~__retres1~0; {64301#true} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,313 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {64301#true} {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1410#return; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,314 INFO L272 TraceCheckUtils]: 29: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {64301#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {64301#true} havoc ~__retres1~1; {64301#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {64301#true} assume !(1 == ~c_dr_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {64301#true} assume !(2 == ~c_dr_pc~0); {64301#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {64301#true} ~__retres1~1 := 0; {64301#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {64301#true} #res := ~__retres1~1; {64301#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,315 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {64301#true} {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1412#return; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:01,316 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {64351#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {64306#(= ~c_dr_st~0 0)} #1418#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,317 INFO L272 TraceCheckUtils]: 41: Hoare triple {64306#(= ~c_dr_st~0 0)} call reset_delta_events1(); {64349#(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:01,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {64349#(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); {64301#true} is VALID [2022-02-20 20:01:01,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {64301#true} assume !(1 == ~q_write_ev~0); {64301#true} is VALID [2022-02-20 20:01:01,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,317 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {64301#true} {64306#(= ~c_dr_st~0 0)} #1420#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {64306#(= ~c_dr_st~0 0)} assume !false; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {64306#(= ~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; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {64306#(= ~c_dr_st~0 0)} assume !false; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,318 INFO L272 TraceCheckUtils]: 49: Hoare triple {64306#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64301#true} is VALID [2022-02-20 20:01:01,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {64301#true} havoc ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {64301#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64301#true} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {64301#true} #res := ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,319 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {64301#true} {64306#(= ~c_dr_st~0 0)} #1422#return; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {64306#(= ~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; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {64306#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {64306#(= ~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; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {64306#(= ~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; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {64306#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {64306#(= ~c_dr_st~0 0)} assume !false; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {64306#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {64306#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {64306#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:01,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {64306#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {64302#false} is VALID [2022-02-20 20:01:01,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {64302#false} assume !false; {64302#false} is VALID [2022-02-20 20:01:01,322 INFO L272 TraceCheckUtils]: 65: Hoare triple {64302#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64301#true} is VALID [2022-02-20 20:01:01,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {64301#true} havoc ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {64301#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64301#true} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {64301#true} #res := ~__retres1~2; {64301#true} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {64301#true} assume true; {64301#true} is VALID [2022-02-20 20:01:01,323 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {64301#true} {64302#false} #1422#return; {64302#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 71: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {64302#false} assume 0 != eval1_~tmp___1~0#1; {64302#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {64302#false} assume !(0 == ~p_dw_pc~0); {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {64302#false} assume 1 == ~p_dw_pc~0; {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 77: Hoare triple {64302#false} assume !(0 == ~q_free~0); {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {64302#false} assume !false; {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {64302#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {64302#false} assume { :end_inline_do_write_p } true; {64302#false} is VALID [2022-02-20 20:01:01,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {64302#false} assume !(0 == ~c_dr_pc~0); {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 85: Hoare triple {64302#false} assume 2 == ~c_dr_pc~0; {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {64302#false} do_read_c_~a~0#1 := ~a_t~0; {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {64302#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; {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {64302#false} assume !(~p_last_write~0 == ~c_last_read~0); {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L272 TraceCheckUtils]: 89: Hoare triple {64302#false} call error1(); {64302#false} is VALID [2022-02-20 20:01:01,325 INFO L290 TraceCheckUtils]: 90: Hoare triple {64302#false} assume !false; {64302#false} is VALID [2022-02-20 20:01:01,326 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:01:01,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:01,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368928565] [2022-02-20 20:01:01,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368928565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:01,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:01,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:01,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770175750] [2022-02-20 20:01:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:01,328 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,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:01,328 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:01:01,380 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:01:01,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:01,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:01,381 INFO L87 Difference]: Start difference. First operand 1738 states and 2281 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:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:03,182 INFO L93 Difference]: Finished difference Result 3314 states and 4341 transitions. [2022-02-20 20:01:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:03,183 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:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:03,183 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:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2022-02-20 20:01:03,187 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:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2022-02-20 20:01:03,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 709 transitions. [2022-02-20 20:01:03,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:03,848 INFO L225 Difference]: With dead ends: 3314 [2022-02-20 20:01:03,848 INFO L226 Difference]: Without dead ends: 1845 [2022-02-20 20:01:03,850 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:03,851 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 1378 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:03,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1407 Valid, 1003 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:01:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-02-20 20:01:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1738. [2022-02-20 20:01:03,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:03,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1845 states. Second operand has 1738 states, 1396 states have (on average 1.3073065902578798) internal successors, (1825), 1417 states have internal predecessors, (1825), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:03,958 INFO L74 IsIncluded]: Start isIncluded. First operand 1845 states. Second operand has 1738 states, 1396 states have (on average 1.3073065902578798) internal successors, (1825), 1417 states have internal predecessors, (1825), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:03,960 INFO L87 Difference]: Start difference. First operand 1845 states. Second operand has 1738 states, 1396 states have (on average 1.3073065902578798) internal successors, (1825), 1417 states have internal predecessors, (1825), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:04,104 INFO L93 Difference]: Finished difference Result 1845 states and 2394 transitions. [2022-02-20 20:01:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2394 transitions. [2022-02-20 20:01:04,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:04,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:04,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 1738 states, 1396 states have (on average 1.3073065902578798) internal successors, (1825), 1417 states have internal predecessors, (1825), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 1845 states. [2022-02-20 20:01:04,112 INFO L87 Difference]: Start difference. First operand has 1738 states, 1396 states have (on average 1.3073065902578798) internal successors, (1825), 1417 states have internal predecessors, (1825), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) Second operand 1845 states. [2022-02-20 20:01:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:04,254 INFO L93 Difference]: Finished difference Result 1845 states and 2394 transitions. [2022-02-20 20:01:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2394 transitions. [2022-02-20 20:01:04,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:04,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:04,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:04,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1396 states have (on average 1.3073065902578798) internal successors, (1825), 1417 states have internal predecessors, (1825), 187 states have call successors, (187), 121 states have call predecessors, (187), 153 states have return successors, (233), 201 states have call predecessors, (233), 183 states have call successors, (233) [2022-02-20 20:01:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2245 transitions. [2022-02-20 20:01:04,450 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2245 transitions. Word has length 91 [2022-02-20 20:01:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:04,450 INFO L470 AbstractCegarLoop]: Abstraction has 1738 states and 2245 transitions. [2022-02-20 20:01:04,451 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:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2245 transitions. [2022-02-20 20:01:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:04,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:04,452 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:04,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:04,452 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash -512293133, now seen corresponding path program 1 times [2022-02-20 20:01:04,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:04,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081263221] [2022-02-20 20:01:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:04,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {74879#(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); {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:04,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:04,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {74833#(= ~q_read_ev~0 2)} #1414#return; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {74881#(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); {74831#true} is VALID [2022-02-20 20:01:04,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume !(0 == ~q_write_ev~0); {74831#true} is VALID [2022-02-20 20:01:04,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74831#true} {74833#(= ~q_read_ev~0 2)} #1416#return; {74831#true} is VALID [2022-02-20 20:01:04,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {74831#true} havoc ~__retres1~0; {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume !(1 == ~p_dw_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} assume !(2 == ~p_dw_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {74831#true} ~__retres1~0 := 0; {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {74831#true} #res := ~__retres1~0; {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {74831#true} {74831#true} #1410#return; {74831#true} is VALID [2022-02-20 20:01:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {74831#true} havoc ~__retres1~1; {74831#true} is VALID [2022-02-20 20:01:04,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume !(1 == ~c_dr_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} assume !(2 == ~c_dr_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {74831#true} ~__retres1~1 := 0; {74831#true} is VALID [2022-02-20 20:01:04,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {74831#true} #res := ~__retres1~1; {74831#true} is VALID [2022-02-20 20:01:04,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,552 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {74831#true} {74831#true} #1412#return; {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {74882#(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; {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L272 TraceCheckUtils]: 1: Hoare triple {74831#true} call #t~ret8 := is_do_write_p_triggered(); {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} havoc ~__retres1~0; {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {74831#true} assume !(1 == ~p_dw_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {74831#true} assume !(2 == ~p_dw_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {74831#true} ~__retres1~0 := 0; {74831#true} is VALID [2022-02-20 20:01:04,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {74831#true} #res := ~__retres1~0; {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {74831#true} {74831#true} #1410#return; {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {74831#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {74831#true} assume !(0 != ~tmp~1); {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L272 TraceCheckUtils]: 11: Hoare triple {74831#true} call #t~ret9 := is_do_read_c_triggered(); {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {74831#true} havoc ~__retres1~1; {74831#true} is VALID [2022-02-20 20:01:04,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {74831#true} assume !(1 == ~c_dr_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {74831#true} assume !(2 == ~c_dr_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {74831#true} ~__retres1~1 := 0; {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {74831#true} #res := ~__retres1~1; {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {74831#true} {74831#true} #1412#return; {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {74831#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74831#true} is VALID [2022-02-20 20:01:04,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {74831#true} assume !(0 != ~tmp___0~1); {74831#true} is VALID [2022-02-20 20:01:04,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,556 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {74831#true} {74831#true} #1418#return; {74831#true} is VALID [2022-02-20 20:01:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {74881#(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); {74831#true} is VALID [2022-02-20 20:01:04,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume !(1 == ~q_write_ev~0); {74831#true} is VALID [2022-02-20 20:01:04,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74831#true} {74831#true} #1420#return; {74831#true} is VALID [2022-02-20 20:01:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {74831#true} havoc ~__retres1~2; {74831#true} is VALID [2022-02-20 20:01:04,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74831#true} is VALID [2022-02-20 20:01:04,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} #res := ~__retres1~2; {74831#true} is VALID [2022-02-20 20:01:04,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,563 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {74831#true} {74831#true} #1422#return; {74831#true} is VALID [2022-02-20 20:01:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:04,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {74831#true} havoc ~__retres1~2; {74831#true} is VALID [2022-02-20 20:01:04,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74897#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:04,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {74897#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {74897#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:04,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {74897#(= ~p_dw_st~0 0)} assume true; {74897#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:04,576 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {74897#(= ~p_dw_st~0 0)} {74873#(not (= ~p_dw_st~0 0))} #1422#return; {74832#false} is VALID [2022-02-20 20:01:04,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {74831#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; {74831#true} is VALID [2022-02-20 20:01:04,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {74831#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {74831#true} is VALID [2022-02-20 20:01:04,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {74831#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {74833#(= ~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; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {74833#(= ~q_read_ev~0 2)} call update_channels1(); {74879#(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:04,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {74879#(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); {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:04,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:04,579 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74880#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {74833#(= ~q_read_ev~0 2)} #1414#return; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {74833#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {74833#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {74833#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {74833#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {74833#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:04,581 INFO L272 TraceCheckUtils]: 12: Hoare triple {74833#(= ~q_read_ev~0 2)} call fire_delta_events1(); {74881#(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:04,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {74881#(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); {74831#true} is VALID [2022-02-20 20:01:04,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {74831#true} assume !(0 == ~q_write_ev~0); {74831#true} is VALID [2022-02-20 20:01:04,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,582 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {74831#true} {74833#(= ~q_read_ev~0 2)} #1416#return; {74831#true} is VALID [2022-02-20 20:01:04,582 INFO L272 TraceCheckUtils]: 17: Hoare triple {74831#true} call activate_threads1(); {74882#(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:04,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {74882#(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; {74831#true} is VALID [2022-02-20 20:01:04,582 INFO L272 TraceCheckUtils]: 19: Hoare triple {74831#true} call #t~ret8 := is_do_write_p_triggered(); {74831#true} is VALID [2022-02-20 20:01:04,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {74831#true} havoc ~__retres1~0; {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {74831#true} assume !(1 == ~p_dw_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {74831#true} assume !(2 == ~p_dw_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {74831#true} ~__retres1~0 := 0; {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {74831#true} #res := ~__retres1~0; {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {74831#true} {74831#true} #1410#return; {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {74831#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74831#true} is VALID [2022-02-20 20:01:04,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {74831#true} assume !(0 != ~tmp~1); {74831#true} is VALID [2022-02-20 20:01:04,584 INFO L272 TraceCheckUtils]: 29: Hoare triple {74831#true} call #t~ret9 := is_do_read_c_triggered(); {74831#true} is VALID [2022-02-20 20:01:04,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {74831#true} havoc ~__retres1~1; {74831#true} is VALID [2022-02-20 20:01:04,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {74831#true} assume !(1 == ~c_dr_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {74831#true} assume !(2 == ~c_dr_pc~0); {74831#true} is VALID [2022-02-20 20:01:04,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {74831#true} ~__retres1~1 := 0; {74831#true} is VALID [2022-02-20 20:01:04,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {74831#true} #res := ~__retres1~1; {74831#true} is VALID [2022-02-20 20:01:04,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,588 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {74831#true} {74831#true} #1412#return; {74831#true} is VALID [2022-02-20 20:01:04,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {74831#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74831#true} is VALID [2022-02-20 20:01:04,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {74831#true} assume !(0 != ~tmp___0~1); {74831#true} is VALID [2022-02-20 20:01:04,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,589 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {74831#true} {74831#true} #1418#return; {74831#true} is VALID [2022-02-20 20:01:04,590 INFO L272 TraceCheckUtils]: 41: Hoare triple {74831#true} call reset_delta_events1(); {74881#(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:04,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {74881#(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); {74831#true} is VALID [2022-02-20 20:01:04,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {74831#true} assume !(1 == ~q_write_ev~0); {74831#true} is VALID [2022-02-20 20:01:04,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,590 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {74831#true} {74831#true} #1420#return; {74831#true} is VALID [2022-02-20 20:01:04,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {74831#true} assume !false; {74831#true} is VALID [2022-02-20 20:01:04,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {74831#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; {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {74831#true} assume !false; {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L272 TraceCheckUtils]: 49: Hoare triple {74831#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {74831#true} havoc ~__retres1~2; {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {74831#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {74831#true} #res := ~__retres1~2; {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {74831#true} assume true; {74831#true} is VALID [2022-02-20 20:01:04,591 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {74831#true} {74831#true} #1422#return; {74831#true} is VALID [2022-02-20 20:01:04,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {74831#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; {74831#true} is VALID [2022-02-20 20:01:04,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {74831#true} assume 0 != eval1_~tmp___1~0#1; {74831#true} is VALID [2022-02-20 20:01:04,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {74831#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; {74831#true} is VALID [2022-02-20 20:01:04,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {74831#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; {74831#true} is VALID [2022-02-20 20:01:04,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {74831#true} assume 0 == ~p_dw_pc~0; {74831#true} is VALID [2022-02-20 20:01:04,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {74831#true} assume !false; {74831#true} is VALID [2022-02-20 20:01:04,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {74831#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {74873#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:04,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {74873#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {74873#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:04,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {74873#(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; {74873#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:04,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {74873#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {74873#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:04,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {74873#(not (= ~p_dw_st~0 0))} assume !false; {74873#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:04,594 INFO L272 TraceCheckUtils]: 66: Hoare triple {74873#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {74831#true} is VALID [2022-02-20 20:01:04,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {74831#true} havoc ~__retres1~2; {74831#true} is VALID [2022-02-20 20:01:04,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {74831#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74897#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:04,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {74897#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {74897#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:04,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {74897#(= ~p_dw_st~0 0)} assume true; {74897#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:04,596 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74897#(= ~p_dw_st~0 0)} {74873#(not (= ~p_dw_st~0 0))} #1422#return; {74832#false} is VALID [2022-02-20 20:01:04,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {74832#false} assume 0 != eval1_~tmp___1~0#1; {74832#false} is VALID [2022-02-20 20:01:04,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {74832#false} assume !(0 == ~p_dw_pc~0); {74832#false} is VALID [2022-02-20 20:01:04,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {74832#false} assume 1 == ~p_dw_pc~0; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {74832#false} assume !(0 == ~q_free~0); {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 79: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {74832#false} assume !false; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {74832#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {74832#false} assume { :end_inline_do_write_p } true; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 83: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 84: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,597 INFO L290 TraceCheckUtils]: 85: Hoare triple {74832#false} assume !(0 == ~c_dr_pc~0); {74832#false} is VALID [2022-02-20 20:01:04,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {74832#false} assume 2 == ~c_dr_pc~0; {74832#false} is VALID [2022-02-20 20:01:04,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {74832#false} do_read_c_~a~0#1 := ~a_t~0; {74832#false} is VALID [2022-02-20 20:01:04,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {74832#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; {74832#false} is VALID [2022-02-20 20:01:04,598 INFO L290 TraceCheckUtils]: 89: Hoare triple {74832#false} assume !(~p_last_write~0 == ~c_last_read~0); {74832#false} is VALID [2022-02-20 20:01:04,598 INFO L272 TraceCheckUtils]: 90: Hoare triple {74832#false} call error1(); {74832#false} is VALID [2022-02-20 20:01:04,598 INFO L290 TraceCheckUtils]: 91: Hoare triple {74832#false} assume !false; {74832#false} is VALID [2022-02-20 20:01:04,599 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:04,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:04,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081263221] [2022-02-20 20:01:04,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081263221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:04,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:04,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:04,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111368171] [2022-02-20 20:01:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:04,600 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:04,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:04,601 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:04,658 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:04,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:04,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:04,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:04,659 INFO L87 Difference]: Start difference. First operand 1738 states and 2245 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)