./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54640fbb6743a38bf41f3a8b2318fcad885a58c92146d7845af619d355e32c56 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:57,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:57,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:58,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:58,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:58,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:58,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:58,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:58,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:58,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:58,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:58,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:58,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:58,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:58,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:58,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:58,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:58,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:58,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:58,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:58,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:58,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:58,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:58,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:58,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:58,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:58,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:58,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:58,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:58,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:58,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:58,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:58,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:58,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:58,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:58,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:58,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:58,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:58,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:58,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:58,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:58,057 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:58,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:58,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:58,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:58,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:58,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:58,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:58,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:58,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:58,079 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:58,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:58,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:58,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:58,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:58,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:58,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:58,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:58,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:58,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:58,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:58,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:58,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:58,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:58,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:58,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:58,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:58,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:58,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:58,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:58,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:58,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:58,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:58,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:58,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:58,083 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 -> 54640fbb6743a38bf41f3a8b2318fcad885a58c92146d7845af619d355e32c56 [2022-02-20 20:00:58,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:58,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:58,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:58,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:58,295 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:58,295 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.12.cil-1.c [2022-02-20 20:00:58,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e370cad6/03eb1a6ffde04788bdc1e5457e44bfdb/FLAG39850be44 [2022-02-20 20:00:58,802 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:58,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c [2022-02-20 20:00:58,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e370cad6/03eb1a6ffde04788bdc1e5457e44bfdb/FLAG39850be44 [2022-02-20 20:00:59,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e370cad6/03eb1a6ffde04788bdc1e5457e44bfdb [2022-02-20 20:00:59,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:59,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:59,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:59,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:59,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:59,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:59" (1/1) ... [2022-02-20 20:00:59,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c9ef80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:59, skipping insertion in model container [2022-02-20 20:00:59,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:59" (1/1) ... [2022-02-20 20:00:59,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:59,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:59,348 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.12.cil-1.c[911,924] [2022-02-20 20:00:59,389 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.12.cil-1.c[8416,8429] [2022-02-20 20:00:59,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:59,481 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:59,491 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.12.cil-1.c[911,924] [2022-02-20 20:00:59,510 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.12.cil-1.c[8416,8429] [2022-02-20 20:00:59,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:59,586 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:59,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:59 WrapperNode [2022-02-20 20:00:59,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:59,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:59,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:59,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:59,593 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:59" (1/1) ... [2022-02-20 20:00:59,611 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:59" (1/1) ... [2022-02-20 20:00:59,659 INFO L137 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1083 [2022-02-20 20:00:59,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:59,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:59,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:59,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:59,671 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:59" (1/1) ... [2022-02-20 20:00:59,671 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:59" (1/1) ... [2022-02-20 20:00:59,675 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:59" (1/1) ... [2022-02-20 20:00:59,676 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:59" (1/1) ... [2022-02-20 20:00:59,694 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:59" (1/1) ... [2022-02-20 20:00:59,708 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:59" (1/1) ... [2022-02-20 20:00:59,724 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:59" (1/1) ... [2022-02-20 20:00:59,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:59,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:59,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:59,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:59,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:59" (1/1) ... [2022-02-20 20:00:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:59,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:59,827 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:59,833 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:59,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:59,870 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:59,870 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:59,870 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:59,870 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:59,870 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:59,871 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:59,871 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 20:00:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 20:01:00,004 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:01:00,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:01:00,715 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:01:00,715 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:01:00,784 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:01:00,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:01:00,795 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 20:01:00,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:01:00 BoogieIcfgContainer [2022-02-20 20:01:00,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:01:00,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:01:00,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:01:00,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:01:00,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:59" (1/3) ... [2022-02-20 20:01:00,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaf9f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:01:00, skipping insertion in model container [2022-02-20 20:01:00,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:59" (2/3) ... [2022-02-20 20:01:00,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaf9f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:01:00, skipping insertion in model container [2022-02-20 20:01:00,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:01:00" (3/3) ... [2022-02-20 20:01:00,822 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.12.cil-1.c [2022-02-20 20:01:00,826 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:01:00,826 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:01:00,862 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:01:00,871 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:01:00,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:01:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 507 states, 445 states have (on average 1.6426966292134833) internal successors, (731), 453 states have internal predecessors, (731), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-02-20 20:01:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:00,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:00,906 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:01:00,906 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash -813497817, now seen corresponding path program 1 times [2022-02-20 20:01:00,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:00,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123815698] [2022-02-20 20:01:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#(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); {510#true} is VALID [2022-02-20 20:01:01,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {510#true} {512#(= 1 ~c_dr_i~0)} #1974#return; {512#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(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; {510#true} is VALID [2022-02-20 20:01:01,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {510#true} is VALID [2022-02-20 20:01:01,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {510#true} {511#false} #1976#return; {511#false} is VALID [2022-02-20 20:01:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#true} havoc ~__retres1~0; {510#true} is VALID [2022-02-20 20:01:01,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume 1 == ~p_dw_pc~0; {510#true} is VALID [2022-02-20 20:01:01,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {510#true} is VALID [2022-02-20 20:01:01,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#true} #res := ~__retres1~0; {510#true} is VALID [2022-02-20 20:01:01,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,259 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {510#true} {510#true} #1970#return; {510#true} is VALID [2022-02-20 20:01:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#true} havoc ~__retres1~1; {510#true} is VALID [2022-02-20 20:01:01,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume 1 == ~c_dr_pc~0; {510#true} is VALID [2022-02-20 20:01:01,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {510#true} is VALID [2022-02-20 20:01:01,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#true} #res := ~__retres1~1; {510#true} is VALID [2022-02-20 20:01:01,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,267 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {510#true} {510#true} #1972#return; {510#true} is VALID [2022-02-20 20:01:01,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#(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; {510#true} is VALID [2022-02-20 20:01:01,268 INFO L272 TraceCheckUtils]: 1: Hoare triple {510#true} call #t~ret8 := is_do_write_p_triggered(); {510#true} is VALID [2022-02-20 20:01:01,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} havoc ~__retres1~0; {510#true} is VALID [2022-02-20 20:01:01,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#true} assume 1 == ~p_dw_pc~0; {510#true} is VALID [2022-02-20 20:01:01,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {510#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {510#true} is VALID [2022-02-20 20:01:01,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {510#true} #res := ~__retres1~0; {510#true} is VALID [2022-02-20 20:01:01,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,270 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {510#true} {510#true} #1970#return; {510#true} is VALID [2022-02-20 20:01:01,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {510#true} is VALID [2022-02-20 20:01:01,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {510#true} is VALID [2022-02-20 20:01:01,271 INFO L272 TraceCheckUtils]: 10: Hoare triple {510#true} call #t~ret9 := is_do_read_c_triggered(); {510#true} is VALID [2022-02-20 20:01:01,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#true} havoc ~__retres1~1; {510#true} is VALID [2022-02-20 20:01:01,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {510#true} assume 1 == ~c_dr_pc~0; {510#true} is VALID [2022-02-20 20:01:01,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {510#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {510#true} is VALID [2022-02-20 20:01:01,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {510#true} #res := ~__retres1~1; {510#true} is VALID [2022-02-20 20:01:01,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,273 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {510#true} {510#true} #1972#return; {510#true} is VALID [2022-02-20 20:01:01,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {510#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {510#true} is VALID [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {510#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {510#true} is VALID [2022-02-20 20:01:01,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,277 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {510#true} {511#false} #1978#return; {511#false} is VALID [2022-02-20 20:01:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(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; {510#true} is VALID [2022-02-20 20:01:01,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {510#true} is VALID [2022-02-20 20:01:01,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {510#true} {511#false} #1980#return; {511#false} is VALID [2022-02-20 20:01:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#true} havoc ~__retres1~2; {510#true} is VALID [2022-02-20 20:01:01,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {510#true} is VALID [2022-02-20 20:01:01,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} #res := ~__retres1~2; {510#true} is VALID [2022-02-20 20:01:01,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {510#true} {511#false} #1982#return; {511#false} is VALID [2022-02-20 20:01:01,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {510#true} is VALID [2022-02-20 20:01:01,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {510#true} is VALID [2022-02-20 20:01:01,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {512#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:01,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#(= 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; {512#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:01,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#(= 1 ~c_dr_i~0)} call update_channels1(); {550#(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 {550#(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); {510#true} is VALID [2022-02-20 20:01:01,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,311 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {510#true} {512#(= 1 ~c_dr_i~0)} #1974#return; {512#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:01,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {512#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {512#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {511#false} is VALID [2022-02-20 20:01:01,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {511#false} assume { :end_inline_init_threads1 } true; {511#false} is VALID [2022-02-20 20:01:01,312 INFO L272 TraceCheckUtils]: 12: Hoare triple {511#false} call fire_delta_events1(); {551#(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,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {551#(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; {510#true} is VALID [2022-02-20 20:01:01,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {510#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {510#true} is VALID [2022-02-20 20:01:01,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,313 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {510#true} {511#false} #1976#return; {511#false} is VALID [2022-02-20 20:01:01,313 INFO L272 TraceCheckUtils]: 17: Hoare triple {511#false} call activate_threads1(); {552#(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,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {552#(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; {510#true} is VALID [2022-02-20 20:01:01,314 INFO L272 TraceCheckUtils]: 19: Hoare triple {510#true} call #t~ret8 := is_do_write_p_triggered(); {510#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#true} havoc ~__retres1~0; {510#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {510#true} assume 1 == ~p_dw_pc~0; {510#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {510#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {510#true} is VALID [2022-02-20 20:01:01,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {510#true} #res := ~__retres1~0; {510#true} is VALID [2022-02-20 20:01:01,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,315 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {510#true} {510#true} #1970#return; {510#true} is VALID [2022-02-20 20:01:01,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {510#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {510#true} is VALID [2022-02-20 20:01:01,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {510#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {510#true} is VALID [2022-02-20 20:01:01,316 INFO L272 TraceCheckUtils]: 28: Hoare triple {510#true} call #t~ret9 := is_do_read_c_triggered(); {510#true} is VALID [2022-02-20 20:01:01,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {510#true} havoc ~__retres1~1; {510#true} is VALID [2022-02-20 20:01:01,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {510#true} assume 1 == ~c_dr_pc~0; {510#true} is VALID [2022-02-20 20:01:01,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {510#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {510#true} is VALID [2022-02-20 20:01:01,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {510#true} #res := ~__retres1~1; {510#true} is VALID [2022-02-20 20:01:01,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,317 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {510#true} {510#true} #1972#return; {510#true} is VALID [2022-02-20 20:01:01,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {510#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {510#true} is VALID [2022-02-20 20:01:01,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {510#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {510#true} is VALID [2022-02-20 20:01:01,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,317 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {510#true} {511#false} #1978#return; {511#false} is VALID [2022-02-20 20:01:01,318 INFO L272 TraceCheckUtils]: 39: Hoare triple {511#false} call reset_delta_events1(); {551#(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,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {551#(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; {510#true} is VALID [2022-02-20 20:01:01,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {510#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {510#true} is VALID [2022-02-20 20:01:01,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,318 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {510#true} {511#false} #1980#return; {511#false} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {511#false} assume !false; {511#false} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {511#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; {511#false} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {511#false} assume !false; {511#false} is VALID [2022-02-20 20:01:01,319 INFO L272 TraceCheckUtils]: 47: Hoare triple {511#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {510#true} is VALID [2022-02-20 20:01:01,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {510#true} havoc ~__retres1~2; {510#true} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {510#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {510#true} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {510#true} #res := ~__retres1~2; {510#true} is VALID [2022-02-20 20:01:01,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {510#true} assume true; {510#true} is VALID [2022-02-20 20:01:01,322 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {510#true} {511#false} #1982#return; {511#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {511#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; {511#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {511#false} assume 0 != eval1_~tmp___1~0#1; {511#false} is VALID [2022-02-20 20:01:01,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {511#false} assume !(0 == ~p_dw_st~0); {511#false} is VALID [2022-02-20 20:01:01,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {511#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; {511#false} is VALID [2022-02-20 20:01:01,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {511#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; {511#false} is VALID [2022-02-20 20:01:01,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {511#false} assume !(0 == ~c_dr_pc~0); {511#false} is VALID [2022-02-20 20:01:01,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {511#false} assume 2 == ~c_dr_pc~0; {511#false} is VALID [2022-02-20 20:01:01,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {511#false} do_read_c_~a~0#1 := ~a_t~0; {511#false} is VALID [2022-02-20 20:01:01,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {511#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; {511#false} is VALID [2022-02-20 20:01:01,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {511#false} assume !(~p_last_write~0 == ~c_last_read~0); {511#false} is VALID [2022-02-20 20:01:01,330 INFO L272 TraceCheckUtils]: 63: Hoare triple {511#false} call error1(); {511#false} is VALID [2022-02-20 20:01:01,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {511#false} assume !false; {511#false} is VALID [2022-02-20 20:01:01,336 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:01:01,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:01,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123815698] [2022-02-20 20:01:01,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123815698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:01,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:01,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:01,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236844096] [2022-02-20 20:01:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:01,342 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:01:01,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:01,349 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:01:01,399 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:01:01,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:01,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:01,427 INFO L87 Difference]: Start difference. First operand has 507 states, 445 states have (on average 1.6426966292134833) internal successors, (731), 453 states have internal predecessors, (731), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) 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:01:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:03,771 INFO L93 Difference]: Finished difference Result 1003 states and 1618 transitions. [2022-02-20 20:01:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:03,771 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:01:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:03,773 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:01:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1618 transitions. [2022-02-20 20:01:03,796 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:01:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1618 transitions. [2022-02-20 20:01:03,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1618 transitions. [2022-02-20 20:01:04,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1618 edges. 1618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:04,907 INFO L225 Difference]: With dead ends: 1003 [2022-02-20 20:01:04,907 INFO L226 Difference]: Without dead ends: 514 [2022-02-20 20:01:04,912 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:01:04,915 INFO L933 BasicCegarLoop]: 772 mSDtfsCounter, 1108 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:04,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1120 Valid, 1792 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:01:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-02-20 20:01:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 496. [2022-02-20 20:01:04,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:04,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 496 states, 437 states have (on average 1.5560640732265447) internal successors, (680), 442 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:04,976 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 496 states, 437 states have (on average 1.5560640732265447) internal successors, (680), 442 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:04,977 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 496 states, 437 states have (on average 1.5560640732265447) internal successors, (680), 442 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:05,002 INFO L93 Difference]: Finished difference Result 514 states and 793 transitions. [2022-02-20 20:01:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 793 transitions. [2022-02-20 20:01:05,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:05,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:05,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 496 states, 437 states have (on average 1.5560640732265447) internal successors, (680), 442 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 514 states. [2022-02-20 20:01:05,021 INFO L87 Difference]: Start difference. First operand has 496 states, 437 states have (on average 1.5560640732265447) internal successors, (680), 442 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 514 states. [2022-02-20 20:01:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:05,040 INFO L93 Difference]: Finished difference Result 514 states and 793 transitions. [2022-02-20 20:01:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 793 transitions. [2022-02-20 20:01:05,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:05,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:05,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:05,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 437 states have (on average 1.5560640732265447) internal successors, (680), 442 states have internal predecessors, (680), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 764 transitions. [2022-02-20 20:01:05,076 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 764 transitions. Word has length 65 [2022-02-20 20:01:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:05,077 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 764 transitions. [2022-02-20 20:01:05,077 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:01:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 764 transitions. [2022-02-20 20:01:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:05,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:05,080 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:01:05,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:01:05,081 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2094684069, now seen corresponding path program 1 times [2022-02-20 20:01:05,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:05,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904779749] [2022-02-20 20:01:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#(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); {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:05,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:05,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3571#(= ~q_read_ev~0 2)} #1974#return; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {3611#(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; {3612#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:05,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {3612#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3612#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:05,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {3612#(= |old(~q_read_ev~0)| 0)} assume true; {3612#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:05,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3612#(= |old(~q_read_ev~0)| 0)} {3571#(= ~q_read_ev~0 2)} #1976#return; {3570#false} is VALID [2022-02-20 20:01:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {3569#true} havoc ~__retres1~0; {3569#true} is VALID [2022-02-20 20:01:05,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {3569#true} assume 1 == ~p_dw_pc~0; {3569#true} is VALID [2022-02-20 20:01:05,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3569#true} is VALID [2022-02-20 20:01:05,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {3569#true} #res := ~__retres1~0; {3569#true} is VALID [2022-02-20 20:01:05,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,242 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3569#true} {3569#true} #1970#return; {3569#true} is VALID [2022-02-20 20:01:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {3569#true} havoc ~__retres1~1; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {3569#true} assume 1 == ~c_dr_pc~0; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {3569#true} #res := ~__retres1~1; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3569#true} {3569#true} #1972#return; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {3613#(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; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L272 TraceCheckUtils]: 1: Hoare triple {3569#true} call #t~ret8 := is_do_write_p_triggered(); {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} havoc ~__retres1~0; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {3569#true} assume 1 == ~p_dw_pc~0; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {3569#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3569#true} is VALID [2022-02-20 20:01:05,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {3569#true} #res := ~__retres1~0; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3569#true} {3569#true} #1970#return; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {3569#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {3569#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L272 TraceCheckUtils]: 10: Hoare triple {3569#true} call #t~ret9 := is_do_read_c_triggered(); {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {3569#true} havoc ~__retres1~1; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {3569#true} assume 1 == ~c_dr_pc~0; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {3569#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {3569#true} #res := ~__retres1~1; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3569#true} {3569#true} #1972#return; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {3569#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3569#true} is VALID [2022-02-20 20:01:05,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {3569#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3569#true} is VALID [2022-02-20 20:01:05,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,247 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3569#true} {3570#false} #1978#return; {3570#false} is VALID [2022-02-20 20:01:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {3611#(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; {3569#true} is VALID [2022-02-20 20:01:05,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {3569#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3569#true} is VALID [2022-02-20 20:01:05,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3569#true} {3570#false} #1980#return; {3570#false} is VALID [2022-02-20 20:01:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {3569#true} havoc ~__retres1~2; {3569#true} is VALID [2022-02-20 20:01:05,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3569#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3569#true} is VALID [2022-02-20 20:01:05,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} #res := ~__retres1~2; {3569#true} is VALID [2022-02-20 20:01:05,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,254 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3569#true} {3570#false} #1982#return; {3570#false} is VALID [2022-02-20 20:01:05,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {3569#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {3569#true} is VALID [2022-02-20 20:01:05,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {3569#true} is VALID [2022-02-20 20:01:05,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {3571#(= ~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; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {3571#(= ~q_read_ev~0 2)} call update_channels1(); {3609#(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:05,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(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); {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:05,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:05,256 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3610#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3571#(= ~q_read_ev~0 2)} #1974#return; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {3571#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {3571#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {3571#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {3571#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {3571#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:05,258 INFO L272 TraceCheckUtils]: 12: Hoare triple {3571#(= ~q_read_ev~0 2)} call fire_delta_events1(); {3611#(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:05,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {3611#(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; {3612#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:05,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {3612#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3612#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:05,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {3612#(= |old(~q_read_ev~0)| 0)} assume true; {3612#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:05,260 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3612#(= |old(~q_read_ev~0)| 0)} {3571#(= ~q_read_ev~0 2)} #1976#return; {3570#false} is VALID [2022-02-20 20:01:05,260 INFO L272 TraceCheckUtils]: 17: Hoare triple {3570#false} call activate_threads1(); {3613#(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:05,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {3613#(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; {3569#true} is VALID [2022-02-20 20:01:05,260 INFO L272 TraceCheckUtils]: 19: Hoare triple {3569#true} call #t~ret8 := is_do_write_p_triggered(); {3569#true} is VALID [2022-02-20 20:01:05,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {3569#true} havoc ~__retres1~0; {3569#true} is VALID [2022-02-20 20:01:05,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {3569#true} assume 1 == ~p_dw_pc~0; {3569#true} is VALID [2022-02-20 20:01:05,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {3569#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3569#true} is VALID [2022-02-20 20:01:05,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {3569#true} #res := ~__retres1~0; {3569#true} is VALID [2022-02-20 20:01:05,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3569#true} {3569#true} #1970#return; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {3569#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {3569#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L272 TraceCheckUtils]: 28: Hoare triple {3569#true} call #t~ret9 := is_do_read_c_triggered(); {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {3569#true} havoc ~__retres1~1; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {3569#true} assume 1 == ~c_dr_pc~0; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {3569#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {3569#true} #res := ~__retres1~1; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3569#true} {3569#true} #1972#return; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {3569#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,261 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3569#true} {3570#false} #1978#return; {3570#false} is VALID [2022-02-20 20:01:05,262 INFO L272 TraceCheckUtils]: 39: Hoare triple {3570#false} call reset_delta_events1(); {3611#(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:05,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {3611#(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; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3569#true} {3570#false} #1980#return; {3570#false} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {3570#false} assume !false; {3570#false} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {3570#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; {3570#false} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {3570#false} assume !false; {3570#false} is VALID [2022-02-20 20:01:05,262 INFO L272 TraceCheckUtils]: 47: Hoare triple {3570#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {3569#true} havoc ~__retres1~2; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {3569#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {3569#true} #res := ~__retres1~2; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {3569#true} assume true; {3569#true} is VALID [2022-02-20 20:01:05,262 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3569#true} {3570#false} #1982#return; {3570#false} is VALID [2022-02-20 20:01:05,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {3570#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; {3570#false} is VALID [2022-02-20 20:01:05,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {3570#false} assume 0 != eval1_~tmp___1~0#1; {3570#false} is VALID [2022-02-20 20:01:05,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {3570#false} assume !(0 == ~p_dw_st~0); {3570#false} is VALID [2022-02-20 20:01:05,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {3570#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; {3570#false} is VALID [2022-02-20 20:01:05,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {3570#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; {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {3570#false} assume !(0 == ~c_dr_pc~0); {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {3570#false} assume 2 == ~c_dr_pc~0; {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {3570#false} do_read_c_~a~0#1 := ~a_t~0; {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {3570#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; {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {3570#false} assume !(~p_last_write~0 == ~c_last_read~0); {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L272 TraceCheckUtils]: 63: Hoare triple {3570#false} call error1(); {3570#false} is VALID [2022-02-20 20:01:05,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {3570#false} assume !false; {3570#false} is VALID [2022-02-20 20:01:05,264 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:01:05,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:05,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904779749] [2022-02-20 20:01:05,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904779749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:05,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:05,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:05,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171311330] [2022-02-20 20:01:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:05,268 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:01:05,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:05,268 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:01:05,315 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:01:05,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:05,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:05,317 INFO L87 Difference]: Start difference. First operand 496 states and 764 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:01:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:08,425 INFO L93 Difference]: Finished difference Result 751 states and 1133 transitions. [2022-02-20 20:01:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:01:08,426 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:01:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:08,427 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:01:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1133 transitions. [2022-02-20 20:01:08,436 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:01:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1133 transitions. [2022-02-20 20:01:08,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1133 transitions. [2022-02-20 20:01:09,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1133 edges. 1133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:09,274 INFO L225 Difference]: With dead ends: 751 [2022-02-20 20:01:09,274 INFO L226 Difference]: Without dead ends: 647 [2022-02-20 20:01:09,278 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:01:09,280 INFO L933 BasicCegarLoop]: 773 mSDtfsCounter, 1638 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:09,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1645 Valid, 2206 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:01:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-02-20 20:01:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 608. [2022-02-20 20:01:09,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:09,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 608 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:09,314 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 608 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:09,315 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 608 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:09,340 INFO L93 Difference]: Finished difference Result 647 states and 977 transitions. [2022-02-20 20:01:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 977 transitions. [2022-02-20 20:01:09,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:09,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:09,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 608 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) Second operand 647 states. [2022-02-20 20:01:09,356 INFO L87 Difference]: Start difference. First operand has 608 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) Second operand 647 states. [2022-02-20 20:01:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:09,376 INFO L93 Difference]: Finished difference Result 647 states and 977 transitions. [2022-02-20 20:01:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 977 transitions. [2022-02-20 20:01:09,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:09,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:09,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:09,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 527 states have (on average 1.5294117647058822) internal successors, (806), 534 states have internal predecessors, (806), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 921 transitions. [2022-02-20 20:01:09,400 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 921 transitions. Word has length 65 [2022-02-20 20:01:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:09,402 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 921 transitions. [2022-02-20 20:01:09,402 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:01:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 921 transitions. [2022-02-20 20:01:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:09,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:09,403 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:01:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:01:09,404 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash -521394587, now seen corresponding path program 1 times [2022-02-20 20:01:09,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:09,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453291347] [2022-02-20 20:01:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {6778#(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); {6779#(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:09,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {6779#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {6779#(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:09,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6779#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {6740#(= ~q_write_ev~0 ~q_read_ev~0)} #1974#return; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {6779#(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); {6780#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {6780#(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; {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {6740#(= ~q_write_ev~0 ~q_read_ev~0)} #1976#return; {6739#false} is VALID [2022-02-20 20:01:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {6738#true} havoc ~__retres1~0; {6738#true} is VALID [2022-02-20 20:01:09,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume 1 == ~p_dw_pc~0; {6738#true} is VALID [2022-02-20 20:01:09,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6738#true} is VALID [2022-02-20 20:01:09,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {6738#true} #res := ~__retres1~0; {6738#true} is VALID [2022-02-20 20:01:09,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,532 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6738#true} {6738#true} #1970#return; {6738#true} is VALID [2022-02-20 20:01:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {6738#true} havoc ~__retres1~1; {6738#true} is VALID [2022-02-20 20:01:09,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume 1 == ~c_dr_pc~0; {6738#true} is VALID [2022-02-20 20:01:09,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6738#true} is VALID [2022-02-20 20:01:09,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {6738#true} #res := ~__retres1~1; {6738#true} is VALID [2022-02-20 20:01:09,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,535 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6738#true} {6738#true} #1972#return; {6738#true} is VALID [2022-02-20 20:01:09,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {6782#(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; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L272 TraceCheckUtils]: 1: Hoare triple {6738#true} call #t~ret8 := is_do_write_p_triggered(); {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} havoc ~__retres1~0; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {6738#true} assume 1 == ~p_dw_pc~0; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {6738#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {6738#true} #res := ~__retres1~0; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6738#true} {6738#true} #1970#return; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {6738#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {6738#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L272 TraceCheckUtils]: 10: Hoare triple {6738#true} call #t~ret9 := is_do_read_c_triggered(); {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {6738#true} havoc ~__retres1~1; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {6738#true} assume 1 == ~c_dr_pc~0; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {6738#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {6738#true} #res := ~__retres1~1; {6738#true} is VALID [2022-02-20 20:01:09,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,537 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6738#true} {6738#true} #1972#return; {6738#true} is VALID [2022-02-20 20:01:09,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {6738#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6738#true} is VALID [2022-02-20 20:01:09,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {6738#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6738#true} is VALID [2022-02-20 20:01:09,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,537 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6738#true} {6739#false} #1978#return; {6739#false} is VALID [2022-02-20 20:01:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {6779#(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); {6738#true} is VALID [2022-02-20 20:01:09,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6738#true} is VALID [2022-02-20 20:01:09,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6738#true} {6739#false} #1980#return; {6739#false} is VALID [2022-02-20 20:01:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {6738#true} havoc ~__retres1~2; {6738#true} is VALID [2022-02-20 20:01:09,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6738#true} is VALID [2022-02-20 20:01:09,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} #res := ~__retres1~2; {6738#true} is VALID [2022-02-20 20:01:09,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,552 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6738#true} {6739#false} #1982#return; {6739#false} is VALID [2022-02-20 20:01:09,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {6738#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {6738#true} is VALID [2022-02-20 20:01:09,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {6738#true} is VALID [2022-02-20 20:01:09,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {6740#(= ~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; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {6740#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {6778#(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:09,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {6778#(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); {6779#(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:09,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {6779#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {6779#(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:09,555 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6779#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {6740#(= ~q_write_ev~0 ~q_read_ev~0)} #1974#return; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {6740#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {6740#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {6740#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {6740#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {6740#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,557 INFO L272 TraceCheckUtils]: 12: Hoare triple {6740#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {6779#(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:09,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {6779#(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); {6780#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {6780#(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; {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,559 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6781#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {6740#(= ~q_write_ev~0 ~q_read_ev~0)} #1976#return; {6739#false} is VALID [2022-02-20 20:01:09,559 INFO L272 TraceCheckUtils]: 17: Hoare triple {6739#false} call activate_threads1(); {6782#(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:09,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {6782#(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; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L272 TraceCheckUtils]: 19: Hoare triple {6738#true} call #t~ret8 := is_do_write_p_triggered(); {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {6738#true} havoc ~__retres1~0; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {6738#true} assume 1 == ~p_dw_pc~0; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {6738#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {6738#true} #res := ~__retres1~0; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6738#true} {6738#true} #1970#return; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {6738#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {6738#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6738#true} is VALID [2022-02-20 20:01:09,559 INFO L272 TraceCheckUtils]: 28: Hoare triple {6738#true} call #t~ret9 := is_do_read_c_triggered(); {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {6738#true} havoc ~__retres1~1; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {6738#true} assume 1 == ~c_dr_pc~0; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {6738#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {6738#true} #res := ~__retres1~1; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6738#true} {6738#true} #1972#return; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {6738#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {6738#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6738#true} {6739#false} #1978#return; {6739#false} is VALID [2022-02-20 20:01:09,560 INFO L272 TraceCheckUtils]: 39: Hoare triple {6739#false} call reset_delta_events1(); {6779#(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:09,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {6779#(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); {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {6738#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,560 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6738#true} {6739#false} #1980#return; {6739#false} is VALID [2022-02-20 20:01:09,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {6739#false} assume !false; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {6739#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; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {6739#false} assume !false; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L272 TraceCheckUtils]: 47: Hoare triple {6739#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6738#true} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {6738#true} havoc ~__retres1~2; {6738#true} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {6738#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6738#true} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {6738#true} #res := ~__retres1~2; {6738#true} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-02-20 20:01:09,561 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6738#true} {6739#false} #1982#return; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {6739#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; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {6739#false} assume 0 != eval1_~tmp___1~0#1; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {6739#false} assume !(0 == ~p_dw_st~0); {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {6739#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; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {6739#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; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {6739#false} assume !(0 == ~c_dr_pc~0); {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {6739#false} assume 2 == ~c_dr_pc~0; {6739#false} is VALID [2022-02-20 20:01:09,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {6739#false} do_read_c_~a~0#1 := ~a_t~0; {6739#false} is VALID [2022-02-20 20:01:09,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {6739#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; {6739#false} is VALID [2022-02-20 20:01:09,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {6739#false} assume !(~p_last_write~0 == ~c_last_read~0); {6739#false} is VALID [2022-02-20 20:01:09,562 INFO L272 TraceCheckUtils]: 63: Hoare triple {6739#false} call error1(); {6739#false} is VALID [2022-02-20 20:01:09,562 INFO L290 TraceCheckUtils]: 64: Hoare triple {6739#false} assume !false; {6739#false} is VALID [2022-02-20 20:01:09,562 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:01:09,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:09,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453291347] [2022-02-20 20:01:09,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453291347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:09,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:09,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:09,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122419621] [2022-02-20 20:01:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:09,563 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:01:09,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:09,563 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:01:09,606 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:01:09,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:09,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:09,607 INFO L87 Difference]: Start difference. First operand 608 states and 921 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:01:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:13,531 INFO L93 Difference]: Finished difference Result 1005 states and 1486 transitions. [2022-02-20 20:01:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:01:13,532 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:01:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:13,532 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:01:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1163 transitions. [2022-02-20 20:01:13,551 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:01:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1163 transitions. [2022-02-20 20:01:13,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1163 transitions. [2022-02-20 20:01:14,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1163 edges. 1163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:14,359 INFO L225 Difference]: With dead ends: 1005 [2022-02-20 20:01:14,360 INFO L226 Difference]: Without dead ends: 796 [2022-02-20 20:01:14,362 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:01:14,366 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 1470 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:14,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 2953 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-02-20 20:01:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 720. [2022-02-20 20:01:14,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:14,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 796 states. Second operand has 720 states, 617 states have (on average 1.5089141004862237) internal successors, (931), 626 states have internal predecessors, (931), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:14,394 INFO L74 IsIncluded]: Start isIncluded. First operand 796 states. Second operand has 720 states, 617 states have (on average 1.5089141004862237) internal successors, (931), 626 states have internal predecessors, (931), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:14,395 INFO L87 Difference]: Start difference. First operand 796 states. Second operand has 720 states, 617 states have (on average 1.5089141004862237) internal successors, (931), 626 states have internal predecessors, (931), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,421 INFO L93 Difference]: Finished difference Result 796 states and 1194 transitions. [2022-02-20 20:01:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1194 transitions. [2022-02-20 20:01:14,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:14,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:14,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 720 states, 617 states have (on average 1.5089141004862237) internal successors, (931), 626 states have internal predecessors, (931), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) Second operand 796 states. [2022-02-20 20:01:14,426 INFO L87 Difference]: Start difference. First operand has 720 states, 617 states have (on average 1.5089141004862237) internal successors, (931), 626 states have internal predecessors, (931), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) Second operand 796 states. [2022-02-20 20:01:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,450 INFO L93 Difference]: Finished difference Result 796 states and 1194 transitions. [2022-02-20 20:01:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1194 transitions. [2022-02-20 20:01:14,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:14,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:14,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:14,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 617 states have (on average 1.5089141004862237) internal successors, (931), 626 states have internal predecessors, (931), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1080 transitions. [2022-02-20 20:01:14,477 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1080 transitions. Word has length 65 [2022-02-20 20:01:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:14,477 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1080 transitions. [2022-02-20 20:01:14,477 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:01:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1080 transitions. [2022-02-20 20:01:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:14,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:14,480 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:01:14,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:01:14,480 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:14,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1744986599, now seen corresponding path program 1 times [2022-02-20 20:01:14,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:14,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167679063] [2022-02-20 20:01:14,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {10741#(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); {10742#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:14,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {10742#(not (= |old(~q_req_up~0)| 1))} assume true; {10742#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:14,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10742#(not (= |old(~q_req_up~0)| 1))} {10702#(= ~q_req_up~0 ~p_dw_pc~0)} #1974#return; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {10743#(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); {10699#true} is VALID [2022-02-20 20:01:14,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {10699#true} assume !(0 == ~q_write_ev~0); {10699#true} is VALID [2022-02-20 20:01:14,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10699#true} {10706#(not (= ~p_dw_pc~0 1))} #1976#return; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {10699#true} havoc ~__retres1~0; {10699#true} is VALID [2022-02-20 20:01:14,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {10699#true} assume 1 == ~p_dw_pc~0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,590 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} {10699#true} #1970#return; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {10699#true} havoc ~__retres1~1; {10699#true} is VALID [2022-02-20 20:01:14,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {10699#true} assume 1 == ~c_dr_pc~0; {10699#true} is VALID [2022-02-20 20:01:14,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {10699#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10699#true} is VALID [2022-02-20 20:01:14,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {10699#true} #res := ~__retres1~1; {10699#true} is VALID [2022-02-20 20:01:14,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,595 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10699#true} {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} #1972#return; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {10744#(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; {10699#true} is VALID [2022-02-20 20:01:14,595 INFO L272 TraceCheckUtils]: 1: Hoare triple {10699#true} call #t~ret8 := is_do_write_p_triggered(); {10699#true} is VALID [2022-02-20 20:01:14,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {10699#true} havoc ~__retres1~0; {10699#true} is VALID [2022-02-20 20:01:14,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {10699#true} assume 1 == ~p_dw_pc~0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,597 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} {10699#true} #1970#return; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,597 INFO L272 TraceCheckUtils]: 10: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {10699#true} is VALID [2022-02-20 20:01:14,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {10699#true} havoc ~__retres1~1; {10699#true} is VALID [2022-02-20 20:01:14,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {10699#true} assume 1 == ~c_dr_pc~0; {10699#true} is VALID [2022-02-20 20:01:14,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {10699#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10699#true} is VALID [2022-02-20 20:01:14,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {10699#true} #res := ~__retres1~1; {10699#true} is VALID [2022-02-20 20:01:14,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,607 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10699#true} {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} #1972#return; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,609 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} {10706#(not (= ~p_dw_pc~0 1))} #1978#return; {10700#false} is VALID [2022-02-20 20:01:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {10743#(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); {10699#true} is VALID [2022-02-20 20:01:14,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {10699#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10699#true} is VALID [2022-02-20 20:01:14,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10699#true} {10700#false} #1980#return; {10700#false} is VALID [2022-02-20 20:01:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {10699#true} havoc ~__retres1~2; {10699#true} is VALID [2022-02-20 20:01:14,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {10699#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10699#true} is VALID [2022-02-20 20:01:14,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {10699#true} #res := ~__retres1~2; {10699#true} is VALID [2022-02-20 20:01:14,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,623 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10699#true} {10700#false} #1982#return; {10700#false} is VALID [2022-02-20 20:01:14,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {10699#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {10701#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:14,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {10701#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {10701#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:14,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {10701#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {10702#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:14,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {10702#(= ~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; {10702#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:14,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {10702#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {10741#(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:14,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {10741#(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); {10742#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:14,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {10742#(not (= |old(~q_req_up~0)| 1))} assume true; {10742#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:14,628 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10742#(not (= |old(~q_req_up~0)| 1))} {10702#(= ~q_req_up~0 ~p_dw_pc~0)} #1974#return; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {10706#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {10706#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {10706#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {10706#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,629 INFO L272 TraceCheckUtils]: 12: Hoare triple {10706#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {10743#(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:14,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(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); {10699#true} is VALID [2022-02-20 20:01:14,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {10699#true} assume !(0 == ~q_write_ev~0); {10699#true} is VALID [2022-02-20 20:01:14,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,630 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10699#true} {10706#(not (= ~p_dw_pc~0 1))} #1976#return; {10706#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:14,630 INFO L272 TraceCheckUtils]: 17: Hoare triple {10706#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {10744#(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:14,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {10744#(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; {10699#true} is VALID [2022-02-20 20:01:14,630 INFO L272 TraceCheckUtils]: 19: Hoare triple {10699#true} call #t~ret8 := is_do_write_p_triggered(); {10699#true} is VALID [2022-02-20 20:01:14,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {10699#true} havoc ~__retres1~0; {10699#true} is VALID [2022-02-20 20:01:14,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {10699#true} assume 1 == ~p_dw_pc~0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,632 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} {10699#true} #1970#return; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {10699#true} is VALID [2022-02-20 20:01:14,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {10699#true} havoc ~__retres1~1; {10699#true} is VALID [2022-02-20 20:01:14,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {10699#true} assume 1 == ~c_dr_pc~0; {10699#true} is VALID [2022-02-20 20:01:14,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {10699#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10699#true} is VALID [2022-02-20 20:01:14,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {10699#true} #res := ~__retres1~1; {10699#true} is VALID [2022-02-20 20:01:14,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,633 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10699#true} {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} #1972#return; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:14,635 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10751#(= (+ (- 1) ~p_dw_pc~0) 0)} {10706#(not (= ~p_dw_pc~0 1))} #1978#return; {10700#false} is VALID [2022-02-20 20:01:14,635 INFO L272 TraceCheckUtils]: 39: Hoare triple {10700#false} call reset_delta_events1(); {10743#(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:14,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {10743#(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); {10699#true} is VALID [2022-02-20 20:01:14,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {10699#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10699#true} is VALID [2022-02-20 20:01:14,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,636 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10699#true} {10700#false} #1980#return; {10700#false} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {10700#false} assume !false; {10700#false} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {10700#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; {10700#false} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {10700#false} assume !false; {10700#false} is VALID [2022-02-20 20:01:14,636 INFO L272 TraceCheckUtils]: 47: Hoare triple {10700#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10699#true} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {10699#true} havoc ~__retres1~2; {10699#true} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {10699#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10699#true} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {10699#true} #res := ~__retres1~2; {10699#true} is VALID [2022-02-20 20:01:14,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {10699#true} assume true; {10699#true} is VALID [2022-02-20 20:01:14,637 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10699#true} {10700#false} #1982#return; {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {10700#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; {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {10700#false} assume 0 != eval1_~tmp___1~0#1; {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {10700#false} assume !(0 == ~p_dw_st~0); {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {10700#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; {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {10700#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; {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {10700#false} assume !(0 == ~c_dr_pc~0); {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {10700#false} assume 2 == ~c_dr_pc~0; {10700#false} is VALID [2022-02-20 20:01:14,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {10700#false} do_read_c_~a~0#1 := ~a_t~0; {10700#false} is VALID [2022-02-20 20:01:14,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {10700#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; {10700#false} is VALID [2022-02-20 20:01:14,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {10700#false} assume !(~p_last_write~0 == ~c_last_read~0); {10700#false} is VALID [2022-02-20 20:01:14,638 INFO L272 TraceCheckUtils]: 63: Hoare triple {10700#false} call error1(); {10700#false} is VALID [2022-02-20 20:01:14,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {10700#false} assume !false; {10700#false} is VALID [2022-02-20 20:01:14,639 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:01:14,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:14,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167679063] [2022-02-20 20:01:14,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167679063] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:14,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:14,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:14,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370798253] [2022-02-20 20:01:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:14,641 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:01:14,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:14,642 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:01:14,673 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:01:14,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:14,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:14,675 INFO L87 Difference]: Start difference. First operand 720 states and 1080 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:01:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:21,299 INFO L93 Difference]: Finished difference Result 2266 states and 3277 transitions. [2022-02-20 20:01:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:21,299 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:01:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:21,301 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:01:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1568 transitions. [2022-02-20 20:01:21,311 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:01:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1568 transitions. [2022-02-20 20:01:21,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1568 transitions. [2022-02-20 20:01:22,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1568 edges. 1568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:22,557 INFO L225 Difference]: With dead ends: 2266 [2022-02-20 20:01:22,557 INFO L226 Difference]: Without dead ends: 1933 [2022-02-20 20:01:22,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:22,559 INFO L933 BasicCegarLoop]: 897 mSDtfsCounter, 3875 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3893 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:22,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3893 Valid, 3297 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 20:01:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-02-20 20:01:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1773. [2022-02-20 20:01:22,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:22,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1933 states. Second operand has 1773 states, 1465 states have (on average 1.4177474402730375) internal successors, (2077), 1489 states have internal predecessors, (2077), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:22,624 INFO L74 IsIncluded]: Start isIncluded. First operand 1933 states. Second operand has 1773 states, 1465 states have (on average 1.4177474402730375) internal successors, (2077), 1489 states have internal predecessors, (2077), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:22,627 INFO L87 Difference]: Start difference. First operand 1933 states. Second operand has 1773 states, 1465 states have (on average 1.4177474402730375) internal successors, (2077), 1489 states have internal predecessors, (2077), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:22,740 INFO L93 Difference]: Finished difference Result 1933 states and 2681 transitions. [2022-02-20 20:01:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2681 transitions. [2022-02-20 20:01:22,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:22,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:22,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 1773 states, 1465 states have (on average 1.4177474402730375) internal successors, (2077), 1489 states have internal predecessors, (2077), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) Second operand 1933 states. [2022-02-20 20:01:22,750 INFO L87 Difference]: Start difference. First operand has 1773 states, 1465 states have (on average 1.4177474402730375) internal successors, (2077), 1489 states have internal predecessors, (2077), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) Second operand 1933 states. [2022-02-20 20:01:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:22,861 INFO L93 Difference]: Finished difference Result 1933 states and 2681 transitions. [2022-02-20 20:01:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2681 transitions. [2022-02-20 20:01:22,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:22,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:22,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:22,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1465 states have (on average 1.4177474402730375) internal successors, (2077), 1489 states have internal predecessors, (2077), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2469 transitions. [2022-02-20 20:01:22,993 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2469 transitions. Word has length 65 [2022-02-20 20:01:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:22,993 INFO L470 AbstractCegarLoop]: Abstraction has 1773 states and 2469 transitions. [2022-02-20 20:01:22,999 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:01:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2469 transitions. [2022-02-20 20:01:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:23,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:23,001 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:01:23,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:23,001 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 813039065, now seen corresponding path program 1 times [2022-02-20 20:01:23,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:23,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123828840] [2022-02-20 20:01:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {20143#(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); {20103#true} is VALID [2022-02-20 20:01:23,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20103#true} {20103#true} #1974#return; {20103#true} is VALID [2022-02-20 20:01:23,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {20144#(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); {20103#true} is VALID [2022-02-20 20:01:23,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume !(0 == ~q_write_ev~0); {20103#true} is VALID [2022-02-20 20:01:23,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20103#true} {20103#true} #1976#return; {20103#true} is VALID [2022-02-20 20:01:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {20103#true} havoc ~__retres1~0; {20103#true} is VALID [2022-02-20 20:01:23,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume !(1 == ~p_dw_pc~0); {20103#true} is VALID [2022-02-20 20:01:23,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} assume !(2 == ~p_dw_pc~0); {20103#true} is VALID [2022-02-20 20:01:23,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {20103#true} ~__retres1~0 := 0; {20161#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:23,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {20161#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:23,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:23,120 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {20103#true} #1970#return; {20153#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {20103#true} havoc ~__retres1~1; {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume 1 == ~c_dr_pc~0; {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {20103#true} #res := ~__retres1~1; {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20103#true} {20104#false} #1972#return; {20104#false} is VALID [2022-02-20 20:01:23,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {20145#(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; {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L272 TraceCheckUtils]: 1: Hoare triple {20103#true} call #t~ret8 := is_do_write_p_triggered(); {20103#true} is VALID [2022-02-20 20:01:23,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} havoc ~__retres1~0; {20103#true} is VALID [2022-02-20 20:01:23,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {20103#true} assume !(1 == ~p_dw_pc~0); {20103#true} is VALID [2022-02-20 20:01:23,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {20103#true} assume !(2 == ~p_dw_pc~0); {20103#true} is VALID [2022-02-20 20:01:23,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {20103#true} ~__retres1~0 := 0; {20161#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:23,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {20161#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:23,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:23,130 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {20103#true} #1970#return; {20153#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:23,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#(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; {20154#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:23,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {20154#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {20104#false} is VALID [2022-02-20 20:01:23,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {20104#false} call #t~ret9 := is_do_read_c_triggered(); {20103#true} is VALID [2022-02-20 20:01:23,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {20103#true} havoc ~__retres1~1; {20103#true} is VALID [2022-02-20 20:01:23,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {20103#true} assume 1 == ~c_dr_pc~0; {20103#true} is VALID [2022-02-20 20:01:23,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {20103#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {20103#true} is VALID [2022-02-20 20:01:23,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {20103#true} #res := ~__retres1~1; {20103#true} is VALID [2022-02-20 20:01:23,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,132 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20103#true} {20104#false} #1972#return; {20104#false} is VALID [2022-02-20 20:01:23,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {20104#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20104#false} is VALID [2022-02-20 20:01:23,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {20104#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {20104#false} is VALID [2022-02-20 20:01:23,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {20104#false} assume true; {20104#false} is VALID [2022-02-20 20:01:23,132 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20104#false} {20103#true} #1978#return; {20104#false} is VALID [2022-02-20 20:01:23,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {20144#(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); {20103#true} is VALID [2022-02-20 20:01:23,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {20103#true} is VALID [2022-02-20 20:01:23,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20103#true} {20104#false} #1980#return; {20104#false} is VALID [2022-02-20 20:01:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {20103#true} havoc ~__retres1~2; {20103#true} is VALID [2022-02-20 20:01:23,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20103#true} is VALID [2022-02-20 20:01:23,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} #res := ~__retres1~2; {20103#true} is VALID [2022-02-20 20:01:23,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,140 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20103#true} {20104#false} #1982#return; {20104#false} is VALID [2022-02-20 20:01:23,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {20103#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {20103#true} is VALID [2022-02-20 20:01:23,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {20103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {20103#true} is VALID [2022-02-20 20:01:23,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {20103#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {20103#true} is VALID [2022-02-20 20:01:23,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {20103#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; {20103#true} is VALID [2022-02-20 20:01:23,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {20103#true} call update_channels1(); {20143#(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:23,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {20143#(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); {20103#true} is VALID [2022-02-20 20:01:23,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,141 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20103#true} {20103#true} #1974#return; {20103#true} is VALID [2022-02-20 20:01:23,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {20103#true} assume { :begin_inline_init_threads1 } true; {20103#true} is VALID [2022-02-20 20:01:23,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {20103#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20103#true} is VALID [2022-02-20 20:01:23,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {20103#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20103#true} is VALID [2022-02-20 20:01:23,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {20103#true} assume { :end_inline_init_threads1 } true; {20103#true} is VALID [2022-02-20 20:01:23,142 INFO L272 TraceCheckUtils]: 12: Hoare triple {20103#true} call fire_delta_events1(); {20144#(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:23,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {20144#(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); {20103#true} is VALID [2022-02-20 20:01:23,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {20103#true} assume !(0 == ~q_write_ev~0); {20103#true} is VALID [2022-02-20 20:01:23,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,143 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20103#true} {20103#true} #1976#return; {20103#true} is VALID [2022-02-20 20:01:23,143 INFO L272 TraceCheckUtils]: 17: Hoare triple {20103#true} call activate_threads1(); {20145#(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:23,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {20145#(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; {20103#true} is VALID [2022-02-20 20:01:23,143 INFO L272 TraceCheckUtils]: 19: Hoare triple {20103#true} call #t~ret8 := is_do_write_p_triggered(); {20103#true} is VALID [2022-02-20 20:01:23,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {20103#true} havoc ~__retres1~0; {20103#true} is VALID [2022-02-20 20:01:23,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {20103#true} assume !(1 == ~p_dw_pc~0); {20103#true} is VALID [2022-02-20 20:01:23,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {20103#true} assume !(2 == ~p_dw_pc~0); {20103#true} is VALID [2022-02-20 20:01:23,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {20103#true} ~__retres1~0 := 0; {20161#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:23,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {20161#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:23,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:23,145 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20162#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {20103#true} #1970#return; {20153#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:23,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#(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; {20154#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:23,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {20154#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {20104#false} is VALID [2022-02-20 20:01:23,146 INFO L272 TraceCheckUtils]: 29: Hoare triple {20104#false} call #t~ret9 := is_do_read_c_triggered(); {20103#true} is VALID [2022-02-20 20:01:23,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {20103#true} havoc ~__retres1~1; {20103#true} is VALID [2022-02-20 20:01:23,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {20103#true} assume 1 == ~c_dr_pc~0; {20103#true} is VALID [2022-02-20 20:01:23,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {20103#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {20103#true} is VALID [2022-02-20 20:01:23,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {20103#true} #res := ~__retres1~1; {20103#true} is VALID [2022-02-20 20:01:23,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,147 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20103#true} {20104#false} #1972#return; {20104#false} is VALID [2022-02-20 20:01:23,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {20104#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20104#false} is VALID [2022-02-20 20:01:23,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {20104#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {20104#false} is VALID [2022-02-20 20:01:23,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {20104#false} assume true; {20104#false} is VALID [2022-02-20 20:01:23,147 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20104#false} {20103#true} #1978#return; {20104#false} is VALID [2022-02-20 20:01:23,147 INFO L272 TraceCheckUtils]: 40: Hoare triple {20104#false} call reset_delta_events1(); {20144#(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:23,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {20144#(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); {20103#true} is VALID [2022-02-20 20:01:23,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {20103#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {20103#true} is VALID [2022-02-20 20:01:23,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,147 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20103#true} {20104#false} #1980#return; {20104#false} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {20104#false} assume !false; {20104#false} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {20104#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; {20104#false} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {20104#false} assume !false; {20104#false} is VALID [2022-02-20 20:01:23,148 INFO L272 TraceCheckUtils]: 48: Hoare triple {20104#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20103#true} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {20103#true} havoc ~__retres1~2; {20103#true} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {20103#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20103#true} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {20103#true} #res := ~__retres1~2; {20103#true} is VALID [2022-02-20 20:01:23,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {20103#true} assume true; {20103#true} is VALID [2022-02-20 20:01:23,148 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20103#true} {20104#false} #1982#return; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {20104#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; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {20104#false} assume 0 != eval1_~tmp___1~0#1; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {20104#false} assume !(0 == ~p_dw_st~0); {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {20104#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; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {20104#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; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {20104#false} assume !(0 == ~c_dr_pc~0); {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {20104#false} assume 2 == ~c_dr_pc~0; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {20104#false} do_read_c_~a~0#1 := ~a_t~0; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {20104#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; {20104#false} is VALID [2022-02-20 20:01:23,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {20104#false} assume !(~p_last_write~0 == ~c_last_read~0); {20104#false} is VALID [2022-02-20 20:01:23,150 INFO L272 TraceCheckUtils]: 64: Hoare triple {20104#false} call error1(); {20104#false} is VALID [2022-02-20 20:01:23,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {20104#false} assume !false; {20104#false} is VALID [2022-02-20 20:01:23,150 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:01:23,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:23,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123828840] [2022-02-20 20:01:23,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123828840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:23,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:23,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:23,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039832495] [2022-02-20 20:01:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:23,151 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:01:23,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:23,152 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:01:23,183 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:01:23,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:23,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:23,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:23,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:23,184 INFO L87 Difference]: Start difference. First operand 1773 states and 2469 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:01:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:27,337 INFO L93 Difference]: Finished difference Result 3301 states and 4548 transitions. [2022-02-20 20:01:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:01:27,337 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:01:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:27,338 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:01:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 945 transitions. [2022-02-20 20:01:27,346 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:01:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 945 transitions. [2022-02-20 20:01:27,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 945 transitions. [2022-02-20 20:01:27,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 945 edges. 945 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:28,134 INFO L225 Difference]: With dead ends: 3301 [2022-02-20 20:01:28,134 INFO L226 Difference]: Without dead ends: 1921 [2022-02-20 20:01:28,136 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:01:28,137 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 995 mSDsluCounter, 2261 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:28,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [996 Valid, 3013 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:01:28,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-02-20 20:01:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1813. [2022-02-20 20:01:28,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:28,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1921 states. Second operand has 1813 states, 1497 states have (on average 1.404809619238477) internal successors, (2103), 1521 states have internal predecessors, (2103), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:28,228 INFO L74 IsIncluded]: Start isIncluded. First operand 1921 states. Second operand has 1813 states, 1497 states have (on average 1.404809619238477) internal successors, (2103), 1521 states have internal predecessors, (2103), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:28,230 INFO L87 Difference]: Start difference. First operand 1921 states. Second operand has 1813 states, 1497 states have (on average 1.404809619238477) internal successors, (2103), 1521 states have internal predecessors, (2103), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,331 INFO L93 Difference]: Finished difference Result 1921 states and 2657 transitions. [2022-02-20 20:01:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2657 transitions. [2022-02-20 20:01:28,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:28,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:28,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 1813 states, 1497 states have (on average 1.404809619238477) internal successors, (2103), 1521 states have internal predecessors, (2103), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) Second operand 1921 states. [2022-02-20 20:01:28,341 INFO L87 Difference]: Start difference. First operand has 1813 states, 1497 states have (on average 1.404809619238477) internal successors, (2103), 1521 states have internal predecessors, (2103), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) Second operand 1921 states. [2022-02-20 20:01:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,449 INFO L93 Difference]: Finished difference Result 1921 states and 2657 transitions. [2022-02-20 20:01:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2657 transitions. [2022-02-20 20:01:28,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:28,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:28,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:28,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1497 states have (on average 1.404809619238477) internal successors, (2103), 1521 states have internal predecessors, (2103), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2503 transitions. [2022-02-20 20:01:28,603 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2503 transitions. Word has length 66 [2022-02-20 20:01:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:28,603 INFO L470 AbstractCegarLoop]: Abstraction has 1813 states and 2503 transitions. [2022-02-20 20:01:28,603 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:01:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2503 transitions. [2022-02-20 20:01:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:28,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:28,604 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:01:28,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:28,605 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash -216320233, now seen corresponding path program 1 times [2022-02-20 20:01:28,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:28,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305707239] [2022-02-20 20:01:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {30901#(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); {30902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:28,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {30902#(not (= |old(~q_req_up~0)| 1))} assume true; {30902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:28,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30902#(not (= |old(~q_req_up~0)| 1))} {30861#(= ~c_dr_pc~0 ~q_req_up~0)} #1974#return; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {30903#(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); {30858#true} is VALID [2022-02-20 20:01:28,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {30858#true} assume !(0 == ~q_write_ev~0); {30858#true} is VALID [2022-02-20 20:01:28,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30858#true} {30865#(not (= ~c_dr_pc~0 1))} #1976#return; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {30858#true} havoc ~__retres1~0; {30858#true} is VALID [2022-02-20 20:01:28,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {30858#true} assume !(1 == ~p_dw_pc~0); {30858#true} is VALID [2022-02-20 20:01:28,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {30858#true} assume !(2 == ~p_dw_pc~0); {30858#true} is VALID [2022-02-20 20:01:28,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {30858#true} ~__retres1~0 := 0; {30858#true} is VALID [2022-02-20 20:01:28,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {30858#true} #res := ~__retres1~0; {30858#true} is VALID [2022-02-20 20:01:28,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,710 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30858#true} {30858#true} #1970#return; {30858#true} is VALID [2022-02-20 20:01:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {30858#true} havoc ~__retres1~1; {30858#true} is VALID [2022-02-20 20:01:28,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {30858#true} assume 1 == ~c_dr_pc~0; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,716 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} {30858#true} #1972#return; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {30904#(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; {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L272 TraceCheckUtils]: 1: Hoare triple {30858#true} call #t~ret8 := is_do_write_p_triggered(); {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {30858#true} havoc ~__retres1~0; {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {30858#true} assume !(1 == ~p_dw_pc~0); {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {30858#true} assume !(2 == ~p_dw_pc~0); {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {30858#true} ~__retres1~0 := 0; {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {30858#true} #res := ~__retres1~0; {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30858#true} {30858#true} #1970#return; {30858#true} is VALID [2022-02-20 20:01:28,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {30858#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30858#true} is VALID [2022-02-20 20:01:28,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {30858#true} assume !(0 != ~tmp~1); {30858#true} is VALID [2022-02-20 20:01:28,718 INFO L272 TraceCheckUtils]: 11: Hoare triple {30858#true} call #t~ret9 := is_do_read_c_triggered(); {30858#true} is VALID [2022-02-20 20:01:28,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {30858#true} havoc ~__retres1~1; {30858#true} is VALID [2022-02-20 20:01:28,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {30858#true} assume 1 == ~c_dr_pc~0; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,719 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} {30858#true} #1972#return; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,720 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} {30865#(not (= ~c_dr_pc~0 1))} #1978#return; {30859#false} is VALID [2022-02-20 20:01:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {30903#(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); {30858#true} is VALID [2022-02-20 20:01:28,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {30858#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30858#true} is VALID [2022-02-20 20:01:28,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30858#true} {30859#false} #1980#return; {30859#false} is VALID [2022-02-20 20:01:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {30858#true} havoc ~__retres1~2; {30858#true} is VALID [2022-02-20 20:01:28,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {30858#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30858#true} is VALID [2022-02-20 20:01:28,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {30858#true} #res := ~__retres1~2; {30858#true} is VALID [2022-02-20 20:01:28,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,729 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30858#true} {30859#false} #1982#return; {30859#false} is VALID [2022-02-20 20:01:28,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {30858#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {30860#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:28,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {30860#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {30860#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:28,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {30860#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {30861#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:28,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {30861#(= ~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; {30861#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:28,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {30861#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {30901#(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:28,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {30901#(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); {30902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:28,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {30902#(not (= |old(~q_req_up~0)| 1))} assume true; {30902#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:28,732 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30902#(not (= |old(~q_req_up~0)| 1))} {30861#(= ~c_dr_pc~0 ~q_req_up~0)} #1974#return; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {30865#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {30865#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {30865#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {30865#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,733 INFO L272 TraceCheckUtils]: 12: Hoare triple {30865#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {30903#(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:28,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {30903#(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); {30858#true} is VALID [2022-02-20 20:01:28,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {30858#true} assume !(0 == ~q_write_ev~0); {30858#true} is VALID [2022-02-20 20:01:28,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,734 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30858#true} {30865#(not (= ~c_dr_pc~0 1))} #1976#return; {30865#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:28,734 INFO L272 TraceCheckUtils]: 17: Hoare triple {30865#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {30904#(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:28,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {30904#(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; {30858#true} is VALID [2022-02-20 20:01:28,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {30858#true} call #t~ret8 := is_do_write_p_triggered(); {30858#true} is VALID [2022-02-20 20:01:28,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {30858#true} havoc ~__retres1~0; {30858#true} is VALID [2022-02-20 20:01:28,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {30858#true} assume !(1 == ~p_dw_pc~0); {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {30858#true} assume !(2 == ~p_dw_pc~0); {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {30858#true} ~__retres1~0 := 0; {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {30858#true} #res := ~__retres1~0; {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30858#true} {30858#true} #1970#return; {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {30858#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {30858#true} assume !(0 != ~tmp~1); {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L272 TraceCheckUtils]: 29: Hoare triple {30858#true} call #t~ret9 := is_do_read_c_triggered(); {30858#true} is VALID [2022-02-20 20:01:28,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {30858#true} havoc ~__retres1~1; {30858#true} is VALID [2022-02-20 20:01:28,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {30858#true} assume 1 == ~c_dr_pc~0; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,737 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} {30858#true} #1972#return; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:28,738 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30918#(= (+ (- 1) ~c_dr_pc~0) 0)} {30865#(not (= ~c_dr_pc~0 1))} #1978#return; {30859#false} is VALID [2022-02-20 20:01:28,738 INFO L272 TraceCheckUtils]: 40: Hoare triple {30859#false} call reset_delta_events1(); {30903#(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:28,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {30903#(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); {30858#true} is VALID [2022-02-20 20:01:28,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {30858#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30858#true} is VALID [2022-02-20 20:01:28,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,738 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30858#true} {30859#false} #1980#return; {30859#false} is VALID [2022-02-20 20:01:28,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {30859#false} assume !false; {30859#false} is VALID [2022-02-20 20:01:28,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {30859#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; {30859#false} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {30859#false} assume !false; {30859#false} is VALID [2022-02-20 20:01:28,739 INFO L272 TraceCheckUtils]: 48: Hoare triple {30859#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30858#true} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {30858#true} havoc ~__retres1~2; {30858#true} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {30858#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30858#true} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {30858#true} #res := ~__retres1~2; {30858#true} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {30858#true} assume true; {30858#true} is VALID [2022-02-20 20:01:28,739 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {30858#true} {30859#false} #1982#return; {30859#false} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {30859#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; {30859#false} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {30859#false} assume 0 != eval1_~tmp___1~0#1; {30859#false} is VALID [2022-02-20 20:01:28,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {30859#false} assume !(0 == ~p_dw_st~0); {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 57: Hoare triple {30859#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; {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {30859#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; {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 59: Hoare triple {30859#false} assume !(0 == ~c_dr_pc~0); {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 60: Hoare triple {30859#false} assume 2 == ~c_dr_pc~0; {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {30859#false} do_read_c_~a~0#1 := ~a_t~0; {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 62: Hoare triple {30859#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; {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {30859#false} assume !(~p_last_write~0 == ~c_last_read~0); {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L272 TraceCheckUtils]: 64: Hoare triple {30859#false} call error1(); {30859#false} is VALID [2022-02-20 20:01:28,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {30859#false} assume !false; {30859#false} is VALID [2022-02-20 20:01:28,741 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:01:28,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:28,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305707239] [2022-02-20 20:01:28,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305707239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:28,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:28,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:28,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012295124] [2022-02-20 20:01:28,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:28,742 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:01:28,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:28,742 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:01:28,774 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:01:28,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:28,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:28,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:28,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:28,776 INFO L87 Difference]: Start difference. First operand 1813 states and 2503 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:01:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:36,112 INFO L93 Difference]: Finished difference Result 5385 states and 7377 transitions. [2022-02-20 20:01:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:36,112 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:01:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:36,112 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:01:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1558 transitions. [2022-02-20 20:01:36,120 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:01:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1558 transitions. [2022-02-20 20:01:36,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1558 transitions. [2022-02-20 20:01:37,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1558 edges. 1558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:37,391 INFO L225 Difference]: With dead ends: 5385 [2022-02-20 20:01:37,391 INFO L226 Difference]: Without dead ends: 2204 [2022-02-20 20:01:37,396 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:01:37,398 INFO L933 BasicCegarLoop]: 888 mSDtfsCounter, 3942 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3960 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:37,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3960 Valid, 3337 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 20:01:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2022-02-20 20:01:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2024. [2022-02-20 20:01:37,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:37,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2204 states. Second operand has 2024 states, 1636 states have (on average 1.3624694376528117) internal successors, (2229), 1662 states have internal predecessors, (2229), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:37,527 INFO L74 IsIncluded]: Start isIncluded. First operand 2204 states. Second operand has 2024 states, 1636 states have (on average 1.3624694376528117) internal successors, (2229), 1662 states have internal predecessors, (2229), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:37,529 INFO L87 Difference]: Start difference. First operand 2204 states. Second operand has 2024 states, 1636 states have (on average 1.3624694376528117) internal successors, (2229), 1662 states have internal predecessors, (2229), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:37,655 INFO L93 Difference]: Finished difference Result 2204 states and 2946 transitions. [2022-02-20 20:01:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2946 transitions. [2022-02-20 20:01:37,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:37,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:37,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 2024 states, 1636 states have (on average 1.3624694376528117) internal successors, (2229), 1662 states have internal predecessors, (2229), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) Second operand 2204 states. [2022-02-20 20:01:37,664 INFO L87 Difference]: Start difference. First operand has 2024 states, 1636 states have (on average 1.3624694376528117) internal successors, (2229), 1662 states have internal predecessors, (2229), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) Second operand 2204 states. [2022-02-20 20:01:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:37,789 INFO L93 Difference]: Finished difference Result 2204 states and 2946 transitions. [2022-02-20 20:01:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2946 transitions. [2022-02-20 20:01:37,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:37,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:37,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:37,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1636 states have (on average 1.3624694376528117) internal successors, (2229), 1662 states have internal predecessors, (2229), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2715 transitions. [2022-02-20 20:01:37,952 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2715 transitions. Word has length 66 [2022-02-20 20:01:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:37,952 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 2715 transitions. [2022-02-20 20:01:37,952 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:01:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2715 transitions. [2022-02-20 20:01:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:37,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:37,957 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:37,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:37,958 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1700315392, now seen corresponding path program 1 times [2022-02-20 20:01:37,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:37,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831420886] [2022-02-20 20:01:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {45384#(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); {45338#true} is VALID [2022-02-20 20:01:37,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:37,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45338#true} {45338#true} #1974#return; {45338#true} is VALID [2022-02-20 20:01:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {45385#(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); {45338#true} is VALID [2022-02-20 20:01:37,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume !(0 == ~q_write_ev~0); {45338#true} is VALID [2022-02-20 20:01:37,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:37,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45338#true} {45338#true} #1976#return; {45338#true} is VALID [2022-02-20 20:01:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {45338#true} havoc ~__retres1~0; {45338#true} is VALID [2022-02-20 20:01:38,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume !(1 == ~p_dw_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} assume !(2 == ~p_dw_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {45338#true} ~__retres1~0 := 0; {45338#true} is VALID [2022-02-20 20:01:38,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {45338#true} #res := ~__retres1~0; {45338#true} is VALID [2022-02-20 20:01:38,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,041 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45338#true} {45338#true} #1970#return; {45338#true} is VALID [2022-02-20 20:01:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {45338#true} havoc ~__retres1~1; {45338#true} is VALID [2022-02-20 20:01:38,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume !(1 == ~c_dr_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} assume !(2 == ~c_dr_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {45338#true} ~__retres1~1 := 0; {45403#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:38,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {45403#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:38,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:38,081 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45338#true} #1972#return; {45401#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {45386#(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; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L272 TraceCheckUtils]: 1: Hoare triple {45338#true} call #t~ret8 := is_do_write_p_triggered(); {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} havoc ~__retres1~0; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {45338#true} assume !(1 == ~p_dw_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {45338#true} assume !(2 == ~p_dw_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {45338#true} ~__retres1~0 := 0; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {45338#true} #res := ~__retres1~0; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {45338#true} {45338#true} #1970#return; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {45338#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {45338#true} assume !(0 != ~tmp~1); {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L272 TraceCheckUtils]: 11: Hoare triple {45338#true} call #t~ret9 := is_do_read_c_triggered(); {45338#true} is VALID [2022-02-20 20:01:38,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {45338#true} havoc ~__retres1~1; {45338#true} is VALID [2022-02-20 20:01:38,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {45338#true} assume !(1 == ~c_dr_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {45338#true} assume !(2 == ~c_dr_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {45338#true} ~__retres1~1 := 0; {45403#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:38,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {45403#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:38,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:38,083 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45338#true} #1972#return; {45401#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:38,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {45401#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45402#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:38,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {45402#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {45339#false} is VALID [2022-02-20 20:01:38,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {45339#false} assume true; {45339#false} is VALID [2022-02-20 20:01:38,084 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {45339#false} {45338#true} #1978#return; {45339#false} is VALID [2022-02-20 20:01:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {45385#(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); {45338#true} is VALID [2022-02-20 20:01:38,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {45338#true} is VALID [2022-02-20 20:01:38,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45338#true} {45339#false} #1980#return; {45339#false} is VALID [2022-02-20 20:01:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {45338#true} havoc ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45338#true} is VALID [2022-02-20 20:01:38,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} #res := ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,089 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45338#true} {45339#false} #1982#return; {45339#false} is VALID [2022-02-20 20:01:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {45338#true} havoc ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45338#true} is VALID [2022-02-20 20:01:38,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} #res := ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45338#true} {45339#false} #1982#return; {45339#false} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {45338#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {45338#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {45338#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {45338#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; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {45338#true} call update_channels1(); {45384#(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:38,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {45384#(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); {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45338#true} {45338#true} #1974#return; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {45338#true} assume { :begin_inline_init_threads1 } true; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {45338#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45338#true} is VALID [2022-02-20 20:01:38,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {45338#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {45338#true} assume { :end_inline_init_threads1 } true; {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L272 TraceCheckUtils]: 12: Hoare triple {45338#true} call fire_delta_events1(); {45385#(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:38,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {45385#(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); {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {45338#true} assume !(0 == ~q_write_ev~0); {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45338#true} {45338#true} #1976#return; {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L272 TraceCheckUtils]: 17: Hoare triple {45338#true} call activate_threads1(); {45386#(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:38,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {45386#(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; {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L272 TraceCheckUtils]: 19: Hoare triple {45338#true} call #t~ret8 := is_do_write_p_triggered(); {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {45338#true} havoc ~__retres1~0; {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {45338#true} assume !(1 == ~p_dw_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {45338#true} assume !(2 == ~p_dw_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {45338#true} ~__retres1~0 := 0; {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {45338#true} #res := ~__retres1~0; {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45338#true} {45338#true} #1970#return; {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {45338#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {45338#true} assume !(0 != ~tmp~1); {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L272 TraceCheckUtils]: 29: Hoare triple {45338#true} call #t~ret9 := is_do_read_c_triggered(); {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {45338#true} havoc ~__retres1~1; {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {45338#true} assume !(1 == ~c_dr_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {45338#true} assume !(2 == ~c_dr_pc~0); {45338#true} is VALID [2022-02-20 20:01:38,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {45338#true} ~__retres1~1 := 0; {45403#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:38,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {45403#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:38,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:38,099 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45404#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45338#true} #1972#return; {45401#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:38,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {45401#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45402#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:38,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {45402#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {45339#false} is VALID [2022-02-20 20:01:38,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {45339#false} assume true; {45339#false} is VALID [2022-02-20 20:01:38,100 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {45339#false} {45338#true} #1978#return; {45339#false} is VALID [2022-02-20 20:01:38,100 INFO L272 TraceCheckUtils]: 41: Hoare triple {45339#false} call reset_delta_events1(); {45385#(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:38,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {45385#(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); {45338#true} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {45338#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {45338#true} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,101 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {45338#true} {45339#false} #1980#return; {45339#false} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {45339#false} assume !false; {45339#false} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {45339#false} assume !false; {45339#false} is VALID [2022-02-20 20:01:38,101 INFO L272 TraceCheckUtils]: 49: Hoare triple {45339#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45338#true} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {45338#true} havoc ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {45338#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45338#true} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {45338#true} #res := ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,102 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {45338#true} {45339#false} #1982#return; {45339#false} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {45339#false} assume 0 != eval1_~tmp___1~0#1; {45339#false} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {45339#false} assume 0 == ~p_dw_pc~0; {45339#false} is VALID [2022-02-20 20:01:38,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {45339#false} assume !false; {45339#false} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {45339#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {45339#false} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {45339#false} assume { :end_inline_do_write_p } true; {45339#false} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {45339#false} assume !(0 == ~c_dr_st~0); {45339#false} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {45339#false} assume !false; {45339#false} is VALID [2022-02-20 20:01:38,103 INFO L272 TraceCheckUtils]: 65: Hoare triple {45339#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45338#true} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {45338#true} havoc ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {45338#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45338#true} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {45338#true} #res := ~__retres1~2; {45338#true} is VALID [2022-02-20 20:01:38,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {45338#true} assume true; {45338#true} is VALID [2022-02-20 20:01:38,104 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45338#true} {45339#false} #1982#return; {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 72: Hoare triple {45339#false} assume 0 != eval1_~tmp___1~0#1; {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 73: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 74: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {45339#false} assume !(0 == ~p_dw_pc~0); {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {45339#false} assume 1 == ~p_dw_pc~0; {45339#false} is VALID [2022-02-20 20:01:38,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {45339#false} assume !(0 == ~q_free~0); {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 78: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 79: Hoare triple {45339#false} assume !false; {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {45339#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 81: Hoare triple {45339#false} assume { :end_inline_do_write_p } true; {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 82: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 83: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 84: Hoare triple {45339#false} assume !(0 == ~c_dr_pc~0); {45339#false} is VALID [2022-02-20 20:01:38,105 INFO L290 TraceCheckUtils]: 85: Hoare triple {45339#false} assume 2 == ~c_dr_pc~0; {45339#false} is VALID [2022-02-20 20:01:38,106 INFO L290 TraceCheckUtils]: 86: Hoare triple {45339#false} do_read_c_~a~0#1 := ~a_t~0; {45339#false} is VALID [2022-02-20 20:01:38,106 INFO L290 TraceCheckUtils]: 87: Hoare triple {45339#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; {45339#false} is VALID [2022-02-20 20:01:38,106 INFO L290 TraceCheckUtils]: 88: Hoare triple {45339#false} assume !(~p_last_write~0 == ~c_last_read~0); {45339#false} is VALID [2022-02-20 20:01:38,106 INFO L272 TraceCheckUtils]: 89: Hoare triple {45339#false} call error1(); {45339#false} is VALID [2022-02-20 20:01:38,106 INFO L290 TraceCheckUtils]: 90: Hoare triple {45339#false} assume !false; {45339#false} is VALID [2022-02-20 20:01:38,106 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:01:38,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:38,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831420886] [2022-02-20 20:01:38,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831420886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:38,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:38,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:38,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788474778] [2022-02-20 20:01:38,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:38,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:38,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:38,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:01:38,145 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:01:38,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:38,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:38,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:38,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:38,146 INFO L87 Difference]: Start difference. First operand 2024 states and 2715 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:01:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:42,414 INFO L93 Difference]: Finished difference Result 3849 states and 5117 transitions. [2022-02-20 20:01:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:01:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 930 transitions. [2022-02-20 20:01:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:01:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 930 transitions. [2022-02-20 20:01:42,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 930 transitions. [2022-02-20 20:01:43,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 930 edges. 930 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:43,238 INFO L225 Difference]: With dead ends: 3849 [2022-02-20 20:01:43,239 INFO L226 Difference]: Without dead ends: 2218 [2022-02-20 20:01:43,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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:01:43,243 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 989 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 2964 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:43,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [991 Valid, 2964 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:01:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2022-02-20 20:01:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2084. [2022-02-20 20:01:43,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:43,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2218 states. Second operand has 2084 states, 1684 states have (on average 1.3485748218527316) internal successors, (2271), 1710 states have internal predecessors, (2271), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:43,345 INFO L74 IsIncluded]: Start isIncluded. First operand 2218 states. Second operand has 2084 states, 1684 states have (on average 1.3485748218527316) internal successors, (2271), 1710 states have internal predecessors, (2271), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:43,347 INFO L87 Difference]: Start difference. First operand 2218 states. Second operand has 2084 states, 1684 states have (on average 1.3485748218527316) internal successors, (2271), 1710 states have internal predecessors, (2271), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:43,475 INFO L93 Difference]: Finished difference Result 2218 states and 2958 transitions. [2022-02-20 20:01:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2958 transitions. [2022-02-20 20:01:43,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:43,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:43,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 2084 states, 1684 states have (on average 1.3485748218527316) internal successors, (2271), 1710 states have internal predecessors, (2271), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2218 states. [2022-02-20 20:01:43,485 INFO L87 Difference]: Start difference. First operand has 2084 states, 1684 states have (on average 1.3485748218527316) internal successors, (2271), 1710 states have internal predecessors, (2271), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2218 states. [2022-02-20 20:01:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:43,615 INFO L93 Difference]: Finished difference Result 2218 states and 2958 transitions. [2022-02-20 20:01:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2958 transitions. [2022-02-20 20:01:43,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:43,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:43,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:43,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1684 states have (on average 1.3485748218527316) internal successors, (2271), 1710 states have internal predecessors, (2271), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2769 transitions. [2022-02-20 20:01:43,795 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2769 transitions. Word has length 91 [2022-02-20 20:01:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:43,796 INFO L470 AbstractCegarLoop]: Abstraction has 2084 states and 2769 transitions. [2022-02-20 20:01:43,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:01:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2769 transitions. [2022-02-20 20:01:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:43,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:43,797 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:43,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:43,798 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2144216066, now seen corresponding path program 1 times [2022-02-20 20:01:43,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:43,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766800805] [2022-02-20 20:01:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {57833#(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); {57834#(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:43,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57834#(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:43,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1974#return; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {57834#(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); {57834#(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:43,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {57834#(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); {57834#(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:43,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57834#(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:43,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1976#return; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {57786#true} havoc ~__retres1~0; {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {57786#true} assume !(1 == ~p_dw_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {57786#true} assume !(2 == ~p_dw_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {57786#true} ~__retres1~0 := 0; {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {57786#true} #res := ~__retres1~0; {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57786#true} {57786#true} #1970#return; {57786#true} is VALID [2022-02-20 20:01:43,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {57786#true} havoc ~__retres1~1; {57786#true} is VALID [2022-02-20 20:01:43,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {57786#true} assume !(1 == ~c_dr_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {57786#true} assume !(2 == ~c_dr_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {57786#true} ~__retres1~1 := 0; {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {57786#true} #res := ~__retres1~1; {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57786#true} {57786#true} #1972#return; {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {57835#(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; {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L272 TraceCheckUtils]: 1: Hoare triple {57786#true} call #t~ret8 := is_do_write_p_triggered(); {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {57786#true} havoc ~__retres1~0; {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {57786#true} assume !(1 == ~p_dw_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {57786#true} assume !(2 == ~p_dw_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {57786#true} ~__retres1~0 := 0; {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {57786#true} #res := ~__retres1~0; {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {57786#true} {57786#true} #1970#return; {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {57786#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {57786#true} assume !(0 != ~tmp~1); {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L272 TraceCheckUtils]: 11: Hoare triple {57786#true} call #t~ret9 := is_do_read_c_triggered(); {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {57786#true} havoc ~__retres1~1; {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {57786#true} assume !(1 == ~c_dr_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {57786#true} assume !(2 == ~c_dr_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {57786#true} ~__retres1~1 := 0; {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {57786#true} #res := ~__retres1~1; {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {57786#true} {57786#true} #1972#return; {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {57786#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {57786#true} assume !(0 != ~tmp___0~1); {57786#true} is VALID [2022-02-20 20:01:43,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,868 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {57786#true} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1978#return; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {57834#(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); {57850#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:43,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {57850#(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; {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:43,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:43,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1980#return; {57787#false} is VALID [2022-02-20 20:01:43,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {57786#true} havoc ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {57786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57786#true} is VALID [2022-02-20 20:01:43,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {57786#true} #res := ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,888 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57786#true} {57787#false} #1982#return; {57787#false} is VALID [2022-02-20 20:01:43,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {57786#true} havoc ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {57786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57786#true} is VALID [2022-02-20 20:01:43,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {57786#true} #res := ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,891 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57786#true} {57787#false} #1982#return; {57787#false} is VALID [2022-02-20 20:01:43,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {57786#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {57786#true} is VALID [2022-02-20 20:01:43,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {57786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {57786#true} is VALID [2022-02-20 20:01:43,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {57786#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {57788#(= ~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; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {57833#(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:43,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {57833#(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); {57834#(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:43,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57834#(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:43,897 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1974#return; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {57834#(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:43,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {57834#(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); {57834#(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:43,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {57834#(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); {57834#(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:43,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57834#(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:43,900 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57834#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1976#return; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {57835#(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:43,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {57835#(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; {57786#true} is VALID [2022-02-20 20:01:43,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {57786#true} call #t~ret8 := is_do_write_p_triggered(); {57786#true} is VALID [2022-02-20 20:01:43,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {57786#true} havoc ~__retres1~0; {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {57786#true} assume !(1 == ~p_dw_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {57786#true} assume !(2 == ~p_dw_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {57786#true} ~__retres1~0 := 0; {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {57786#true} #res := ~__retres1~0; {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {57786#true} {57786#true} #1970#return; {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {57786#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {57786#true} assume !(0 != ~tmp~1); {57786#true} is VALID [2022-02-20 20:01:43,901 INFO L272 TraceCheckUtils]: 29: Hoare triple {57786#true} call #t~ret9 := is_do_read_c_triggered(); {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {57786#true} havoc ~__retres1~1; {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {57786#true} assume !(1 == ~c_dr_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {57786#true} assume !(2 == ~c_dr_pc~0); {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {57786#true} ~__retres1~1 := 0; {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {57786#true} #res := ~__retres1~1; {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {57786#true} {57786#true} #1972#return; {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {57786#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {57786#true} assume !(0 != ~tmp___0~1); {57786#true} is VALID [2022-02-20 20:01:43,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,903 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {57786#true} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1978#return; {57788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:43,903 INFO L272 TraceCheckUtils]: 41: Hoare triple {57788#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {57834#(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:43,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {57834#(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); {57850#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:43,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {57850#(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; {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:43,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:43,904 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {57851#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {57788#(= ~q_write_ev~0 ~q_read_ev~0)} #1980#return; {57787#false} is VALID [2022-02-20 20:01:43,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {57787#false} assume !false; {57787#false} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {57787#false} assume !false; {57787#false} is VALID [2022-02-20 20:01:43,905 INFO L272 TraceCheckUtils]: 49: Hoare triple {57787#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57786#true} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {57786#true} havoc ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {57786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57786#true} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {57786#true} #res := ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,905 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {57786#true} {57787#false} #1982#return; {57787#false} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {57787#false} assume 0 != eval1_~tmp___1~0#1; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {57787#false} assume 0 == ~p_dw_pc~0; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {57787#false} assume !false; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {57787#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {57787#false} assume { :end_inline_do_write_p } true; {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {57787#false} assume !(0 == ~c_dr_st~0); {57787#false} is VALID [2022-02-20 20:01:43,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {57787#false} assume !false; {57787#false} is VALID [2022-02-20 20:01:43,907 INFO L272 TraceCheckUtils]: 65: Hoare triple {57787#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57786#true} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {57786#true} havoc ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {57786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57786#true} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {57786#true} #res := ~__retres1~2; {57786#true} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {57786#true} assume true; {57786#true} is VALID [2022-02-20 20:01:43,907 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {57786#true} {57787#false} #1982#return; {57787#false} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {57787#false} assume 0 != eval1_~tmp___1~0#1; {57787#false} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 75: Hoare triple {57787#false} assume !(0 == ~p_dw_pc~0); {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 76: Hoare triple {57787#false} assume 1 == ~p_dw_pc~0; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 77: Hoare triple {57787#false} assume !(0 == ~q_free~0); {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {57787#false} assume !false; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {57787#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {57787#false} assume { :end_inline_do_write_p } true; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L290 TraceCheckUtils]: 84: Hoare triple {57787#false} assume !(0 == ~c_dr_pc~0); {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L290 TraceCheckUtils]: 85: Hoare triple {57787#false} assume 2 == ~c_dr_pc~0; {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L290 TraceCheckUtils]: 86: Hoare triple {57787#false} do_read_c_~a~0#1 := ~a_t~0; {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {57787#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; {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {57787#false} assume !(~p_last_write~0 == ~c_last_read~0); {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L272 TraceCheckUtils]: 89: Hoare triple {57787#false} call error1(); {57787#false} is VALID [2022-02-20 20:01:43,909 INFO L290 TraceCheckUtils]: 90: Hoare triple {57787#false} assume !false; {57787#false} is VALID [2022-02-20 20:01:43,909 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:01:43,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:43,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766800805] [2022-02-20 20:01:43,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766800805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:43,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:43,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:43,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236042254] [2022-02-20 20:01:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:43,911 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:01:43,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:43,911 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:01:43,946 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:01:43,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:43,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:43,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:43,948 INFO L87 Difference]: Start difference. First operand 2084 states and 2769 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:01:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:47,951 INFO L93 Difference]: Finished difference Result 3611 states and 4733 transitions. [2022-02-20 20:01:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:47,952 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:01:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:47,952 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:01:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1122 transitions. [2022-02-20 20:01:47,957 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:01:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1122 transitions. [2022-02-20 20:01:47,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1122 transitions. [2022-02-20 20:01:48,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1122 edges. 1122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:48,891 INFO L225 Difference]: With dead ends: 3611 [2022-02-20 20:01:48,892 INFO L226 Difference]: Without dead ends: 2158 [2022-02-20 20:01:48,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 20:01:48,894 INFO L933 BasicCegarLoop]: 769 mSDtfsCounter, 1842 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:48,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1873 Valid, 2277 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2022-02-20 20:01:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1863. [2022-02-20 20:01:48,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:48,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2158 states. Second operand has 1863 states, 1516 states have (on average 1.354221635883905) internal successors, (2053), 1537 states have internal predecessors, (2053), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:49,001 INFO L74 IsIncluded]: Start isIncluded. First operand 2158 states. Second operand has 1863 states, 1516 states have (on average 1.354221635883905) internal successors, (2053), 1537 states have internal predecessors, (2053), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:49,004 INFO L87 Difference]: Start difference. First operand 2158 states. Second operand has 1863 states, 1516 states have (on average 1.354221635883905) internal successors, (2053), 1537 states have internal predecessors, (2053), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:49,124 INFO L93 Difference]: Finished difference Result 2158 states and 2856 transitions. [2022-02-20 20:01:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2856 transitions. [2022-02-20 20:01:49,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:49,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:49,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 1863 states, 1516 states have (on average 1.354221635883905) internal successors, (2053), 1537 states have internal predecessors, (2053), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 2158 states. [2022-02-20 20:01:49,134 INFO L87 Difference]: Start difference. First operand has 1863 states, 1516 states have (on average 1.354221635883905) internal successors, (2053), 1537 states have internal predecessors, (2053), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 2158 states. [2022-02-20 20:01:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:49,255 INFO L93 Difference]: Finished difference Result 2158 states and 2856 transitions. [2022-02-20 20:01:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2856 transitions. [2022-02-20 20:01:49,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:49,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:49,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:49,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1516 states have (on average 1.354221635883905) internal successors, (2053), 1537 states have internal predecessors, (2053), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2483 transitions. [2022-02-20 20:01:49,393 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2483 transitions. Word has length 91 [2022-02-20 20:01:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:49,393 INFO L470 AbstractCegarLoop]: Abstraction has 1863 states and 2483 transitions. [2022-02-20 20:01:49,394 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:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2483 transitions. [2022-02-20 20:01:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:49,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:49,394 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:49,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:49,395 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -211589184, now seen corresponding path program 1 times [2022-02-20 20:01:49,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:49,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411695814] [2022-02-20 20:01:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {69512#(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); {69465#true} is VALID [2022-02-20 20:01:49,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69465#true} {69465#true} #1974#return; {69465#true} is VALID [2022-02-20 20:01:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {69513#(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); {69465#true} is VALID [2022-02-20 20:01:49,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume !(0 == ~q_write_ev~0); {69465#true} is VALID [2022-02-20 20:01:49,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69465#true} {69470#(= ~c_dr_st~0 0)} #1976#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {69465#true} havoc ~__retres1~0; {69465#true} is VALID [2022-02-20 20:01:49,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume !(1 == ~p_dw_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} assume !(2 == ~p_dw_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {69465#true} ~__retres1~0 := 0; {69465#true} is VALID [2022-02-20 20:01:49,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {69465#true} #res := ~__retres1~0; {69465#true} is VALID [2022-02-20 20:01:49,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,460 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {69465#true} {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1970#return; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {69465#true} havoc ~__retres1~1; {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume !(1 == ~c_dr_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} assume !(2 == ~c_dr_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {69465#true} ~__retres1~1 := 0; {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {69465#true} #res := ~__retres1~1; {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {69465#true} {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1972#return; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {69514#(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; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,476 INFO L272 TraceCheckUtils]: 1: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} havoc ~__retres1~0; {69465#true} is VALID [2022-02-20 20:01:49,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {69465#true} assume !(1 == ~p_dw_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {69465#true} assume !(2 == ~p_dw_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {69465#true} ~__retres1~0 := 0; {69465#true} is VALID [2022-02-20 20:01:49,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {69465#true} #res := ~__retres1~0; {69465#true} is VALID [2022-02-20 20:01:49,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,477 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {69465#true} {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1970#return; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,478 INFO L272 TraceCheckUtils]: 11: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {69465#true} havoc ~__retres1~1; {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {69465#true} assume !(1 == ~c_dr_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {69465#true} assume !(2 == ~c_dr_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {69465#true} ~__retres1~1 := 0; {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {69465#true} #res := ~__retres1~1; {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,478 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {69465#true} {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1972#return; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,479 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {69470#(= ~c_dr_st~0 0)} #1978#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {69513#(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); {69465#true} is VALID [2022-02-20 20:01:49,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume !(1 == ~q_write_ev~0); {69465#true} is VALID [2022-02-20 20:01:49,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69465#true} {69470#(= ~c_dr_st~0 0)} #1980#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {69465#true} havoc ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69465#true} is VALID [2022-02-20 20:01:49,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} #res := ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,486 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {69465#true} {69470#(= ~c_dr_st~0 0)} #1982#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {69465#true} havoc ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69465#true} is VALID [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} #res := ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,489 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {69465#true} {69466#false} #1982#return; {69466#false} is VALID [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {69465#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {69465#true} is VALID [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {69465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {69465#true} is VALID [2022-02-20 20:01:49,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {69465#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {69465#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; {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {69465#true} call update_channels1(); {69512#(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:49,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {69512#(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); {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {69465#true} {69465#true} #1974#return; {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {69465#true} assume { :begin_inline_init_threads1 } true; {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {69465#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {69465#true} is VALID [2022-02-20 20:01:49,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {69465#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {69470#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,491 INFO L272 TraceCheckUtils]: 12: Hoare triple {69470#(= ~c_dr_st~0 0)} call fire_delta_events1(); {69513#(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:49,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {69513#(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); {69465#true} is VALID [2022-02-20 20:01:49,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {69465#true} assume !(0 == ~q_write_ev~0); {69465#true} is VALID [2022-02-20 20:01:49,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,491 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {69465#true} {69470#(= ~c_dr_st~0 0)} #1976#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,492 INFO L272 TraceCheckUtils]: 17: Hoare triple {69470#(= ~c_dr_st~0 0)} call activate_threads1(); {69514#(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:49,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {69514#(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; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {69465#true} is VALID [2022-02-20 20:01:49,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {69465#true} havoc ~__retres1~0; {69465#true} is VALID [2022-02-20 20:01:49,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {69465#true} assume !(1 == ~p_dw_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {69465#true} assume !(2 == ~p_dw_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {69465#true} ~__retres1~0 := 0; {69465#true} is VALID [2022-02-20 20:01:49,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {69465#true} #res := ~__retres1~0; {69465#true} is VALID [2022-02-20 20:01:49,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {69465#true} {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1970#return; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,493 INFO L272 TraceCheckUtils]: 29: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {69465#true} havoc ~__retres1~1; {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {69465#true} assume !(1 == ~c_dr_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {69465#true} assume !(2 == ~c_dr_pc~0); {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {69465#true} ~__retres1~1 := 0; {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {69465#true} #res := ~__retres1~1; {69465#true} is VALID [2022-02-20 20:01:49,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,494 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {69465#true} {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1972#return; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:49,495 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {69515#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {69470#(= ~c_dr_st~0 0)} #1978#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,495 INFO L272 TraceCheckUtils]: 41: Hoare triple {69470#(= ~c_dr_st~0 0)} call reset_delta_events1(); {69513#(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:49,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {69513#(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); {69465#true} is VALID [2022-02-20 20:01:49,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {69465#true} assume !(1 == ~q_write_ev~0); {69465#true} is VALID [2022-02-20 20:01:49,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,495 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {69465#true} {69470#(= ~c_dr_st~0 0)} #1980#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {69470#(= ~c_dr_st~0 0)} assume !false; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {69470#(= ~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; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {69470#(= ~c_dr_st~0 0)} assume !false; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,496 INFO L272 TraceCheckUtils]: 49: Hoare triple {69470#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {69465#true} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {69465#true} havoc ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {69465#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69465#true} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {69465#true} #res := ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,497 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {69465#true} {69470#(= ~c_dr_st~0 0)} #1982#return; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {69470#(= ~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; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {69470#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {69470#(= ~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; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {69470#(= ~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; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {69470#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {69470#(= ~c_dr_st~0 0)} assume !false; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {69470#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {69470#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {69470#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:49,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {69470#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {69466#false} is VALID [2022-02-20 20:01:49,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {69466#false} assume !false; {69466#false} is VALID [2022-02-20 20:01:49,499 INFO L272 TraceCheckUtils]: 65: Hoare triple {69466#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {69465#true} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {69465#true} havoc ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {69465#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69465#true} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {69465#true} #res := ~__retres1~2; {69465#true} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {69465#true} assume true; {69465#true} is VALID [2022-02-20 20:01:49,500 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {69465#true} {69466#false} #1982#return; {69466#false} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {69466#false} assume 0 != eval1_~tmp___1~0#1; {69466#false} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {69466#false} assume !(0 == ~p_dw_pc~0); {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {69466#false} assume 1 == ~p_dw_pc~0; {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {69466#false} assume !(0 == ~q_free~0); {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 78: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {69466#false} assume !false; {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {69466#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {69466#false} assume { :end_inline_do_write_p } true; {69466#false} is VALID [2022-02-20 20:01:49,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {69466#false} assume !(0 == ~c_dr_pc~0); {69466#false} is VALID [2022-02-20 20:01:49,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {69466#false} assume 2 == ~c_dr_pc~0; {69466#false} is VALID [2022-02-20 20:01:49,503 INFO L290 TraceCheckUtils]: 86: Hoare triple {69466#false} do_read_c_~a~0#1 := ~a_t~0; {69466#false} is VALID [2022-02-20 20:01:49,503 INFO L290 TraceCheckUtils]: 87: Hoare triple {69466#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; {69466#false} is VALID [2022-02-20 20:01:49,503 INFO L290 TraceCheckUtils]: 88: Hoare triple {69466#false} assume !(~p_last_write~0 == ~c_last_read~0); {69466#false} is VALID [2022-02-20 20:01:49,503 INFO L272 TraceCheckUtils]: 89: Hoare triple {69466#false} call error1(); {69466#false} is VALID [2022-02-20 20:01:49,503 INFO L290 TraceCheckUtils]: 90: Hoare triple {69466#false} assume !false; {69466#false} is VALID [2022-02-20 20:01:49,504 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:49,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:49,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411695814] [2022-02-20 20:01:49,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411695814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:49,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:49,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:49,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824302047] [2022-02-20 20:01:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:49,505 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:49,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:49,506 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:49,565 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:49,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:49,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:49,566 INFO L87 Difference]: Start difference. First operand 1863 states and 2483 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:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:51,780 INFO L93 Difference]: Finished difference Result 3439 states and 4539 transitions. [2022-02-20 20:01:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:51,781 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:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:51,781 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:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions. [2022-02-20 20:01:51,785 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:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions. [2022-02-20 20:01:51,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 914 transitions. [2022-02-20 20:01:52,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:52,536 INFO L225 Difference]: With dead ends: 3439 [2022-02-20 20:01:52,537 INFO L226 Difference]: Without dead ends: 1970 [2022-02-20 20:01:52,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-20 20:01:52,539 INFO L933 BasicCegarLoop]: 702 mSDtfsCounter, 1338 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:52,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1372 Valid, 2068 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-02-20 20:01:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1863. [2022-02-20 20:01:52,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:52,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1970 states. Second operand has 1863 states, 1516 states have (on average 1.3304749340369393) internal successors, (2017), 1537 states have internal predecessors, (2017), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:52,634 INFO L74 IsIncluded]: Start isIncluded. First operand 1970 states. Second operand has 1863 states, 1516 states have (on average 1.3304749340369393) internal successors, (2017), 1537 states have internal predecessors, (2017), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:52,636 INFO L87 Difference]: Start difference. First operand 1970 states. Second operand has 1863 states, 1516 states have (on average 1.3304749340369393) internal successors, (2017), 1537 states have internal predecessors, (2017), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:52,744 INFO L93 Difference]: Finished difference Result 1970 states and 2595 transitions. [2022-02-20 20:01:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2595 transitions. [2022-02-20 20:01:52,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:52,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:52,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 1863 states, 1516 states have (on average 1.3304749340369393) internal successors, (2017), 1537 states have internal predecessors, (2017), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 1970 states. [2022-02-20 20:01:52,753 INFO L87 Difference]: Start difference. First operand has 1863 states, 1516 states have (on average 1.3304749340369393) internal successors, (2017), 1537 states have internal predecessors, (2017), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 1970 states. [2022-02-20 20:01:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:52,856 INFO L93 Difference]: Finished difference Result 1970 states and 2595 transitions. [2022-02-20 20:01:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2595 transitions. [2022-02-20 20:01:52,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:52,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:52,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:52,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1516 states have (on average 1.3304749340369393) internal successors, (2017), 1537 states have internal predecessors, (2017), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2447 transitions. [2022-02-20 20:01:53,004 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2447 transitions. Word has length 91 [2022-02-20 20:01:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:53,004 INFO L470 AbstractCegarLoop]: Abstraction has 1863 states and 2447 transitions. [2022-02-20 20:01:53,005 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:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2447 transitions. [2022-02-20 20:01:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:53,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:53,006 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:53,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:53,006 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash 845704345, now seen corresponding path program 1 times [2022-02-20 20:01:53,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:53,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604054691] [2022-02-20 20:01:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {80603#(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); {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:53,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:53,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {80557#(= ~q_read_ev~0 2)} #1974#return; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {80605#(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); {80555#true} is VALID [2022-02-20 20:01:53,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume !(0 == ~q_write_ev~0); {80555#true} is VALID [2022-02-20 20:01:53,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80555#true} {80557#(= ~q_read_ev~0 2)} #1976#return; {80555#true} is VALID [2022-02-20 20:01:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {80555#true} havoc ~__retres1~0; {80555#true} is VALID [2022-02-20 20:01:53,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume !(1 == ~p_dw_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} assume !(2 == ~p_dw_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {80555#true} ~__retres1~0 := 0; {80555#true} is VALID [2022-02-20 20:01:53,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {80555#true} #res := ~__retres1~0; {80555#true} is VALID [2022-02-20 20:01:53,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,112 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {80555#true} {80555#true} #1970#return; {80555#true} is VALID [2022-02-20 20:01:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {80555#true} havoc ~__retres1~1; {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume !(1 == ~c_dr_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} assume !(2 == ~c_dr_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {80555#true} ~__retres1~1 := 0; {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {80555#true} #res := ~__retres1~1; {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {80555#true} {80555#true} #1972#return; {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {80606#(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; {80555#true} is VALID [2022-02-20 20:01:53,116 INFO L272 TraceCheckUtils]: 1: Hoare triple {80555#true} call #t~ret8 := is_do_write_p_triggered(); {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} havoc ~__retres1~0; {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {80555#true} assume !(1 == ~p_dw_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {80555#true} assume !(2 == ~p_dw_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {80555#true} ~__retres1~0 := 0; {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {80555#true} #res := ~__retres1~0; {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {80555#true} {80555#true} #1970#return; {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {80555#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {80555#true} is VALID [2022-02-20 20:01:53,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {80555#true} assume !(0 != ~tmp~1); {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L272 TraceCheckUtils]: 11: Hoare triple {80555#true} call #t~ret9 := is_do_read_c_triggered(); {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {80555#true} havoc ~__retres1~1; {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {80555#true} assume !(1 == ~c_dr_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {80555#true} assume !(2 == ~c_dr_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {80555#true} ~__retres1~1 := 0; {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {80555#true} #res := ~__retres1~1; {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {80555#true} {80555#true} #1972#return; {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {80555#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {80555#true} is VALID [2022-02-20 20:01:53,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {80555#true} assume !(0 != ~tmp___0~1); {80555#true} is VALID [2022-02-20 20:01:53,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,119 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {80555#true} {80555#true} #1978#return; {80555#true} is VALID [2022-02-20 20:01:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {80605#(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); {80555#true} is VALID [2022-02-20 20:01:53,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume !(1 == ~q_write_ev~0); {80555#true} is VALID [2022-02-20 20:01:53,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80555#true} {80555#true} #1980#return; {80555#true} is VALID [2022-02-20 20:01:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {80555#true} havoc ~__retres1~2; {80555#true} is VALID [2022-02-20 20:01:53,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80555#true} is VALID [2022-02-20 20:01:53,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} #res := ~__retres1~2; {80555#true} is VALID [2022-02-20 20:01:53,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,125 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80555#true} {80555#true} #1982#return; {80555#true} is VALID [2022-02-20 20:01:53,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {80555#true} havoc ~__retres1~2; {80555#true} is VALID [2022-02-20 20:01:53,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:53,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {80621#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {80621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:53,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {80621#(= ~p_dw_st~0 0)} assume true; {80621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:53,135 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80621#(= ~p_dw_st~0 0)} {80597#(not (= ~p_dw_st~0 0))} #1982#return; {80556#false} is VALID [2022-02-20 20:01:53,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {80555#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;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {80555#true} is VALID [2022-02-20 20:01:53,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {80555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {80555#true} is VALID [2022-02-20 20:01:53,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {80555#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {80557#(= ~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; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {80557#(= ~q_read_ev~0 2)} call update_channels1(); {80603#(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:53,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {80603#(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); {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:53,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:53,138 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {80604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {80557#(= ~q_read_ev~0 2)} #1974#return; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {80557#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {80557#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {80557#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {80557#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {80557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:53,139 INFO L272 TraceCheckUtils]: 12: Hoare triple {80557#(= ~q_read_ev~0 2)} call fire_delta_events1(); {80605#(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:53,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {80605#(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); {80555#true} is VALID [2022-02-20 20:01:53,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {80555#true} assume !(0 == ~q_write_ev~0); {80555#true} is VALID [2022-02-20 20:01:53,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,140 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {80555#true} {80557#(= ~q_read_ev~0 2)} #1976#return; {80555#true} is VALID [2022-02-20 20:01:53,140 INFO L272 TraceCheckUtils]: 17: Hoare triple {80555#true} call activate_threads1(); {80606#(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:53,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {80606#(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; {80555#true} is VALID [2022-02-20 20:01:53,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {80555#true} call #t~ret8 := is_do_write_p_triggered(); {80555#true} is VALID [2022-02-20 20:01:53,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {80555#true} havoc ~__retres1~0; {80555#true} is VALID [2022-02-20 20:01:53,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {80555#true} assume !(1 == ~p_dw_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {80555#true} assume !(2 == ~p_dw_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {80555#true} ~__retres1~0 := 0; {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {80555#true} #res := ~__retres1~0; {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {80555#true} {80555#true} #1970#return; {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {80555#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {80555#true} assume !(0 != ~tmp~1); {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L272 TraceCheckUtils]: 29: Hoare triple {80555#true} call #t~ret9 := is_do_read_c_triggered(); {80555#true} is VALID [2022-02-20 20:01:53,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {80555#true} havoc ~__retres1~1; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {80555#true} assume !(1 == ~c_dr_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {80555#true} assume !(2 == ~c_dr_pc~0); {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {80555#true} ~__retres1~1 := 0; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {80555#true} #res := ~__retres1~1; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {80555#true} {80555#true} #1972#return; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {80555#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {80555#true} assume !(0 != ~tmp___0~1); {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,142 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {80555#true} {80555#true} #1978#return; {80555#true} is VALID [2022-02-20 20:01:53,143 INFO L272 TraceCheckUtils]: 41: Hoare triple {80555#true} call reset_delta_events1(); {80605#(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:53,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {80605#(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); {80555#true} is VALID [2022-02-20 20:01:53,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {80555#true} assume !(1 == ~q_write_ev~0); {80555#true} is VALID [2022-02-20 20:01:53,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,143 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {80555#true} {80555#true} #1980#return; {80555#true} is VALID [2022-02-20 20:01:53,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {80555#true} assume !false; {80555#true} is VALID [2022-02-20 20:01:53,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {80555#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; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {80555#true} assume !false; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L272 TraceCheckUtils]: 49: Hoare triple {80555#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {80555#true} havoc ~__retres1~2; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {80555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {80555#true} #res := ~__retres1~2; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {80555#true} assume true; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {80555#true} {80555#true} #1982#return; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {80555#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; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {80555#true} assume 0 != eval1_~tmp___1~0#1; {80555#true} is VALID [2022-02-20 20:01:53,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {80555#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; {80555#true} is VALID [2022-02-20 20:01:53,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {80555#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; {80555#true} is VALID [2022-02-20 20:01:53,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {80555#true} assume 0 == ~p_dw_pc~0; {80555#true} is VALID [2022-02-20 20:01:53,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {80555#true} assume !false; {80555#true} is VALID [2022-02-20 20:01:53,150 INFO L290 TraceCheckUtils]: 61: Hoare triple {80555#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {80597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:53,150 INFO L290 TraceCheckUtils]: 62: Hoare triple {80597#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {80597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:53,150 INFO L290 TraceCheckUtils]: 63: Hoare triple {80597#(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; {80597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:53,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {80597#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {80597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:53,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {80597#(not (= ~p_dw_st~0 0))} assume !false; {80597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:53,151 INFO L272 TraceCheckUtils]: 66: Hoare triple {80597#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {80555#true} is VALID [2022-02-20 20:01:53,151 INFO L290 TraceCheckUtils]: 67: Hoare triple {80555#true} havoc ~__retres1~2; {80555#true} is VALID [2022-02-20 20:01:53,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {80555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:53,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {80621#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {80621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:53,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {80621#(= ~p_dw_st~0 0)} assume true; {80621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:53,152 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {80621#(= ~p_dw_st~0 0)} {80597#(not (= ~p_dw_st~0 0))} #1982#return; {80556#false} is VALID [2022-02-20 20:01:53,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {80556#false} assume 0 != eval1_~tmp___1~0#1; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {80556#false} assume !(0 == ~p_dw_pc~0); {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {80556#false} assume 1 == ~p_dw_pc~0; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {80556#false} assume !(0 == ~q_free~0); {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {80556#false} assume !false; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 81: Hoare triple {80556#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {80556#false} assume { :end_inline_do_write_p } true; {80556#false} is VALID [2022-02-20 20:01:53,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 84: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 85: Hoare triple {80556#false} assume !(0 == ~c_dr_pc~0); {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 86: Hoare triple {80556#false} assume 2 == ~c_dr_pc~0; {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 87: Hoare triple {80556#false} do_read_c_~a~0#1 := ~a_t~0; {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 88: Hoare triple {80556#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; {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 89: Hoare triple {80556#false} assume !(~p_last_write~0 == ~c_last_read~0); {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L272 TraceCheckUtils]: 90: Hoare triple {80556#false} call error1(); {80556#false} is VALID [2022-02-20 20:01:53,154 INFO L290 TraceCheckUtils]: 91: Hoare triple {80556#false} assume !false; {80556#false} is VALID [2022-02-20 20:01:53,155 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:53,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:53,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604054691] [2022-02-20 20:01:53,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604054691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:53,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:53,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:53,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517958147] [2022-02-20 20:01:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:53,156 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:53,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:53,156 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:53,212 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:53,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:53,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:53,214 INFO L87 Difference]: Start difference. First operand 1863 states and 2447 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)