./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:48,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:48,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:48,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:48,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:48,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:48,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:48,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:48,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:48,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:48,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:48,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:48,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:48,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:48,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:48,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:48,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:48,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:48,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:48,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:48,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:48,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:48,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:48,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:48,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:48,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:48,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:48,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:48,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:48,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:48,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:48,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:48,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:48,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:48,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:48,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:48,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:48,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:48,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:48,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:48,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:48,708 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:48,735 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:48,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:48,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:48,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:48,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:48,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:48,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:48,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:48,739 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:48,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:48,739 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:48,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:48,741 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:48,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:48,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:48,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:48,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:48,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:48,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:48,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:48,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:48,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:48,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:48,742 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:48,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:48,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:48,743 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 -> c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c [2022-02-20 20:00:48,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:48,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:48,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:48,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:48,944 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:48,945 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.11.cil-2.c [2022-02-20 20:00:48,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eb7d5e7/83e151760f5742ae909473793c10606f/FLAGc1e3a4396 [2022-02-20 20:00:49,334 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:49,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2022-02-20 20:00:49,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eb7d5e7/83e151760f5742ae909473793c10606f/FLAGc1e3a4396 [2022-02-20 20:00:49,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eb7d5e7/83e151760f5742ae909473793c10606f [2022-02-20 20:00:49,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:49,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:49,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:49,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:49,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:49,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:49" (1/1) ... [2022-02-20 20:00:49,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b280103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:49, skipping insertion in model container [2022-02-20 20:00:49,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:49" (1/1) ... [2022-02-20 20:00:49,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:49,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:49,943 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.11.cil-2.c[911,924] [2022-02-20 20:00:50,028 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.11.cil-2.c[8416,8429] [2022-02-20 20:00:50,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:50,093 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:50,100 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.11.cil-2.c[911,924] [2022-02-20 20:00:50,114 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.11.cil-2.c[8416,8429] [2022-02-20 20:00:50,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:50,161 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:50,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:50 WrapperNode [2022-02-20 20:00:50,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:50,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:50,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:50,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:50,167 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:50" (1/1) ... [2022-02-20 20:00:50,176 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:50" (1/1) ... [2022-02-20 20:00:50,215 INFO L137 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1020 [2022-02-20 20:00:50,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:50,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:50,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:50,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:50,222 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:50" (1/1) ... [2022-02-20 20:00:50,223 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:50" (1/1) ... [2022-02-20 20:00:50,226 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:50" (1/1) ... [2022-02-20 20:00:50,226 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:50" (1/1) ... [2022-02-20 20:00:50,237 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:50" (1/1) ... [2022-02-20 20:00:50,246 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:50" (1/1) ... [2022-02-20 20:00:50,249 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:50" (1/1) ... [2022-02-20 20:00:50,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:50,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:50,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:50,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:50,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:50" (1/1) ... [2022-02-20 20:00:50,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:50,277 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:50,324 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:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:50,346 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:50,346 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:50,347 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:50,348 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:50,348 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:50,348 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:50,348 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:50,348 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:50,348 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:50,349 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:50,349 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:50,349 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:50,349 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:50,499 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:50,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:51,113 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:51,113 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:00:51,162 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:51,172 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:51,172 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 20:00:51,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:51 BoogieIcfgContainer [2022-02-20 20:00:51,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:51,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:51,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:51,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:51,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:49" (1/3) ... [2022-02-20 20:00:51,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3555cb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:51, skipping insertion in model container [2022-02-20 20:00:51,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:50" (2/3) ... [2022-02-20 20:00:51,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3555cb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:51, skipping insertion in model container [2022-02-20 20:00:51,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:51" (3/3) ... [2022-02-20 20:00:51,179 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c [2022-02-20 20:00:51,183 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:51,183 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:51,214 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:51,219 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:00:51,219 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 416 states have (on average 1.6346153846153846) internal successors, (680), 422 states have internal predecessors, (680), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 20:00:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:51,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:51,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:51,250 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 805759077, now seen corresponding path program 1 times [2022-02-20 20:00:51,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:51,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168629142] [2022-02-20 20:00:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#(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); {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:51,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:51,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {479#(= ~q_read_ev~0 2)} #1833#return; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#(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; {520#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:51,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {520#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {520#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:51,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {520#(= |old(~q_read_ev~0)| 0)} assume true; {520#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:51,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {520#(= |old(~q_read_ev~0)| 0)} {479#(= ~q_read_ev~0 2)} #1835#return; {478#false} is VALID [2022-02-20 20:00:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#true} havoc ~__retres1~0; {477#true} is VALID [2022-02-20 20:00:51,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume 1 == ~p_dw_pc~0; {477#true} is VALID [2022-02-20 20:00:51,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {477#true} is VALID [2022-02-20 20:00:51,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#true} #res := ~__retres1~0; {477#true} is VALID [2022-02-20 20:00:51,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,523 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {477#true} {477#true} #1829#return; {477#true} is VALID [2022-02-20 20:00:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#true} havoc ~__retres1~1; {477#true} is VALID [2022-02-20 20:00:51,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume 1 == ~c_dr_pc~0; {477#true} is VALID [2022-02-20 20:00:51,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {477#true} is VALID [2022-02-20 20:00:51,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#true} #res := ~__retres1~1; {477#true} is VALID [2022-02-20 20:00:51,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,527 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {477#true} {477#true} #1831#return; {477#true} is VALID [2022-02-20 20:00:51,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(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; {477#true} is VALID [2022-02-20 20:00:51,528 INFO L272 TraceCheckUtils]: 1: Hoare triple {477#true} call #t~ret8 := is_do_write_p_triggered(); {477#true} is VALID [2022-02-20 20:00:51,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} havoc ~__retres1~0; {477#true} is VALID [2022-02-20 20:00:51,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#true} assume 1 == ~p_dw_pc~0; {477#true} is VALID [2022-02-20 20:00:51,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {477#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {477#true} is VALID [2022-02-20 20:00:51,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} #res := ~__retres1~0; {477#true} is VALID [2022-02-20 20:00:51,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,529 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {477#true} {477#true} #1829#return; {477#true} is VALID [2022-02-20 20:00:51,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {477#true} is VALID [2022-02-20 20:00:51,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {477#true} is VALID [2022-02-20 20:00:51,530 INFO L272 TraceCheckUtils]: 10: Hoare triple {477#true} call #t~ret9 := is_do_read_c_triggered(); {477#true} is VALID [2022-02-20 20:00:51,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#true} havoc ~__retres1~1; {477#true} is VALID [2022-02-20 20:00:51,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#true} assume 1 == ~c_dr_pc~0; {477#true} is VALID [2022-02-20 20:00:51,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {477#true} is VALID [2022-02-20 20:00:51,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#true} #res := ~__retres1~1; {477#true} is VALID [2022-02-20 20:00:51,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,531 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {477#true} {477#true} #1831#return; {477#true} is VALID [2022-02-20 20:00:51,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {477#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {477#true} is VALID [2022-02-20 20:00:51,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {477#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {477#true} is VALID [2022-02-20 20:00:51,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,531 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {477#true} {478#false} #1837#return; {478#false} is VALID [2022-02-20 20:00:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#(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; {477#true} is VALID [2022-02-20 20:00:51,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {477#true} is VALID [2022-02-20 20:00:51,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {478#false} #1839#return; {478#false} is VALID [2022-02-20 20:00:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#true} havoc ~__retres1~2; {477#true} is VALID [2022-02-20 20:00:51,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {477#true} is VALID [2022-02-20 20:00:51,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} #res := ~__retres1~2; {477#true} is VALID [2022-02-20 20:00:51,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,542 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {477#true} {478#false} #1841#return; {478#false} is VALID [2022-02-20 20:00:51,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {477#true} is VALID [2022-02-20 20:00:51,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {477#true} is VALID [2022-02-20 20:00:51,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {479#(= ~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; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {479#(= ~q_read_ev~0 2)} call update_channels1(); {517#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:51,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#(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); {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:51,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:51,546 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {518#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {479#(= ~q_read_ev~0 2)} #1833#return; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {479#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {479#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {479#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:51,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {479#(= ~q_read_ev~0 2)} call fire_delta_events1(); {519#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:51,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(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; {520#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:51,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {520#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:51,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {520#(= |old(~q_read_ev~0)| 0)} assume true; {520#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:51,550 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {520#(= |old(~q_read_ev~0)| 0)} {479#(= ~q_read_ev~0 2)} #1835#return; {478#false} is VALID [2022-02-20 20:00:51,550 INFO L272 TraceCheckUtils]: 17: Hoare triple {478#false} call activate_threads1(); {521#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:51,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(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; {477#true} is VALID [2022-02-20 20:00:51,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {477#true} call #t~ret8 := is_do_write_p_triggered(); {477#true} is VALID [2022-02-20 20:00:51,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {477#true} havoc ~__retres1~0; {477#true} is VALID [2022-02-20 20:00:51,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {477#true} assume 1 == ~p_dw_pc~0; {477#true} is VALID [2022-02-20 20:00:51,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {477#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {477#true} is VALID [2022-02-20 20:00:51,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {477#true} #res := ~__retres1~0; {477#true} is VALID [2022-02-20 20:00:51,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,552 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {477#true} {477#true} #1829#return; {477#true} is VALID [2022-02-20 20:00:51,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {477#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {477#true} is VALID [2022-02-20 20:00:51,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {477#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {477#true} is VALID [2022-02-20 20:00:51,552 INFO L272 TraceCheckUtils]: 28: Hoare triple {477#true} call #t~ret9 := is_do_read_c_triggered(); {477#true} is VALID [2022-02-20 20:00:51,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {477#true} havoc ~__retres1~1; {477#true} is VALID [2022-02-20 20:00:51,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {477#true} assume 1 == ~c_dr_pc~0; {477#true} is VALID [2022-02-20 20:00:51,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {477#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {477#true} is VALID [2022-02-20 20:00:51,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {477#true} #res := ~__retres1~1; {477#true} is VALID [2022-02-20 20:00:51,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,553 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {477#true} {477#true} #1831#return; {477#true} is VALID [2022-02-20 20:00:51,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {477#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {477#true} is VALID [2022-02-20 20:00:51,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {477#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {477#true} is VALID [2022-02-20 20:00:51,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,554 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {477#true} {478#false} #1837#return; {478#false} is VALID [2022-02-20 20:00:51,554 INFO L272 TraceCheckUtils]: 39: Hoare triple {478#false} call reset_delta_events1(); {519#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:51,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {519#(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; {477#true} is VALID [2022-02-20 20:00:51,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {477#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {477#true} is VALID [2022-02-20 20:00:51,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,555 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {477#true} {478#false} #1839#return; {478#false} is VALID [2022-02-20 20:00:51,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-02-20 20:00:51,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {478#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; {478#false} is VALID [2022-02-20 20:00:51,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-02-20 20:00:51,555 INFO L272 TraceCheckUtils]: 47: Hoare triple {478#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {477#true} is VALID [2022-02-20 20:00:51,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {477#true} havoc ~__retres1~2; {477#true} is VALID [2022-02-20 20:00:51,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {477#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {477#true} is VALID [2022-02-20 20:00:51,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {477#true} #res := ~__retres1~2; {477#true} is VALID [2022-02-20 20:00:51,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 20:00:51,556 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {477#true} {478#false} #1841#return; {478#false} is VALID [2022-02-20 20:00:51,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {478#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; {478#false} is VALID [2022-02-20 20:00:51,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {478#false} assume 0 != eval1_~tmp___1~0#1; {478#false} is VALID [2022-02-20 20:00:51,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {478#false} assume !(0 == ~p_dw_st~0); {478#false} is VALID [2022-02-20 20:00:51,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {478#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; {478#false} is VALID [2022-02-20 20:00:51,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {478#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; {478#false} is VALID [2022-02-20 20:00:51,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {478#false} assume !(0 == ~c_dr_pc~0); {478#false} is VALID [2022-02-20 20:00:51,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {478#false} assume 2 == ~c_dr_pc~0; {478#false} is VALID [2022-02-20 20:00:51,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {478#false} do_read_c_~a~0#1 := ~a_t~0; {478#false} is VALID [2022-02-20 20:00:51,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {478#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; {478#false} is VALID [2022-02-20 20:00:51,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {478#false} assume !(~p_last_write~0 == ~c_last_read~0); {478#false} is VALID [2022-02-20 20:00:51,558 INFO L272 TraceCheckUtils]: 63: Hoare triple {478#false} call error1(); {478#false} is VALID [2022-02-20 20:00:51,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-02-20 20:00:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:51,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:51,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168629142] [2022-02-20 20:00:51,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168629142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:51,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:51,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:51,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046704827] [2022-02-20 20:00:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:51,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:51,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:51,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:51,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:51,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:51,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:51,632 INFO L87 Difference]: Start difference. First operand has 474 states, 416 states have (on average 1.6346153846153846) internal successors, (680), 422 states have internal predecessors, (680), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:55,004 INFO L93 Difference]: Finished difference Result 1072 states and 1713 transitions. [2022-02-20 20:00:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1713 transitions. [2022-02-20 20:00:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1713 transitions. [2022-02-20 20:00:55,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1713 transitions. [2022-02-20 20:00:56,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1713 edges. 1713 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:56,353 INFO L225 Difference]: With dead ends: 1072 [2022-02-20 20:00:56,354 INFO L226 Difference]: Without dead ends: 615 [2022-02-20 20:00:56,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:56,366 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 1221 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:56,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 2411 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-02-20 20:00:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 576. [2022-02-20 20:00:56,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:56,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 576 states, 498 states have (on average 1.5240963855421688) internal successors, (759), 504 states have internal predecessors, (759), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:56,458 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 576 states, 498 states have (on average 1.5240963855421688) internal successors, (759), 504 states have internal predecessors, (759), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:56,462 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 576 states, 498 states have (on average 1.5240963855421688) internal successors, (759), 504 states have internal predecessors, (759), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:56,488 INFO L93 Difference]: Finished difference Result 615 states and 926 transitions. [2022-02-20 20:00:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 926 transitions. [2022-02-20 20:00:56,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:56,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:56,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 576 states, 498 states have (on average 1.5240963855421688) internal successors, (759), 504 states have internal predecessors, (759), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) Second operand 615 states. [2022-02-20 20:00:56,500 INFO L87 Difference]: Start difference. First operand has 576 states, 498 states have (on average 1.5240963855421688) internal successors, (759), 504 states have internal predecessors, (759), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) Second operand 615 states. [2022-02-20 20:00:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:56,535 INFO L93 Difference]: Finished difference Result 615 states and 926 transitions. [2022-02-20 20:00:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 926 transitions. [2022-02-20 20:00:56,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:56,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:56,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:56,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 498 states have (on average 1.5240963855421688) internal successors, (759), 504 states have internal predecessors, (759), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-02-20 20:00:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 870 transitions. [2022-02-20 20:00:56,563 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 870 transitions. Word has length 65 [2022-02-20 20:00:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:56,567 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 870 transitions. [2022-02-20 20:00:56,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 870 transitions. [2022-02-20 20:00:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:56,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:56,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:56,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:56,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1810319579, now seen corresponding path program 1 times [2022-02-20 20:00:56,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:56,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118105719] [2022-02-20 20:00:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {3998#(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); {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:56,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:56,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3960#(= ~q_write_ev~0 ~q_read_ev~0)} #1833#return; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {3999#(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); {4000#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {4000#(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; {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3960#(= ~q_write_ev~0 ~q_read_ev~0)} #1835#return; {3959#false} is VALID [2022-02-20 20:00:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {3958#true} havoc ~__retres1~0; {3958#true} is VALID [2022-02-20 20:00:56,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} assume 1 == ~p_dw_pc~0; {3958#true} is VALID [2022-02-20 20:00:56,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3958#true} is VALID [2022-02-20 20:00:56,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {3958#true} #res := ~__retres1~0; {3958#true} is VALID [2022-02-20 20:00:56,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,743 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3958#true} {3958#true} #1829#return; {3958#true} is VALID [2022-02-20 20:00:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {3958#true} havoc ~__retres1~1; {3958#true} is VALID [2022-02-20 20:00:56,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} assume 1 == ~c_dr_pc~0; {3958#true} is VALID [2022-02-20 20:00:56,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3958#true} is VALID [2022-02-20 20:00:56,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {3958#true} #res := ~__retres1~1; {3958#true} is VALID [2022-02-20 20:00:56,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,747 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3958#true} {3958#true} #1831#return; {3958#true} is VALID [2022-02-20 20:00:56,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {4002#(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; {3958#true} is VALID [2022-02-20 20:00:56,747 INFO L272 TraceCheckUtils]: 1: Hoare triple {3958#true} call #t~ret8 := is_do_write_p_triggered(); {3958#true} is VALID [2022-02-20 20:00:56,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} havoc ~__retres1~0; {3958#true} is VALID [2022-02-20 20:00:56,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {3958#true} assume 1 == ~p_dw_pc~0; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {3958#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {3958#true} #res := ~__retres1~0; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3958#true} {3958#true} #1829#return; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {3958#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {3958#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3958#true} is VALID [2022-02-20 20:00:56,748 INFO L272 TraceCheckUtils]: 10: Hoare triple {3958#true} call #t~ret9 := is_do_read_c_triggered(); {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {3958#true} havoc ~__retres1~1; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {3958#true} assume 1 == ~c_dr_pc~0; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {3958#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#true} #res := ~__retres1~1; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3958#true} {3958#true} #1831#return; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3958#true} is VALID [2022-02-20 20:00:56,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3958#true} is VALID [2022-02-20 20:00:56,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,750 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3958#true} {3959#false} #1837#return; {3959#false} is VALID [2022-02-20 20:00:56,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {3999#(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); {3958#true} is VALID [2022-02-20 20:00:56,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3958#true} is VALID [2022-02-20 20:00:56,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3958#true} {3959#false} #1839#return; {3959#false} is VALID [2022-02-20 20:00:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:56,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {3958#true} havoc ~__retres1~2; {3958#true} is VALID [2022-02-20 20:00:56,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3958#true} is VALID [2022-02-20 20:00:56,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} #res := ~__retres1~2; {3958#true} is VALID [2022-02-20 20:00:56,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,758 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3958#true} {3959#false} #1841#return; {3959#false} is VALID [2022-02-20 20:00:56,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {3958#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {3958#true} is VALID [2022-02-20 20:00:56,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {3958#true} is VALID [2022-02-20 20:00:56,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {3960#(= ~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; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {3960#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3998#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:56,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {3998#(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); {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:56,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:56,761 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3960#(= ~q_write_ev~0 ~q_read_ev~0)} #1833#return; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {3960#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {3960#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {3960#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {3960#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3960#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:56,763 INFO L272 TraceCheckUtils]: 12: Hoare triple {3960#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:56,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {3999#(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); {4000#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {4000#(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; {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:56,764 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4001#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3960#(= ~q_write_ev~0 ~q_read_ev~0)} #1835#return; {3959#false} is VALID [2022-02-20 20:00:56,765 INFO L272 TraceCheckUtils]: 17: Hoare triple {3959#false} call activate_threads1(); {4002#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:56,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(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; {3958#true} is VALID [2022-02-20 20:00:56,765 INFO L272 TraceCheckUtils]: 19: Hoare triple {3958#true} call #t~ret8 := is_do_write_p_triggered(); {3958#true} is VALID [2022-02-20 20:00:56,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {3958#true} havoc ~__retres1~0; {3958#true} is VALID [2022-02-20 20:00:56,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {3958#true} assume 1 == ~p_dw_pc~0; {3958#true} is VALID [2022-02-20 20:00:56,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {3958#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3958#true} is VALID [2022-02-20 20:00:56,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {3958#true} #res := ~__retres1~0; {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3958#true} {3958#true} #1829#return; {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {3958#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {3958#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L272 TraceCheckUtils]: 28: Hoare triple {3958#true} call #t~ret9 := is_do_read_c_triggered(); {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {3958#true} havoc ~__retres1~1; {3958#true} is VALID [2022-02-20 20:00:56,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {3958#true} assume 1 == ~c_dr_pc~0; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {3958#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {3958#true} #res := ~__retres1~1; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3958#true} {3958#true} #1831#return; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {3958#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {3958#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,767 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3958#true} {3959#false} #1837#return; {3959#false} is VALID [2022-02-20 20:00:56,768 INFO L272 TraceCheckUtils]: 39: Hoare triple {3959#false} call reset_delta_events1(); {3999#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:56,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {3999#(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); {3958#true} is VALID [2022-02-20 20:00:56,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {3958#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3958#true} is VALID [2022-02-20 20:00:56,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,768 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3958#true} {3959#false} #1839#return; {3959#false} is VALID [2022-02-20 20:00:56,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {3959#false} assume !false; {3959#false} is VALID [2022-02-20 20:00:56,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {3959#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; {3959#false} is VALID [2022-02-20 20:00:56,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {3959#false} assume !false; {3959#false} is VALID [2022-02-20 20:00:56,769 INFO L272 TraceCheckUtils]: 47: Hoare triple {3959#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3958#true} is VALID [2022-02-20 20:00:56,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {3958#true} havoc ~__retres1~2; {3958#true} is VALID [2022-02-20 20:00:56,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {3958#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3958#true} is VALID [2022-02-20 20:00:56,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {3958#true} #res := ~__retres1~2; {3958#true} is VALID [2022-02-20 20:00:56,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-02-20 20:00:56,769 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3958#true} {3959#false} #1841#return; {3959#false} is VALID [2022-02-20 20:00:56,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {3959#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; {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {3959#false} assume 0 != eval1_~tmp___1~0#1; {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {3959#false} assume !(0 == ~p_dw_st~0); {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {3959#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; {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {3959#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; {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {3959#false} assume !(0 == ~c_dr_pc~0); {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {3959#false} assume 2 == ~c_dr_pc~0; {3959#false} is VALID [2022-02-20 20:00:56,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {3959#false} do_read_c_~a~0#1 := ~a_t~0; {3959#false} is VALID [2022-02-20 20:00:56,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {3959#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; {3959#false} is VALID [2022-02-20 20:00:56,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {3959#false} assume !(~p_last_write~0 == ~c_last_read~0); {3959#false} is VALID [2022-02-20 20:00:56,771 INFO L272 TraceCheckUtils]: 63: Hoare triple {3959#false} call error1(); {3959#false} is VALID [2022-02-20 20:00:56,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {3959#false} assume !false; {3959#false} is VALID [2022-02-20 20:00:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:56,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:56,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118105719] [2022-02-20 20:00:56,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118105719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:56,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:56,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:56,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942963202] [2022-02-20 20:00:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:56,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:56,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:56,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:56,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:56,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:56,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:56,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:56,813 INFO L87 Difference]: Start difference. First operand 576 states and 870 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:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:00,500 INFO L93 Difference]: Finished difference Result 973 states and 1436 transitions. [2022-02-20 20:01:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:01:00,514 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:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:00,514 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:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1112 transitions. [2022-02-20 20:01:00,523 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:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1112 transitions. [2022-02-20 20:01:00,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1112 transitions. [2022-02-20 20:01:01,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1112 edges. 1112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:01,149 INFO L225 Difference]: With dead ends: 973 [2022-02-20 20:01:01,149 INFO L226 Difference]: Without dead ends: 764 [2022-02-20 20:01:01,152 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:01,154 INFO L933 BasicCegarLoop]: 790 mSDtfsCounter, 1392 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:01,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1423 Valid, 2761 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:01:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-02-20 20:01:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 688. [2022-02-20 20:01:01,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:01,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 764 states. Second operand has 688 states, 588 states have (on average 1.5051020408163265) internal successors, (885), 596 states have internal predecessors, (885), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:01:01,201 INFO L74 IsIncluded]: Start isIncluded. First operand 764 states. Second operand has 688 states, 588 states have (on average 1.5051020408163265) internal successors, (885), 596 states have internal predecessors, (885), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:01:01,202 INFO L87 Difference]: Start difference. First operand 764 states. Second operand has 688 states, 588 states have (on average 1.5051020408163265) internal successors, (885), 596 states have internal predecessors, (885), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:01:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:01,229 INFO L93 Difference]: Finished difference Result 764 states and 1144 transitions. [2022-02-20 20:01:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1144 transitions. [2022-02-20 20:01:01,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:01,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:01,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 688 states, 588 states have (on average 1.5051020408163265) internal successors, (885), 596 states have internal predecessors, (885), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) Second operand 764 states. [2022-02-20 20:01:01,235 INFO L87 Difference]: Start difference. First operand has 688 states, 588 states have (on average 1.5051020408163265) internal successors, (885), 596 states have internal predecessors, (885), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) Second operand 764 states. [2022-02-20 20:01:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:01,262 INFO L93 Difference]: Finished difference Result 764 states and 1144 transitions. [2022-02-20 20:01:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1144 transitions. [2022-02-20 20:01:01,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:01,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:01,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:01,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 588 states have (on average 1.5051020408163265) internal successors, (885), 596 states have internal predecessors, (885), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 20:01:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1030 transitions. [2022-02-20 20:01:01,294 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1030 transitions. Word has length 65 [2022-02-20 20:01:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:01,295 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1030 transitions. [2022-02-20 20:01:01,295 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:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1030 transitions. [2022-02-20 20:01:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:01,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:01,296 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:01,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:01:01,296 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash 456061607, now seen corresponding path program 1 times [2022-02-20 20:01:01,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:01,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215613122] [2022-02-20 20:01:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {7815#(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); {7816#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:01,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {7816#(not (= |old(~q_req_up~0)| 1))} assume true; {7816#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:01,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7816#(not (= |old(~q_req_up~0)| 1))} {7776#(= ~q_req_up~0 ~p_dw_pc~0)} #1833#return; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {7817#(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); {7773#true} is VALID [2022-02-20 20:01:01,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#true} assume !(0 == ~q_write_ev~0); {7773#true} is VALID [2022-02-20 20:01:01,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7773#true} {7780#(not (= ~p_dw_pc~0 1))} #1835#return; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {7773#true} havoc ~__retres1~0; {7773#true} is VALID [2022-02-20 20:01:01,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#true} assume 1 == ~p_dw_pc~0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,444 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} {7773#true} #1829#return; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {7773#true} havoc ~__retres1~1; {7773#true} is VALID [2022-02-20 20:01:01,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#true} assume 1 == ~c_dr_pc~0; {7773#true} is VALID [2022-02-20 20:01:01,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {7773#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7773#true} is VALID [2022-02-20 20:01:01,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {7773#true} #res := ~__retres1~1; {7773#true} is VALID [2022-02-20 20:01:01,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,449 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7773#true} {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} #1831#return; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {7818#(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; {7773#true} is VALID [2022-02-20 20:01:01,450 INFO L272 TraceCheckUtils]: 1: Hoare triple {7773#true} call #t~ret8 := is_do_write_p_triggered(); {7773#true} is VALID [2022-02-20 20:01:01,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {7773#true} havoc ~__retres1~0; {7773#true} is VALID [2022-02-20 20:01:01,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {7773#true} assume 1 == ~p_dw_pc~0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,454 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} {7773#true} #1829#return; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,458 INFO L272 TraceCheckUtils]: 10: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7773#true} is VALID [2022-02-20 20:01:01,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {7773#true} havoc ~__retres1~1; {7773#true} is VALID [2022-02-20 20:01:01,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {7773#true} assume 1 == ~c_dr_pc~0; {7773#true} is VALID [2022-02-20 20:01:01,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {7773#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7773#true} is VALID [2022-02-20 20:01:01,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {7773#true} #res := ~__retres1~1; {7773#true} is VALID [2022-02-20 20:01:01,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,459 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7773#true} {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} #1831#return; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,460 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} {7780#(not (= ~p_dw_pc~0 1))} #1837#return; {7774#false} is VALID [2022-02-20 20:01:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {7817#(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); {7773#true} is VALID [2022-02-20 20:01:01,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7773#true} is VALID [2022-02-20 20:01:01,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7773#true} {7774#false} #1839#return; {7774#false} is VALID [2022-02-20 20:01:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:01,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {7773#true} havoc ~__retres1~2; {7773#true} is VALID [2022-02-20 20:01:01,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7773#true} is VALID [2022-02-20 20:01:01,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {7773#true} #res := ~__retres1~2; {7773#true} is VALID [2022-02-20 20:01:01,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,470 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7773#true} {7774#false} #1841#return; {7774#false} is VALID [2022-02-20 20:01:01,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {7773#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {7775#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:01,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {7775#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {7775#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:01,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {7775#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {7776#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:01,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {7776#(= ~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; {7776#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:01,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {7776#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {7815#(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,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {7815#(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); {7816#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:01,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {7816#(not (= |old(~q_req_up~0)| 1))} assume true; {7816#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:01,473 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7816#(not (= |old(~q_req_up~0)| 1))} {7776#(= ~q_req_up~0 ~p_dw_pc~0)} #1833#return; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {7780#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {7780#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {7780#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,474 INFO L272 TraceCheckUtils]: 12: Hoare triple {7780#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {7817#(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,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {7817#(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); {7773#true} is VALID [2022-02-20 20:01:01,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {7773#true} assume !(0 == ~q_write_ev~0); {7773#true} is VALID [2022-02-20 20:01:01,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,475 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7773#true} {7780#(not (= ~p_dw_pc~0 1))} #1835#return; {7780#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:01,475 INFO L272 TraceCheckUtils]: 17: Hoare triple {7780#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {7818#(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,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {7818#(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; {7773#true} is VALID [2022-02-20 20:01:01,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {7773#true} call #t~ret8 := is_do_write_p_triggered(); {7773#true} is VALID [2022-02-20 20:01:01,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {7773#true} havoc ~__retres1~0; {7773#true} is VALID [2022-02-20 20:01:01,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {7773#true} assume 1 == ~p_dw_pc~0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,477 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} {7773#true} #1829#return; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,479 INFO L272 TraceCheckUtils]: 28: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7773#true} is VALID [2022-02-20 20:01:01,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {7773#true} havoc ~__retres1~1; {7773#true} is VALID [2022-02-20 20:01:01,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {7773#true} assume 1 == ~c_dr_pc~0; {7773#true} is VALID [2022-02-20 20:01:01,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {7773#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7773#true} is VALID [2022-02-20 20:01:01,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {7773#true} #res := ~__retres1~1; {7773#true} is VALID [2022-02-20 20:01:01,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,480 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7773#true} {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} #1831#return; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:01,481 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7825#(= (+ (- 1) ~p_dw_pc~0) 0)} {7780#(not (= ~p_dw_pc~0 1))} #1837#return; {7774#false} is VALID [2022-02-20 20:01:01,481 INFO L272 TraceCheckUtils]: 39: Hoare triple {7774#false} call reset_delta_events1(); {7817#(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,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {7817#(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); {7773#true} is VALID [2022-02-20 20:01:01,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {7773#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7773#true} is VALID [2022-02-20 20:01:01,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,482 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7773#true} {7774#false} #1839#return; {7774#false} is VALID [2022-02-20 20:01:01,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {7774#false} assume !false; {7774#false} is VALID [2022-02-20 20:01:01,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {7774#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; {7774#false} is VALID [2022-02-20 20:01:01,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {7774#false} assume !false; {7774#false} is VALID [2022-02-20 20:01:01,482 INFO L272 TraceCheckUtils]: 47: Hoare triple {7774#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7773#true} is VALID [2022-02-20 20:01:01,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {7773#true} havoc ~__retres1~2; {7773#true} is VALID [2022-02-20 20:01:01,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {7773#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7773#true} is VALID [2022-02-20 20:01:01,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {7773#true} #res := ~__retres1~2; {7773#true} is VALID [2022-02-20 20:01:01,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {7773#true} assume true; {7773#true} is VALID [2022-02-20 20:01:01,483 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7773#true} {7774#false} #1841#return; {7774#false} is VALID [2022-02-20 20:01:01,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {7774#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; {7774#false} is VALID [2022-02-20 20:01:01,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {7774#false} assume 0 != eval1_~tmp___1~0#1; {7774#false} is VALID [2022-02-20 20:01:01,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {7774#false} assume !(0 == ~p_dw_st~0); {7774#false} is VALID [2022-02-20 20:01:01,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {7774#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; {7774#false} is VALID [2022-02-20 20:01:01,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {7774#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; {7774#false} is VALID [2022-02-20 20:01:01,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {7774#false} assume !(0 == ~c_dr_pc~0); {7774#false} is VALID [2022-02-20 20:01:01,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {7774#false} assume 2 == ~c_dr_pc~0; {7774#false} is VALID [2022-02-20 20:01:01,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {7774#false} do_read_c_~a~0#1 := ~a_t~0; {7774#false} is VALID [2022-02-20 20:01:01,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {7774#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; {7774#false} is VALID [2022-02-20 20:01:01,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {7774#false} assume !(~p_last_write~0 == ~c_last_read~0); {7774#false} is VALID [2022-02-20 20:01:01,489 INFO L272 TraceCheckUtils]: 63: Hoare triple {7774#false} call error1(); {7774#false} is VALID [2022-02-20 20:01:01,489 INFO L290 TraceCheckUtils]: 64: Hoare triple {7774#false} assume !false; {7774#false} is VALID [2022-02-20 20:01:01,490 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,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:01,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215613122] [2022-02-20 20:01:01,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215613122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:01,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:01,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:01,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562649061] [2022-02-20 20:01:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:01,492 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:01,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:01,492 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:01,532 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,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:01,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:01,533 INFO L87 Difference]: Start difference. First operand 688 states and 1030 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:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:08,367 INFO L93 Difference]: Finished difference Result 2234 states and 3228 transitions. [2022-02-20 20:01:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:08,368 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:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:08,369 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:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1517 transitions. [2022-02-20 20:01:08,379 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:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1517 transitions. [2022-02-20 20:01:08,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1517 transitions. [2022-02-20 20:01:09,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1517 edges. 1517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:09,423 INFO L225 Difference]: With dead ends: 2234 [2022-02-20 20:01:09,434 INFO L226 Difference]: Without dead ends: 1901 [2022-02-20 20:01:09,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:09,443 INFO L933 BasicCegarLoop]: 843 mSDtfsCounter, 3683 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3701 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:09,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3701 Valid, 3107 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 20:01:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2022-02-20 20:01:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1741. [2022-02-20 20:01:09,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:09,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1901 states. Second operand has 1741 states, 1436 states have (on average 1.4129526462395543) internal successors, (2029), 1459 states have internal predecessors, (2029), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:09,582 INFO L74 IsIncluded]: Start isIncluded. First operand 1901 states. Second operand has 1741 states, 1436 states have (on average 1.4129526462395543) internal successors, (2029), 1459 states have internal predecessors, (2029), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:09,584 INFO L87 Difference]: Start difference. First operand 1901 states. Second operand has 1741 states, 1436 states have (on average 1.4129526462395543) internal successors, (2029), 1459 states have internal predecessors, (2029), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:09,765 INFO L93 Difference]: Finished difference Result 1901 states and 2629 transitions. [2022-02-20 20:01:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2629 transitions. [2022-02-20 20:01:09,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:09,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:09,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 1741 states, 1436 states have (on average 1.4129526462395543) internal successors, (2029), 1459 states have internal predecessors, (2029), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) Second operand 1901 states. [2022-02-20 20:01:09,776 INFO L87 Difference]: Start difference. First operand has 1741 states, 1436 states have (on average 1.4129526462395543) internal successors, (2029), 1459 states have internal predecessors, (2029), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) Second operand 1901 states. [2022-02-20 20:01:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:09,927 INFO L93 Difference]: Finished difference Result 1901 states and 2629 transitions. [2022-02-20 20:01:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2629 transitions. [2022-02-20 20:01:09,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:09,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:09,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:09,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1436 states have (on average 1.4129526462395543) internal successors, (2029), 1459 states have internal predecessors, (2029), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2022-02-20 20:01:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2417 transitions. [2022-02-20 20:01:10,111 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2417 transitions. Word has length 65 [2022-02-20 20:01:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:10,112 INFO L470 AbstractCegarLoop]: Abstraction has 1741 states and 2417 transitions. [2022-02-20 20:01:10,112 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:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2417 transitions. [2022-02-20 20:01:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:10,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:10,115 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:10,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:01:10,115 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1798849050, now seen corresponding path program 1 times [2022-02-20 20:01:10,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:10,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218244473] [2022-02-20 20:01:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {17071#(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); {17031#true} is VALID [2022-02-20 20:01:10,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17031#true} {17031#true} #1833#return; {17031#true} is VALID [2022-02-20 20:01:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {17072#(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); {17031#true} is VALID [2022-02-20 20:01:10,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume !(0 == ~q_write_ev~0); {17031#true} is VALID [2022-02-20 20:01:10,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17031#true} {17031#true} #1835#return; {17031#true} is VALID [2022-02-20 20:01:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {17031#true} havoc ~__retres1~0; {17031#true} is VALID [2022-02-20 20:01:10,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume !(1 == ~p_dw_pc~0); {17031#true} is VALID [2022-02-20 20:01:10,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} assume !(2 == ~p_dw_pc~0); {17031#true} is VALID [2022-02-20 20:01:10,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {17031#true} ~__retres1~0 := 0; {17089#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:10,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {17089#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:10,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:10,277 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {17031#true} #1829#return; {17081#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {17031#true} havoc ~__retres1~1; {17031#true} is VALID [2022-02-20 20:01:10,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume 1 == ~c_dr_pc~0; {17031#true} is VALID [2022-02-20 20:01:10,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17031#true} is VALID [2022-02-20 20:01:10,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {17031#true} #res := ~__retres1~1; {17031#true} is VALID [2022-02-20 20:01:10,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,286 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17031#true} {17032#false} #1831#return; {17032#false} is VALID [2022-02-20 20:01:10,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {17073#(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; {17031#true} is VALID [2022-02-20 20:01:10,289 INFO L272 TraceCheckUtils]: 1: Hoare triple {17031#true} call #t~ret8 := is_do_write_p_triggered(); {17031#true} is VALID [2022-02-20 20:01:10,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} havoc ~__retres1~0; {17031#true} is VALID [2022-02-20 20:01:10,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {17031#true} assume !(1 == ~p_dw_pc~0); {17031#true} is VALID [2022-02-20 20:01:10,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {17031#true} assume !(2 == ~p_dw_pc~0); {17031#true} is VALID [2022-02-20 20:01:10,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {17031#true} ~__retres1~0 := 0; {17089#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:10,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {17089#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:10,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:10,291 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {17031#true} #1829#return; {17081#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:10,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {17081#(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; {17082#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:10,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {17082#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17032#false} is VALID [2022-02-20 20:01:10,292 INFO L272 TraceCheckUtils]: 11: Hoare triple {17032#false} call #t~ret9 := is_do_read_c_triggered(); {17031#true} is VALID [2022-02-20 20:01:10,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {17031#true} havoc ~__retres1~1; {17031#true} is VALID [2022-02-20 20:01:10,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {17031#true} assume 1 == ~c_dr_pc~0; {17031#true} is VALID [2022-02-20 20:01:10,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {17031#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17031#true} is VALID [2022-02-20 20:01:10,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {17031#true} #res := ~__retres1~1; {17031#true} is VALID [2022-02-20 20:01:10,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,293 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17031#true} {17032#false} #1831#return; {17032#false} is VALID [2022-02-20 20:01:10,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {17032#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17032#false} is VALID [2022-02-20 20:01:10,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {17032#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {17032#false} is VALID [2022-02-20 20:01:10,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {17032#false} assume true; {17032#false} is VALID [2022-02-20 20:01:10,293 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17032#false} {17031#true} #1837#return; {17032#false} is VALID [2022-02-20 20:01:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {17072#(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); {17031#true} is VALID [2022-02-20 20:01:10,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17031#true} is VALID [2022-02-20 20:01:10,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17031#true} {17032#false} #1839#return; {17032#false} is VALID [2022-02-20 20:01:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:10,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {17031#true} havoc ~__retres1~2; {17031#true} is VALID [2022-02-20 20:01:10,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17031#true} is VALID [2022-02-20 20:01:10,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} #res := ~__retres1~2; {17031#true} is VALID [2022-02-20 20:01:10,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,300 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17031#true} {17032#false} #1841#return; {17032#false} is VALID [2022-02-20 20:01:10,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {17031#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {17031#true} is VALID [2022-02-20 20:01:10,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {17031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {17031#true} is VALID [2022-02-20 20:01:10,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {17031#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {17031#true} is VALID [2022-02-20 20:01:10,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {17031#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; {17031#true} is VALID [2022-02-20 20:01:10,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {17031#true} call update_channels1(); {17071#(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:10,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {17071#(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); {17031#true} is VALID [2022-02-20 20:01:10,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,302 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17031#true} {17031#true} #1833#return; {17031#true} is VALID [2022-02-20 20:01:10,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {17031#true} assume { :begin_inline_init_threads1 } true; {17031#true} is VALID [2022-02-20 20:01:10,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {17031#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17031#true} is VALID [2022-02-20 20:01:10,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {17031#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17031#true} is VALID [2022-02-20 20:01:10,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {17031#true} assume { :end_inline_init_threads1 } true; {17031#true} is VALID [2022-02-20 20:01:10,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {17031#true} call fire_delta_events1(); {17072#(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:10,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {17072#(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); {17031#true} is VALID [2022-02-20 20:01:10,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {17031#true} assume !(0 == ~q_write_ev~0); {17031#true} is VALID [2022-02-20 20:01:10,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17031#true} {17031#true} #1835#return; {17031#true} is VALID [2022-02-20 20:01:10,304 INFO L272 TraceCheckUtils]: 17: Hoare triple {17031#true} call activate_threads1(); {17073#(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:10,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {17073#(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; {17031#true} is VALID [2022-02-20 20:01:10,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {17031#true} call #t~ret8 := is_do_write_p_triggered(); {17031#true} is VALID [2022-02-20 20:01:10,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {17031#true} havoc ~__retres1~0; {17031#true} is VALID [2022-02-20 20:01:10,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {17031#true} assume !(1 == ~p_dw_pc~0); {17031#true} is VALID [2022-02-20 20:01:10,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {17031#true} assume !(2 == ~p_dw_pc~0); {17031#true} is VALID [2022-02-20 20:01:10,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {17031#true} ~__retres1~0 := 0; {17089#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:10,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {17089#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:10,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:10,307 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17090#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {17031#true} #1829#return; {17081#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:10,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {17081#(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; {17082#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:10,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {17082#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {17032#false} is VALID [2022-02-20 20:01:10,308 INFO L272 TraceCheckUtils]: 29: Hoare triple {17032#false} call #t~ret9 := is_do_read_c_triggered(); {17031#true} is VALID [2022-02-20 20:01:10,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {17031#true} havoc ~__retres1~1; {17031#true} is VALID [2022-02-20 20:01:10,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {17031#true} assume 1 == ~c_dr_pc~0; {17031#true} is VALID [2022-02-20 20:01:10,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {17031#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {17031#true} is VALID [2022-02-20 20:01:10,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {17031#true} #res := ~__retres1~1; {17031#true} is VALID [2022-02-20 20:01:10,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,309 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17031#true} {17032#false} #1831#return; {17032#false} is VALID [2022-02-20 20:01:10,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {17032#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17032#false} is VALID [2022-02-20 20:01:10,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {17032#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {17032#false} is VALID [2022-02-20 20:01:10,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {17032#false} assume true; {17032#false} is VALID [2022-02-20 20:01:10,309 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17032#false} {17031#true} #1837#return; {17032#false} is VALID [2022-02-20 20:01:10,309 INFO L272 TraceCheckUtils]: 40: Hoare triple {17032#false} call reset_delta_events1(); {17072#(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:10,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {17072#(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); {17031#true} is VALID [2022-02-20 20:01:10,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {17031#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {17031#true} is VALID [2022-02-20 20:01:10,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,310 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17031#true} {17032#false} #1839#return; {17032#false} is VALID [2022-02-20 20:01:10,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {17032#false} assume !false; {17032#false} is VALID [2022-02-20 20:01:10,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {17032#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; {17032#false} is VALID [2022-02-20 20:01:10,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {17032#false} assume !false; {17032#false} is VALID [2022-02-20 20:01:10,311 INFO L272 TraceCheckUtils]: 48: Hoare triple {17032#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17031#true} is VALID [2022-02-20 20:01:10,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {17031#true} havoc ~__retres1~2; {17031#true} is VALID [2022-02-20 20:01:10,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {17031#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17031#true} is VALID [2022-02-20 20:01:10,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {17031#true} #res := ~__retres1~2; {17031#true} is VALID [2022-02-20 20:01:10,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {17031#true} assume true; {17031#true} is VALID [2022-02-20 20:01:10,311 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17031#true} {17032#false} #1841#return; {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {17032#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; {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {17032#false} assume 0 != eval1_~tmp___1~0#1; {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {17032#false} assume !(0 == ~p_dw_st~0); {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {17032#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; {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {17032#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; {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {17032#false} assume !(0 == ~c_dr_pc~0); {17032#false} is VALID [2022-02-20 20:01:10,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {17032#false} assume 2 == ~c_dr_pc~0; {17032#false} is VALID [2022-02-20 20:01:10,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {17032#false} do_read_c_~a~0#1 := ~a_t~0; {17032#false} is VALID [2022-02-20 20:01:10,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {17032#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; {17032#false} is VALID [2022-02-20 20:01:10,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {17032#false} assume !(~p_last_write~0 == ~c_last_read~0); {17032#false} is VALID [2022-02-20 20:01:10,313 INFO L272 TraceCheckUtils]: 64: Hoare triple {17032#false} call error1(); {17032#false} is VALID [2022-02-20 20:01:10,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {17032#false} assume !false; {17032#false} is VALID [2022-02-20 20:01:10,313 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:10,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:10,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218244473] [2022-02-20 20:01:10,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218244473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:10,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:10,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:10,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769605736] [2022-02-20 20:01:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:10,315 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:10,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:10,315 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:10,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:10,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:10,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:10,349 INFO L87 Difference]: Start difference. First operand 1741 states and 2417 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:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,401 INFO L93 Difference]: Finished difference Result 3269 states and 4496 transitions. [2022-02-20 20:01:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:01:14,402 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:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:14,403 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:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 893 transitions. [2022-02-20 20:01:14,409 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:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 893 transitions. [2022-02-20 20:01:14,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 893 transitions. [2022-02-20 20:01:15,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 893 edges. 893 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:15,199 INFO L225 Difference]: With dead ends: 3269 [2022-02-20 20:01:15,199 INFO L226 Difference]: Without dead ends: 1889 [2022-02-20 20:01:15,201 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:15,202 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 932 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:15,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 2785 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-02-20 20:01:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1781. [2022-02-20 20:01:15,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:15,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1889 states. Second operand has 1781 states, 1468 states have (on average 1.3998637602179838) internal successors, (2055), 1491 states have internal predecessors, (2055), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:15,302 INFO L74 IsIncluded]: Start isIncluded. First operand 1889 states. Second operand has 1781 states, 1468 states have (on average 1.3998637602179838) internal successors, (2055), 1491 states have internal predecessors, (2055), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:15,305 INFO L87 Difference]: Start difference. First operand 1889 states. Second operand has 1781 states, 1468 states have (on average 1.3998637602179838) internal successors, (2055), 1491 states have internal predecessors, (2055), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:15,439 INFO L93 Difference]: Finished difference Result 1889 states and 2605 transitions. [2022-02-20 20:01:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2605 transitions. [2022-02-20 20:01:15,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:15,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:15,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 1781 states, 1468 states have (on average 1.3998637602179838) internal successors, (2055), 1491 states have internal predecessors, (2055), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) Second operand 1889 states. [2022-02-20 20:01:15,449 INFO L87 Difference]: Start difference. First operand has 1781 states, 1468 states have (on average 1.3998637602179838) internal successors, (2055), 1491 states have internal predecessors, (2055), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) Second operand 1889 states. [2022-02-20 20:01:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:15,581 INFO L93 Difference]: Finished difference Result 1889 states and 2605 transitions. [2022-02-20 20:01:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2605 transitions. [2022-02-20 20:01:15,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:15,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:15,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:15,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1468 states have (on average 1.3998637602179838) internal successors, (2055), 1491 states have internal predecessors, (2055), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2022-02-20 20:01:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2451 transitions. [2022-02-20 20:01:15,757 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2451 transitions. Word has length 66 [2022-02-20 20:01:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:15,757 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 2451 transitions. [2022-02-20 20:01:15,757 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:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2451 transitions. [2022-02-20 20:01:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:15,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:15,758 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:15,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:15,759 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash 769489752, now seen corresponding path program 1 times [2022-02-20 20:01:15,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:15,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497297736] [2022-02-20 20:01:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:15,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {27683#(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); {27684#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:15,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {27684#(not (= |old(~q_req_up~0)| 1))} assume true; {27684#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:15,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27684#(not (= |old(~q_req_up~0)| 1))} {27643#(= ~c_dr_pc~0 ~q_req_up~0)} #1833#return; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {27685#(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); {27640#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {27640#true} assume !(0 == ~q_write_ev~0); {27640#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27640#true} {27647#(not (= ~c_dr_pc~0 1))} #1835#return; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {27640#true} havoc ~__retres1~0; {27640#true} is VALID [2022-02-20 20:01:15,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {27640#true} assume !(1 == ~p_dw_pc~0); {27640#true} is VALID [2022-02-20 20:01:15,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {27640#true} assume !(2 == ~p_dw_pc~0); {27640#true} is VALID [2022-02-20 20:01:15,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {27640#true} ~__retres1~0 := 0; {27640#true} is VALID [2022-02-20 20:01:15,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {27640#true} #res := ~__retres1~0; {27640#true} is VALID [2022-02-20 20:01:15,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,859 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27640#true} {27640#true} #1829#return; {27640#true} is VALID [2022-02-20 20:01:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {27640#true} havoc ~__retres1~1; {27640#true} is VALID [2022-02-20 20:01:15,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {27640#true} assume 1 == ~c_dr_pc~0; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,867 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} {27640#true} #1831#return; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {27686#(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; {27640#true} is VALID [2022-02-20 20:01:15,867 INFO L272 TraceCheckUtils]: 1: Hoare triple {27640#true} call #t~ret8 := is_do_write_p_triggered(); {27640#true} is VALID [2022-02-20 20:01:15,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {27640#true} havoc ~__retres1~0; {27640#true} is VALID [2022-02-20 20:01:15,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {27640#true} assume !(1 == ~p_dw_pc~0); {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {27640#true} assume !(2 == ~p_dw_pc~0); {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {27640#true} ~__retres1~0 := 0; {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {27640#true} #res := ~__retres1~0; {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27640#true} {27640#true} #1829#return; {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {27640#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27640#true} is VALID [2022-02-20 20:01:15,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {27640#true} assume !(0 != ~tmp~1); {27640#true} is VALID [2022-02-20 20:01:15,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {27640#true} call #t~ret9 := is_do_read_c_triggered(); {27640#true} is VALID [2022-02-20 20:01:15,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {27640#true} havoc ~__retres1~1; {27640#true} is VALID [2022-02-20 20:01:15,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {27640#true} assume 1 == ~c_dr_pc~0; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,871 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} {27640#true} #1831#return; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,873 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} {27647#(not (= ~c_dr_pc~0 1))} #1837#return; {27641#false} is VALID [2022-02-20 20:01:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {27685#(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); {27640#true} is VALID [2022-02-20 20:01:15,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {27640#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27640#true} is VALID [2022-02-20 20:01:15,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27640#true} {27641#false} #1839#return; {27641#false} is VALID [2022-02-20 20:01:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {27640#true} havoc ~__retres1~2; {27640#true} is VALID [2022-02-20 20:01:15,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {27640#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27640#true} is VALID [2022-02-20 20:01:15,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {27640#true} #res := ~__retres1~2; {27640#true} is VALID [2022-02-20 20:01:15,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,908 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27640#true} {27641#false} #1841#return; {27641#false} is VALID [2022-02-20 20:01:15,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {27640#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {27642#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:15,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {27642#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {27642#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:15,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {27642#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {27643#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:15,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {27643#(= ~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; {27643#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:15,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {27643#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {27683#(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:15,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {27683#(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); {27684#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:15,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {27684#(not (= |old(~q_req_up~0)| 1))} assume true; {27684#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:15,912 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27684#(not (= |old(~q_req_up~0)| 1))} {27643#(= ~c_dr_pc~0 ~q_req_up~0)} #1833#return; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {27647#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {27647#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {27647#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {27647#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,914 INFO L272 TraceCheckUtils]: 12: Hoare triple {27647#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {27685#(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:15,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {27685#(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); {27640#true} is VALID [2022-02-20 20:01:15,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {27640#true} assume !(0 == ~q_write_ev~0); {27640#true} is VALID [2022-02-20 20:01:15,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,914 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27640#true} {27647#(not (= ~c_dr_pc~0 1))} #1835#return; {27647#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:15,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {27647#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {27686#(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:15,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {27686#(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; {27640#true} is VALID [2022-02-20 20:01:15,915 INFO L272 TraceCheckUtils]: 19: Hoare triple {27640#true} call #t~ret8 := is_do_write_p_triggered(); {27640#true} is VALID [2022-02-20 20:01:15,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {27640#true} havoc ~__retres1~0; {27640#true} is VALID [2022-02-20 20:01:15,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {27640#true} assume !(1 == ~p_dw_pc~0); {27640#true} is VALID [2022-02-20 20:01:15,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {27640#true} assume !(2 == ~p_dw_pc~0); {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {27640#true} ~__retres1~0 := 0; {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {27640#true} #res := ~__retres1~0; {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27640#true} {27640#true} #1829#return; {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {27640#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {27640#true} assume !(0 != ~tmp~1); {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L272 TraceCheckUtils]: 29: Hoare triple {27640#true} call #t~ret9 := is_do_read_c_triggered(); {27640#true} is VALID [2022-02-20 20:01:15,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {27640#true} havoc ~__retres1~1; {27640#true} is VALID [2022-02-20 20:01:15,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {27640#true} assume 1 == ~c_dr_pc~0; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,918 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} {27640#true} #1831#return; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:15,919 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27700#(= (+ (- 1) ~c_dr_pc~0) 0)} {27647#(not (= ~c_dr_pc~0 1))} #1837#return; {27641#false} is VALID [2022-02-20 20:01:15,919 INFO L272 TraceCheckUtils]: 40: Hoare triple {27641#false} call reset_delta_events1(); {27685#(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:15,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {27685#(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); {27640#true} is VALID [2022-02-20 20:01:15,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {27640#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27640#true} is VALID [2022-02-20 20:01:15,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,920 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27640#true} {27641#false} #1839#return; {27641#false} is VALID [2022-02-20 20:01:15,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {27641#false} assume !false; {27641#false} is VALID [2022-02-20 20:01:15,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {27641#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; {27641#false} is VALID [2022-02-20 20:01:15,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {27641#false} assume !false; {27641#false} is VALID [2022-02-20 20:01:15,920 INFO L272 TraceCheckUtils]: 48: Hoare triple {27641#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27640#true} is VALID [2022-02-20 20:01:15,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {27640#true} havoc ~__retres1~2; {27640#true} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {27640#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27640#true} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {27640#true} #res := ~__retres1~2; {27640#true} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {27640#true} assume true; {27640#true} is VALID [2022-02-20 20:01:15,921 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27640#true} {27641#false} #1841#return; {27641#false} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {27641#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; {27641#false} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {27641#false} assume 0 != eval1_~tmp___1~0#1; {27641#false} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {27641#false} assume !(0 == ~p_dw_st~0); {27641#false} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {27641#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; {27641#false} is VALID [2022-02-20 20:01:15,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {27641#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; {27641#false} is VALID [2022-02-20 20:01:15,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {27641#false} assume !(0 == ~c_dr_pc~0); {27641#false} is VALID [2022-02-20 20:01:15,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {27641#false} assume 2 == ~c_dr_pc~0; {27641#false} is VALID [2022-02-20 20:01:15,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {27641#false} do_read_c_~a~0#1 := ~a_t~0; {27641#false} is VALID [2022-02-20 20:01:15,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {27641#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; {27641#false} is VALID [2022-02-20 20:01:15,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {27641#false} assume !(~p_last_write~0 == ~c_last_read~0); {27641#false} is VALID [2022-02-20 20:01:15,923 INFO L272 TraceCheckUtils]: 64: Hoare triple {27641#false} call error1(); {27641#false} is VALID [2022-02-20 20:01:15,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {27641#false} assume !false; {27641#false} is VALID [2022-02-20 20:01:15,923 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:15,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:15,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497297736] [2022-02-20 20:01:15,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497297736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:15,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:15,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:15,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972593771] [2022-02-20 20:01:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:15,925 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:15,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:15,926 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:15,977 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:15,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:15,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:15,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:15,978 INFO L87 Difference]: Start difference. First operand 1781 states and 2451 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:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:24,251 INFO L93 Difference]: Finished difference Result 5353 states and 7325 transitions. [2022-02-20 20:01:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:24,251 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:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:24,252 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:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1506 transitions. [2022-02-20 20:01:24,261 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:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1506 transitions. [2022-02-20 20:01:24,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1506 transitions. [2022-02-20 20:01:25,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1506 edges. 1506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:25,520 INFO L225 Difference]: With dead ends: 5353 [2022-02-20 20:01:25,520 INFO L226 Difference]: Without dead ends: 2172 [2022-02-20 20:01:25,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:25,527 INFO L933 BasicCegarLoop]: 837 mSDtfsCounter, 3766 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:25,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3784 Valid, 3131 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 20:01:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2022-02-20 20:01:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1992. [2022-02-20 20:01:25,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:25,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2172 states. Second operand has 1992 states, 1607 states have (on average 1.3571873055382702) internal successors, (2181), 1632 states have internal predecessors, (2181), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:25,608 INFO L74 IsIncluded]: Start isIncluded. First operand 2172 states. Second operand has 1992 states, 1607 states have (on average 1.3571873055382702) internal successors, (2181), 1632 states have internal predecessors, (2181), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:25,611 INFO L87 Difference]: Start difference. First operand 2172 states. Second operand has 1992 states, 1607 states have (on average 1.3571873055382702) internal successors, (2181), 1632 states have internal predecessors, (2181), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:25,773 INFO L93 Difference]: Finished difference Result 2172 states and 2894 transitions. [2022-02-20 20:01:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2894 transitions. [2022-02-20 20:01:25,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:25,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:25,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 1992 states, 1607 states have (on average 1.3571873055382702) internal successors, (2181), 1632 states have internal predecessors, (2181), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) Second operand 2172 states. [2022-02-20 20:01:25,818 INFO L87 Difference]: Start difference. First operand has 1992 states, 1607 states have (on average 1.3571873055382702) internal successors, (2181), 1632 states have internal predecessors, (2181), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) Second operand 2172 states. [2022-02-20 20:01:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:26,128 INFO L93 Difference]: Finished difference Result 2172 states and 2894 transitions. [2022-02-20 20:01:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2894 transitions. [2022-02-20 20:01:26,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:26,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:26,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:26,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1607 states have (on average 1.3571873055382702) internal successors, (2181), 1632 states have internal predecessors, (2181), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2022-02-20 20:01:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2663 transitions. [2022-02-20 20:01:26,385 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2663 transitions. Word has length 66 [2022-02-20 20:01:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:26,387 INFO L470 AbstractCegarLoop]: Abstraction has 1992 states and 2663 transitions. [2022-02-20 20:01:26,392 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:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2663 transitions. [2022-02-20 20:01:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:26,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:26,412 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:26,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:26,413 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1205446518, now seen corresponding path program 1 times [2022-02-20 20:01:26,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:26,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151520658] [2022-02-20 20:01:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {42020#(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); {41974#true} is VALID [2022-02-20 20:01:26,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41974#true} {41974#true} #1833#return; {41974#true} is VALID [2022-02-20 20:01:26,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {42021#(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); {41974#true} is VALID [2022-02-20 20:01:26,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume !(0 == ~q_write_ev~0); {41974#true} is VALID [2022-02-20 20:01:26,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41974#true} {41974#true} #1835#return; {41974#true} is VALID [2022-02-20 20:01:26,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {41974#true} havoc ~__retres1~0; {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume !(1 == ~p_dw_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} assume !(2 == ~p_dw_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {41974#true} ~__retres1~0 := 0; {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {41974#true} #res := ~__retres1~0; {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {41974#true} {41974#true} #1829#return; {41974#true} is VALID [2022-02-20 20:01:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {41974#true} havoc ~__retres1~1; {41974#true} is VALID [2022-02-20 20:01:26,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume !(1 == ~c_dr_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} assume !(2 == ~c_dr_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {41974#true} ~__retres1~1 := 0; {42039#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:26,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {42039#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:26,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:26,573 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41974#true} #1831#return; {42037#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:26,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {42022#(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; {41974#true} is VALID [2022-02-20 20:01:26,573 INFO L272 TraceCheckUtils]: 1: Hoare triple {41974#true} call #t~ret8 := is_do_write_p_triggered(); {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} havoc ~__retres1~0; {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {41974#true} assume !(1 == ~p_dw_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {41974#true} assume !(2 == ~p_dw_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {41974#true} ~__retres1~0 := 0; {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {41974#true} #res := ~__retres1~0; {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {41974#true} {41974#true} #1829#return; {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {41974#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {41974#true} is VALID [2022-02-20 20:01:26,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {41974#true} assume !(0 != ~tmp~1); {41974#true} is VALID [2022-02-20 20:01:26,575 INFO L272 TraceCheckUtils]: 11: Hoare triple {41974#true} call #t~ret9 := is_do_read_c_triggered(); {41974#true} is VALID [2022-02-20 20:01:26,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {41974#true} havoc ~__retres1~1; {41974#true} is VALID [2022-02-20 20:01:26,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {41974#true} assume !(1 == ~c_dr_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {41974#true} assume !(2 == ~c_dr_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {41974#true} ~__retres1~1 := 0; {42039#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:26,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {42039#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:26,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:26,576 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41974#true} #1831#return; {42037#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:26,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {42037#(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; {42038#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:26,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {42038#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41975#false} is VALID [2022-02-20 20:01:26,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {41975#false} assume true; {41975#false} is VALID [2022-02-20 20:01:26,577 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41975#false} {41974#true} #1837#return; {41975#false} is VALID [2022-02-20 20:01:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {42021#(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); {41974#true} is VALID [2022-02-20 20:01:26,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {41974#true} is VALID [2022-02-20 20:01:26,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41974#true} {41975#false} #1839#return; {41975#false} is VALID [2022-02-20 20:01:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {41974#true} havoc ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41974#true} is VALID [2022-02-20 20:01:26,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} #res := ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,585 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41974#true} {41975#false} #1841#return; {41975#false} is VALID [2022-02-20 20:01:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:26,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {41974#true} havoc ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41974#true} is VALID [2022-02-20 20:01:26,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} #res := ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,590 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41974#true} {41975#false} #1841#return; {41975#false} is VALID [2022-02-20 20:01:26,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {41974#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {41974#true} is VALID [2022-02-20 20:01:26,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {41974#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {41974#true} is VALID [2022-02-20 20:01:26,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {41974#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {41974#true} is VALID [2022-02-20 20:01:26,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {41974#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; {41974#true} is VALID [2022-02-20 20:01:26,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {41974#true} call update_channels1(); {42020#(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:26,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {42020#(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); {41974#true} is VALID [2022-02-20 20:01:26,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,592 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {41974#true} {41974#true} #1833#return; {41974#true} is VALID [2022-02-20 20:01:26,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {41974#true} assume { :begin_inline_init_threads1 } true; {41974#true} is VALID [2022-02-20 20:01:26,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {41974#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {41974#true} is VALID [2022-02-20 20:01:26,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {41974#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {41974#true} is VALID [2022-02-20 20:01:26,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {41974#true} assume { :end_inline_init_threads1 } true; {41974#true} is VALID [2022-02-20 20:01:26,593 INFO L272 TraceCheckUtils]: 12: Hoare triple {41974#true} call fire_delta_events1(); {42021#(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:26,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {42021#(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); {41974#true} is VALID [2022-02-20 20:01:26,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {41974#true} assume !(0 == ~q_write_ev~0); {41974#true} is VALID [2022-02-20 20:01:26,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,593 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41974#true} {41974#true} #1835#return; {41974#true} is VALID [2022-02-20 20:01:26,593 INFO L272 TraceCheckUtils]: 17: Hoare triple {41974#true} call activate_threads1(); {42022#(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:26,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {42022#(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; {41974#true} is VALID [2022-02-20 20:01:26,593 INFO L272 TraceCheckUtils]: 19: Hoare triple {41974#true} call #t~ret8 := is_do_write_p_triggered(); {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {41974#true} havoc ~__retres1~0; {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {41974#true} assume !(1 == ~p_dw_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {41974#true} assume !(2 == ~p_dw_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {41974#true} ~__retres1~0 := 0; {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {41974#true} #res := ~__retres1~0; {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41974#true} {41974#true} #1829#return; {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {41974#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {41974#true} is VALID [2022-02-20 20:01:26,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {41974#true} assume !(0 != ~tmp~1); {41974#true} is VALID [2022-02-20 20:01:26,595 INFO L272 TraceCheckUtils]: 29: Hoare triple {41974#true} call #t~ret9 := is_do_read_c_triggered(); {41974#true} is VALID [2022-02-20 20:01:26,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {41974#true} havoc ~__retres1~1; {41974#true} is VALID [2022-02-20 20:01:26,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {41974#true} assume !(1 == ~c_dr_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {41974#true} assume !(2 == ~c_dr_pc~0); {41974#true} is VALID [2022-02-20 20:01:26,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {41974#true} ~__retres1~1 := 0; {42039#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:26,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {42039#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:26,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:26,596 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {42040#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41974#true} #1831#return; {42037#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:26,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {42037#(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; {42038#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:26,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {42038#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41975#false} is VALID [2022-02-20 20:01:26,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {41975#false} assume true; {41975#false} is VALID [2022-02-20 20:01:26,597 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41975#false} {41974#true} #1837#return; {41975#false} is VALID [2022-02-20 20:01:26,597 INFO L272 TraceCheckUtils]: 41: Hoare triple {41975#false} call reset_delta_events1(); {42021#(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:26,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {42021#(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); {41974#true} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {41974#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {41974#true} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,598 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {41974#true} {41975#false} #1839#return; {41975#false} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {41975#false} assume !false; {41975#false} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {41975#false} assume !false; {41975#false} is VALID [2022-02-20 20:01:26,598 INFO L272 TraceCheckUtils]: 49: Hoare triple {41975#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41974#true} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {41974#true} havoc ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {41974#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41974#true} is VALID [2022-02-20 20:01:26,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {41974#true} #res := ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,599 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {41974#true} {41975#false} #1841#return; {41975#false} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {41975#false} assume 0 != eval1_~tmp___1~0#1; {41975#false} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {41975#false} assume 0 == ~p_dw_pc~0; {41975#false} is VALID [2022-02-20 20:01:26,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {41975#false} assume !false; {41975#false} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {41975#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {41975#false} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {41975#false} assume { :end_inline_do_write_p } true; {41975#false} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {41975#false} assume !(0 == ~c_dr_st~0); {41975#false} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {41975#false} assume !false; {41975#false} is VALID [2022-02-20 20:01:26,600 INFO L272 TraceCheckUtils]: 65: Hoare triple {41975#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41974#true} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 66: Hoare triple {41974#true} havoc ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {41974#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41974#true} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {41974#true} #res := ~__retres1~2; {41974#true} is VALID [2022-02-20 20:01:26,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {41974#true} assume true; {41974#true} is VALID [2022-02-20 20:01:26,600 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {41974#true} {41975#false} #1841#return; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {41975#false} assume 0 != eval1_~tmp___1~0#1; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 74: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 75: Hoare triple {41975#false} assume !(0 == ~p_dw_pc~0); {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {41975#false} assume 1 == ~p_dw_pc~0; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 77: Hoare triple {41975#false} assume !(0 == ~q_free~0); {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 78: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,601 INFO L290 TraceCheckUtils]: 79: Hoare triple {41975#false} assume !false; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 80: Hoare triple {41975#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 81: Hoare triple {41975#false} assume { :end_inline_do_write_p } true; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 82: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 83: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 84: Hoare triple {41975#false} assume !(0 == ~c_dr_pc~0); {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 85: Hoare triple {41975#false} assume 2 == ~c_dr_pc~0; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 86: Hoare triple {41975#false} do_read_c_~a~0#1 := ~a_t~0; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {41975#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; {41975#false} is VALID [2022-02-20 20:01:26,602 INFO L290 TraceCheckUtils]: 88: Hoare triple {41975#false} assume !(~p_last_write~0 == ~c_last_read~0); {41975#false} is VALID [2022-02-20 20:01:26,603 INFO L272 TraceCheckUtils]: 89: Hoare triple {41975#false} call error1(); {41975#false} is VALID [2022-02-20 20:01:26,603 INFO L290 TraceCheckUtils]: 90: Hoare triple {41975#false} assume !false; {41975#false} is VALID [2022-02-20 20:01:26,603 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:26,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:26,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151520658] [2022-02-20 20:01:26,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151520658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:26,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:26,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:26,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80736442] [2022-02-20 20:01:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:26,605 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:26,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:26,606 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:26,642 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:26,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:26,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:26,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:26,643 INFO L87 Difference]: Start difference. First operand 1992 states and 2663 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:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:30,244 INFO L93 Difference]: Finished difference Result 3817 states and 5065 transitions. [2022-02-20 20:01:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:30,245 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:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:30,245 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:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 878 transitions. [2022-02-20 20:01:30,249 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:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 878 transitions. [2022-02-20 20:01:30,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 878 transitions. [2022-02-20 20:01:30,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 878 edges. 878 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:30,916 INFO L225 Difference]: With dead ends: 3817 [2022-02-20 20:01:30,917 INFO L226 Difference]: Without dead ends: 2186 [2022-02-20 20:01:30,919 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:30,920 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 920 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:30,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [922 Valid, 2738 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:01:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2022-02-20 20:01:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2052. [2022-02-20 20:01:31,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:31,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2186 states. Second operand has 2052 states, 1655 states have (on average 1.343202416918429) internal successors, (2223), 1680 states have internal predecessors, (2223), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:31,015 INFO L74 IsIncluded]: Start isIncluded. First operand 2186 states. Second operand has 2052 states, 1655 states have (on average 1.343202416918429) internal successors, (2223), 1680 states have internal predecessors, (2223), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:31,017 INFO L87 Difference]: Start difference. First operand 2186 states. Second operand has 2052 states, 1655 states have (on average 1.343202416918429) internal successors, (2223), 1680 states have internal predecessors, (2223), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:31,185 INFO L93 Difference]: Finished difference Result 2186 states and 2906 transitions. [2022-02-20 20:01:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2906 transitions. [2022-02-20 20:01:31,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:31,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:31,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 2052 states, 1655 states have (on average 1.343202416918429) internal successors, (2223), 1680 states have internal predecessors, (2223), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) Second operand 2186 states. [2022-02-20 20:01:31,194 INFO L87 Difference]: Start difference. First operand has 2052 states, 1655 states have (on average 1.343202416918429) internal successors, (2223), 1680 states have internal predecessors, (2223), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) Second operand 2186 states. [2022-02-20 20:01:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:31,338 INFO L93 Difference]: Finished difference Result 2186 states and 2906 transitions. [2022-02-20 20:01:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2906 transitions. [2022-02-20 20:01:31,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:31,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:31,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:31,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1655 states have (on average 1.343202416918429) internal successors, (2223), 1680 states have internal predecessors, (2223), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2022-02-20 20:01:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2717 transitions. [2022-02-20 20:01:31,530 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2717 transitions. Word has length 91 [2022-02-20 20:01:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:31,531 INFO L470 AbstractCegarLoop]: Abstraction has 2052 states and 2717 transitions. [2022-02-20 20:01:31,531 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:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2717 transitions. [2022-02-20 20:01:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:31,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:31,536 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:31,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:31,536 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1649347192, now seen corresponding path program 1 times [2022-02-20 20:01:31,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:31,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284955574] [2022-02-20 20:01:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {54323#(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); {54324#(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:31,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54324#(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:31,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1833#return; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {54324#(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); {54324#(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:31,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {54324#(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); {54324#(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:31,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54324#(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:31,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1835#return; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {54276#true} havoc ~__retres1~0; {54276#true} is VALID [2022-02-20 20:01:31,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {54276#true} assume !(1 == ~p_dw_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {54276#true} assume !(2 == ~p_dw_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {54276#true} ~__retres1~0 := 0; {54276#true} is VALID [2022-02-20 20:01:31,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {54276#true} #res := ~__retres1~0; {54276#true} is VALID [2022-02-20 20:01:31,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,638 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {54276#true} {54276#true} #1829#return; {54276#true} is VALID [2022-02-20 20:01:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {54276#true} havoc ~__retres1~1; {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {54276#true} assume !(1 == ~c_dr_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {54276#true} assume !(2 == ~c_dr_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {54276#true} ~__retres1~1 := 0; {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {54276#true} #res := ~__retres1~1; {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {54276#true} {54276#true} #1831#return; {54276#true} is VALID [2022-02-20 20:01:31,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {54325#(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; {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L272 TraceCheckUtils]: 1: Hoare triple {54276#true} call #t~ret8 := is_do_write_p_triggered(); {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {54276#true} havoc ~__retres1~0; {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {54276#true} assume !(1 == ~p_dw_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {54276#true} assume !(2 == ~p_dw_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {54276#true} ~__retres1~0 := 0; {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {54276#true} #res := ~__retres1~0; {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {54276#true} {54276#true} #1829#return; {54276#true} is VALID [2022-02-20 20:01:31,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {54276#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {54276#true} assume !(0 != ~tmp~1); {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {54276#true} call #t~ret9 := is_do_read_c_triggered(); {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {54276#true} havoc ~__retres1~1; {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {54276#true} assume !(1 == ~c_dr_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {54276#true} assume !(2 == ~c_dr_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {54276#true} ~__retres1~1 := 0; {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {54276#true} #res := ~__retres1~1; {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {54276#true} {54276#true} #1831#return; {54276#true} is VALID [2022-02-20 20:01:31,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {54276#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54276#true} is VALID [2022-02-20 20:01:31,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {54276#true} assume !(0 != ~tmp___0~1); {54276#true} is VALID [2022-02-20 20:01:31,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,657 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {54276#true} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1837#return; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {54324#(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); {54340#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:31,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {54340#(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; {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:31,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:31,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1839#return; {54277#false} is VALID [2022-02-20 20:01:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {54276#true} havoc ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {54276#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54276#true} is VALID [2022-02-20 20:01:31,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {54276#true} #res := ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,679 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {54276#true} {54277#false} #1841#return; {54277#false} is VALID [2022-02-20 20:01:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {54276#true} havoc ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {54276#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54276#true} is VALID [2022-02-20 20:01:31,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {54276#true} #res := ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,683 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {54276#true} {54277#false} #1841#return; {54277#false} is VALID [2022-02-20 20:01:31,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {54276#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {54276#true} is VALID [2022-02-20 20:01:31,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {54276#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {54276#true} is VALID [2022-02-20 20:01:31,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {54276#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {54278#(= ~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; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {54323#(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:31,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {54323#(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); {54324#(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:31,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54324#(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:31,685 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1833#return; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,687 INFO L272 TraceCheckUtils]: 12: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {54324#(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:31,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {54324#(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); {54324#(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:31,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {54324#(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); {54324#(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:31,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {54324#(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:31,688 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {54324#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1835#return; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,689 INFO L272 TraceCheckUtils]: 17: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {54325#(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:31,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {54325#(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; {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L272 TraceCheckUtils]: 19: Hoare triple {54276#true} call #t~ret8 := is_do_write_p_triggered(); {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {54276#true} havoc ~__retres1~0; {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {54276#true} assume !(1 == ~p_dw_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {54276#true} assume !(2 == ~p_dw_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {54276#true} ~__retres1~0 := 0; {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {54276#true} #res := ~__retres1~0; {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,689 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {54276#true} {54276#true} #1829#return; {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {54276#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {54276#true} assume !(0 != ~tmp~1); {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L272 TraceCheckUtils]: 29: Hoare triple {54276#true} call #t~ret9 := is_do_read_c_triggered(); {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {54276#true} havoc ~__retres1~1; {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {54276#true} assume !(1 == ~c_dr_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {54276#true} assume !(2 == ~c_dr_pc~0); {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {54276#true} ~__retres1~1 := 0; {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {54276#true} #res := ~__retres1~1; {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,690 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {54276#true} {54276#true} #1831#return; {54276#true} is VALID [2022-02-20 20:01:31,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {54276#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54276#true} is VALID [2022-02-20 20:01:31,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {54276#true} assume !(0 != ~tmp___0~1); {54276#true} is VALID [2022-02-20 20:01:31,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,691 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {54276#true} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1837#return; {54278#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:31,691 INFO L272 TraceCheckUtils]: 41: Hoare triple {54278#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {54324#(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:31,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {54324#(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); {54340#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:31,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {54340#(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; {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:31,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:31,693 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {54341#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {54278#(= ~q_write_ev~0 ~q_read_ev~0)} #1839#return; {54277#false} is VALID [2022-02-20 20:01:31,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {54277#false} assume !false; {54277#false} is VALID [2022-02-20 20:01:31,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {54277#false} assume !false; {54277#false} is VALID [2022-02-20 20:01:31,693 INFO L272 TraceCheckUtils]: 49: Hoare triple {54277#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {54276#true} is VALID [2022-02-20 20:01:31,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {54276#true} havoc ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {54276#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54276#true} is VALID [2022-02-20 20:01:31,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {54276#true} #res := ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,694 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {54276#true} {54277#false} #1841#return; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {54277#false} assume 0 != eval1_~tmp___1~0#1; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 58: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 59: Hoare triple {54277#false} assume 0 == ~p_dw_pc~0; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {54277#false} assume !false; {54277#false} is VALID [2022-02-20 20:01:31,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {54277#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {54277#false} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {54277#false} assume { :end_inline_do_write_p } true; {54277#false} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {54277#false} assume !(0 == ~c_dr_st~0); {54277#false} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {54277#false} assume !false; {54277#false} is VALID [2022-02-20 20:01:31,695 INFO L272 TraceCheckUtils]: 65: Hoare triple {54277#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {54276#true} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {54276#true} havoc ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {54276#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54276#true} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {54276#true} #res := ~__retres1~2; {54276#true} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {54276#true} assume true; {54276#true} is VALID [2022-02-20 20:01:31,695 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {54276#true} {54277#false} #1841#return; {54277#false} is VALID [2022-02-20 20:01:31,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {54277#false} assume 0 != eval1_~tmp___1~0#1; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 75: Hoare triple {54277#false} assume !(0 == ~p_dw_pc~0); {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {54277#false} assume 1 == ~p_dw_pc~0; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {54277#false} assume !(0 == ~q_free~0); {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 79: Hoare triple {54277#false} assume !false; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 80: Hoare triple {54277#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {54277#false} is VALID [2022-02-20 20:01:31,696 INFO L290 TraceCheckUtils]: 81: Hoare triple {54277#false} assume { :end_inline_do_write_p } true; {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 84: Hoare triple {54277#false} assume !(0 == ~c_dr_pc~0); {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {54277#false} assume 2 == ~c_dr_pc~0; {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 86: Hoare triple {54277#false} do_read_c_~a~0#1 := ~a_t~0; {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 87: Hoare triple {54277#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; {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 88: Hoare triple {54277#false} assume !(~p_last_write~0 == ~c_last_read~0); {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L272 TraceCheckUtils]: 89: Hoare triple {54277#false} call error1(); {54277#false} is VALID [2022-02-20 20:01:31,697 INFO L290 TraceCheckUtils]: 90: Hoare triple {54277#false} assume !false; {54277#false} is VALID [2022-02-20 20:01:31,698 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:31,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:31,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284955574] [2022-02-20 20:01:31,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284955574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:31,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:31,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:31,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077736361] [2022-02-20 20:01:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:31,699 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:31,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:31,699 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:31,743 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:31,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:31,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:31,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:31,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:31,744 INFO L87 Difference]: Start difference. First operand 2052 states and 2717 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:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:35,387 INFO L93 Difference]: Finished difference Result 3579 states and 4681 transitions. [2022-02-20 20:01:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:35,387 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:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:35,388 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:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1070 transitions. [2022-02-20 20:01:35,393 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:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1070 transitions. [2022-02-20 20:01:35,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1070 transitions. [2022-02-20 20:01:36,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1070 edges. 1070 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:36,333 INFO L225 Difference]: With dead ends: 3579 [2022-02-20 20:01:36,334 INFO L226 Difference]: Without dead ends: 2126 [2022-02-20 20:01:36,336 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:36,337 INFO L933 BasicCegarLoop]: 717 mSDtfsCounter, 1728 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:36,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 2116 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:01:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2022-02-20 20:01:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1831. [2022-02-20 20:01:36,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:36,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2126 states. Second operand has 1831 states, 1487 states have (on average 1.3483523873570948) internal successors, (2005), 1507 states have internal predecessors, (2005), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:36,426 INFO L74 IsIncluded]: Start isIncluded. First operand 2126 states. Second operand has 1831 states, 1487 states have (on average 1.3483523873570948) internal successors, (2005), 1507 states have internal predecessors, (2005), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:36,434 INFO L87 Difference]: Start difference. First operand 2126 states. Second operand has 1831 states, 1487 states have (on average 1.3483523873570948) internal successors, (2005), 1507 states have internal predecessors, (2005), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:36,564 INFO L93 Difference]: Finished difference Result 2126 states and 2804 transitions. [2022-02-20 20:01:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2804 transitions. [2022-02-20 20:01:36,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:36,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:36,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 1831 states, 1487 states have (on average 1.3483523873570948) internal successors, (2005), 1507 states have internal predecessors, (2005), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 2126 states. [2022-02-20 20:01:36,588 INFO L87 Difference]: Start difference. First operand has 1831 states, 1487 states have (on average 1.3483523873570948) internal successors, (2005), 1507 states have internal predecessors, (2005), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 2126 states. [2022-02-20 20:01:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:36,739 INFO L93 Difference]: Finished difference Result 2126 states and 2804 transitions. [2022-02-20 20:01:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2804 transitions. [2022-02-20 20:01:36,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:36,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:36,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:36,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1487 states have (on average 1.3483523873570948) internal successors, (2005), 1507 states have internal predecessors, (2005), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2431 transitions. [2022-02-20 20:01:36,932 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2431 transitions. Word has length 91 [2022-02-20 20:01:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:36,932 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2431 transitions. [2022-02-20 20:01:36,933 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:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2431 transitions. [2022-02-20 20:01:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:36,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:36,934 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:36,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:36,934 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash -706458058, now seen corresponding path program 1 times [2022-02-20 20:01:36,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:36,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457128707] [2022-02-20 20:01:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:36,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {65856#(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); {65809#true} is VALID [2022-02-20 20:01:36,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:36,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65809#true} {65809#true} #1833#return; {65809#true} is VALID [2022-02-20 20:01:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:36,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {65857#(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); {65809#true} is VALID [2022-02-20 20:01:36,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume !(0 == ~q_write_ev~0); {65809#true} is VALID [2022-02-20 20:01:36,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:36,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65809#true} {65814#(= ~c_dr_st~0 0)} #1835#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {65809#true} havoc ~__retres1~0; {65809#true} is VALID [2022-02-20 20:01:37,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume !(1 == ~p_dw_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} assume !(2 == ~p_dw_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {65809#true} ~__retres1~0 := 0; {65809#true} is VALID [2022-02-20 20:01:37,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {65809#true} #res := ~__retres1~0; {65809#true} is VALID [2022-02-20 20:01:37,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,009 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {65809#true} {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1829#return; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {65809#true} havoc ~__retres1~1; {65809#true} is VALID [2022-02-20 20:01:37,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume !(1 == ~c_dr_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} assume !(2 == ~c_dr_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {65809#true} ~__retres1~1 := 0; {65809#true} is VALID [2022-02-20 20:01:37,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {65809#true} #res := ~__retres1~1; {65809#true} is VALID [2022-02-20 20:01:37,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,013 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {65809#true} {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1831#return; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {65858#(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; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,013 INFO L272 TraceCheckUtils]: 1: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {65809#true} is VALID [2022-02-20 20:01:37,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} havoc ~__retres1~0; {65809#true} is VALID [2022-02-20 20:01:37,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {65809#true} assume !(1 == ~p_dw_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {65809#true} assume !(2 == ~p_dw_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {65809#true} ~__retres1~0 := 0; {65809#true} is VALID [2022-02-20 20:01:37,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {65809#true} #res := ~__retres1~0; {65809#true} is VALID [2022-02-20 20:01:37,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,014 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {65809#true} {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1829#return; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,015 INFO L272 TraceCheckUtils]: 11: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {65809#true} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {65809#true} havoc ~__retres1~1; {65809#true} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {65809#true} assume !(1 == ~c_dr_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {65809#true} assume !(2 == ~c_dr_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {65809#true} ~__retres1~1 := 0; {65809#true} is VALID [2022-02-20 20:01:37,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {65809#true} #res := ~__retres1~1; {65809#true} is VALID [2022-02-20 20:01:37,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,016 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {65809#true} {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1831#return; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,017 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {65814#(= ~c_dr_st~0 0)} #1837#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {65857#(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); {65809#true} is VALID [2022-02-20 20:01:37,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume !(1 == ~q_write_ev~0); {65809#true} is VALID [2022-02-20 20:01:37,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65809#true} {65814#(= ~c_dr_st~0 0)} #1839#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {65809#true} havoc ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65809#true} is VALID [2022-02-20 20:01:37,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} #res := ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,026 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65809#true} {65814#(= ~c_dr_st~0 0)} #1841#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:37,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {65809#true} havoc ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65809#true} is VALID [2022-02-20 20:01:37,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} #res := ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,028 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65809#true} {65810#false} #1841#return; {65810#false} is VALID [2022-02-20 20:01:37,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {65809#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {65809#true} is VALID [2022-02-20 20:01:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {65809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {65809#true} is VALID [2022-02-20 20:01:37,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {65809#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {65809#true} is VALID [2022-02-20 20:01:37,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {65809#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; {65809#true} is VALID [2022-02-20 20:01:37,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {65809#true} call update_channels1(); {65856#(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:37,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {65856#(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); {65809#true} is VALID [2022-02-20 20:01:37,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,029 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65809#true} {65809#true} #1833#return; {65809#true} is VALID [2022-02-20 20:01:37,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {65809#true} assume { :begin_inline_init_threads1 } true; {65809#true} is VALID [2022-02-20 20:01:37,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {65809#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {65809#true} is VALID [2022-02-20 20:01:37,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {65809#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {65814#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,030 INFO L272 TraceCheckUtils]: 12: Hoare triple {65814#(= ~c_dr_st~0 0)} call fire_delta_events1(); {65857#(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:37,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {65857#(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); {65809#true} is VALID [2022-02-20 20:01:37,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {65809#true} assume !(0 == ~q_write_ev~0); {65809#true} is VALID [2022-02-20 20:01:37,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,031 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65809#true} {65814#(= ~c_dr_st~0 0)} #1835#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,031 INFO L272 TraceCheckUtils]: 17: Hoare triple {65814#(= ~c_dr_st~0 0)} call activate_threads1(); {65858#(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:37,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {65858#(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; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,032 INFO L272 TraceCheckUtils]: 19: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {65809#true} is VALID [2022-02-20 20:01:37,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {65809#true} havoc ~__retres1~0; {65809#true} is VALID [2022-02-20 20:01:37,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {65809#true} assume !(1 == ~p_dw_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {65809#true} assume !(2 == ~p_dw_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {65809#true} ~__retres1~0 := 0; {65809#true} is VALID [2022-02-20 20:01:37,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {65809#true} #res := ~__retres1~0; {65809#true} is VALID [2022-02-20 20:01:37,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,033 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {65809#true} {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1829#return; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,034 INFO L272 TraceCheckUtils]: 29: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {65809#true} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {65809#true} havoc ~__retres1~1; {65809#true} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {65809#true} assume !(1 == ~c_dr_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {65809#true} assume !(2 == ~c_dr_pc~0); {65809#true} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {65809#true} ~__retres1~1 := 0; {65809#true} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {65809#true} #res := ~__retres1~1; {65809#true} is VALID [2022-02-20 20:01:37,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,035 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {65809#true} {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1831#return; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:37,036 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65859#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {65814#(= ~c_dr_st~0 0)} #1837#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,036 INFO L272 TraceCheckUtils]: 41: Hoare triple {65814#(= ~c_dr_st~0 0)} call reset_delta_events1(); {65857#(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:37,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {65857#(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); {65809#true} is VALID [2022-02-20 20:01:37,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {65809#true} assume !(1 == ~q_write_ev~0); {65809#true} is VALID [2022-02-20 20:01:37,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,037 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {65809#true} {65814#(= ~c_dr_st~0 0)} #1839#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {65814#(= ~c_dr_st~0 0)} assume !false; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {65814#(= ~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; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {65814#(= ~c_dr_st~0 0)} assume !false; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,038 INFO L272 TraceCheckUtils]: 49: Hoare triple {65814#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65809#true} is VALID [2022-02-20 20:01:37,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {65809#true} havoc ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {65809#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65809#true} is VALID [2022-02-20 20:01:37,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {65809#true} #res := ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,039 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {65809#true} {65814#(= ~c_dr_st~0 0)} #1841#return; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {65814#(= ~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; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {65814#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {65814#(= ~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; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {65814#(= ~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; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {65814#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {65814#(= ~c_dr_st~0 0)} assume !false; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {65814#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,041 INFO L290 TraceCheckUtils]: 62: Hoare triple {65814#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {65814#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:37,041 INFO L290 TraceCheckUtils]: 63: Hoare triple {65814#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {65810#false} is VALID [2022-02-20 20:01:37,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {65810#false} assume !false; {65810#false} is VALID [2022-02-20 20:01:37,041 INFO L272 TraceCheckUtils]: 65: Hoare triple {65810#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65809#true} is VALID [2022-02-20 20:01:37,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {65809#true} havoc ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {65809#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65809#true} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {65809#true} #res := ~__retres1~2; {65809#true} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 69: Hoare triple {65809#true} assume true; {65809#true} is VALID [2022-02-20 20:01:37,042 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {65809#true} {65810#false} #1841#return; {65810#false} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 72: Hoare triple {65810#false} assume 0 != eval1_~tmp___1~0#1; {65810#false} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {65810#false} assume !(0 == ~p_dw_pc~0); {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 76: Hoare triple {65810#false} assume 1 == ~p_dw_pc~0; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 77: Hoare triple {65810#false} assume !(0 == ~q_free~0); {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 78: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 79: Hoare triple {65810#false} assume !false; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 80: Hoare triple {65810#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {65810#false} assume { :end_inline_do_write_p } true; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 82: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 83: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,043 INFO L290 TraceCheckUtils]: 84: Hoare triple {65810#false} assume !(0 == ~c_dr_pc~0); {65810#false} is VALID [2022-02-20 20:01:37,044 INFO L290 TraceCheckUtils]: 85: Hoare triple {65810#false} assume 2 == ~c_dr_pc~0; {65810#false} is VALID [2022-02-20 20:01:37,044 INFO L290 TraceCheckUtils]: 86: Hoare triple {65810#false} do_read_c_~a~0#1 := ~a_t~0; {65810#false} is VALID [2022-02-20 20:01:37,044 INFO L290 TraceCheckUtils]: 87: Hoare triple {65810#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; {65810#false} is VALID [2022-02-20 20:01:37,044 INFO L290 TraceCheckUtils]: 88: Hoare triple {65810#false} assume !(~p_last_write~0 == ~c_last_read~0); {65810#false} is VALID [2022-02-20 20:01:37,044 INFO L272 TraceCheckUtils]: 89: Hoare triple {65810#false} call error1(); {65810#false} is VALID [2022-02-20 20:01:37,044 INFO L290 TraceCheckUtils]: 90: Hoare triple {65810#false} assume !false; {65810#false} is VALID [2022-02-20 20:01:37,044 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:37,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:37,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457128707] [2022-02-20 20:01:37,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457128707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:37,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:37,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:37,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528176623] [2022-02-20 20:01:37,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:37,046 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:37,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:37,046 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:37,094 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:37,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:37,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:37,095 INFO L87 Difference]: Start difference. First operand 1831 states and 2431 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:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:40,278 INFO L93 Difference]: Finished difference Result 4983 states and 6543 transitions. [2022-02-20 20:01:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:40,278 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:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:40,279 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:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1019 transitions. [2022-02-20 20:01:40,285 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:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1019 transitions. [2022-02-20 20:01:40,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1019 transitions. [2022-02-20 20:01:40,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1019 edges. 1019 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:41,386 INFO L225 Difference]: With dead ends: 4983 [2022-02-20 20:01:41,387 INFO L226 Difference]: Without dead ends: 3514 [2022-02-20 20:01:41,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:01:41,391 INFO L933 BasicCegarLoop]: 723 mSDtfsCounter, 1637 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:41,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 1813 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:01:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-02-20 20:01:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3300. [2022-02-20 20:01:41,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:41,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3514 states. Second operand has 3300 states, 2636 states have (on average 1.302352048558422) internal successors, (3433), 2685 states have internal predecessors, (3433), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:41,591 INFO L74 IsIncluded]: Start isIncluded. First operand 3514 states. Second operand has 3300 states, 2636 states have (on average 1.302352048558422) internal successors, (3433), 2685 states have internal predecessors, (3433), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:41,594 INFO L87 Difference]: Start difference. First operand 3514 states. Second operand has 3300 states, 2636 states have (on average 1.302352048558422) internal successors, (3433), 2685 states have internal predecessors, (3433), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:41,975 INFO L93 Difference]: Finished difference Result 3514 states and 4599 transitions. [2022-02-20 20:01:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4599 transitions. [2022-02-20 20:01:41,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:41,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:41,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 3300 states, 2636 states have (on average 1.302352048558422) internal successors, (3433), 2685 states have internal predecessors, (3433), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) Second operand 3514 states. [2022-02-20 20:01:41,991 INFO L87 Difference]: Start difference. First operand has 3300 states, 2636 states have (on average 1.302352048558422) internal successors, (3433), 2685 states have internal predecessors, (3433), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) Second operand 3514 states. [2022-02-20 20:01:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:42,383 INFO L93 Difference]: Finished difference Result 3514 states and 4599 transitions. [2022-02-20 20:01:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4599 transitions. [2022-02-20 20:01:42,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:42,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:42,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:42,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2636 states have (on average 1.302352048558422) internal successors, (3433), 2685 states have internal predecessors, (3433), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2022-02-20 20:01:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4303 transitions. [2022-02-20 20:01:42,942 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4303 transitions. Word has length 91 [2022-02-20 20:01:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:42,942 INFO L470 AbstractCegarLoop]: Abstraction has 3300 states and 4303 transitions. [2022-02-20 20:01:42,942 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:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4303 transitions. [2022-02-20 20:01:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:42,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:42,944 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:42,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:42,944 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1764296136, now seen corresponding path program 1 times [2022-02-20 20:01:42,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:42,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378594306] [2022-02-20 20:01:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:42,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:42,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {84034#(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); {83987#true} is VALID [2022-02-20 20:01:42,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:42,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83987#true} {83989#(= 1 ~c_dr_i~0)} #1833#return; {83989#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:42,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {84035#(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); {83987#true} is VALID [2022-02-20 20:01:42,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume !(0 == ~q_write_ev~0); {83987#true} is VALID [2022-02-20 20:01:42,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:42,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83987#true} {83988#false} #1835#return; {83988#false} is VALID [2022-02-20 20:01:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:42,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {83987#true} havoc ~__retres1~0; {83987#true} is VALID [2022-02-20 20:01:42,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume !(1 == ~p_dw_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} assume !(2 == ~p_dw_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {83987#true} ~__retres1~0 := 0; {83987#true} is VALID [2022-02-20 20:01:42,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {83987#true} #res := ~__retres1~0; {83987#true} is VALID [2022-02-20 20:01:42,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:42,994 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83987#true} {83987#true} #1829#return; {83987#true} is VALID [2022-02-20 20:01:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:42,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {83987#true} havoc ~__retres1~1; {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume !(1 == ~c_dr_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} assume !(2 == ~c_dr_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {83987#true} ~__retres1~1 := 0; {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {83987#true} #res := ~__retres1~1; {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83987#true} {83987#true} #1831#return; {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {84036#(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; {83987#true} is VALID [2022-02-20 20:01:42,997 INFO L272 TraceCheckUtils]: 1: Hoare triple {83987#true} call #t~ret8 := is_do_write_p_triggered(); {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} havoc ~__retres1~0; {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {83987#true} assume !(1 == ~p_dw_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {83987#true} assume !(2 == ~p_dw_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {83987#true} ~__retres1~0 := 0; {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {83987#true} #res := ~__retres1~0; {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {83987#true} {83987#true} #1829#return; {83987#true} is VALID [2022-02-20 20:01:42,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {83987#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {83987#true} assume !(0 != ~tmp~1); {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L272 TraceCheckUtils]: 11: Hoare triple {83987#true} call #t~ret9 := is_do_read_c_triggered(); {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {83987#true} havoc ~__retres1~1; {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {83987#true} assume !(1 == ~c_dr_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {83987#true} assume !(2 == ~c_dr_pc~0); {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {83987#true} ~__retres1~1 := 0; {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {83987#true} #res := ~__retres1~1; {83987#true} is VALID [2022-02-20 20:01:42,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,000 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {83987#true} {83987#true} #1831#return; {83987#true} is VALID [2022-02-20 20:01:43,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {83987#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {83987#true} is VALID [2022-02-20 20:01:43,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {83987#true} assume !(0 != ~tmp___0~1); {83987#true} is VALID [2022-02-20 20:01:43,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,000 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {83987#true} {83988#false} #1837#return; {83988#false} is VALID [2022-02-20 20:01:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {84035#(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); {83987#true} is VALID [2022-02-20 20:01:43,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume !(1 == ~q_write_ev~0); {83987#true} is VALID [2022-02-20 20:01:43,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83987#true} {83988#false} #1839#return; {83988#false} is VALID [2022-02-20 20:01:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {83987#true} havoc ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83987#true} is VALID [2022-02-20 20:01:43,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} #res := ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,007 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83987#true} {83988#false} #1841#return; {83988#false} is VALID [2022-02-20 20:01:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {83987#true} havoc ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83987#true} is VALID [2022-02-20 20:01:43,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} #res := ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,009 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83987#true} {83988#false} #1841#return; {83988#false} is VALID [2022-02-20 20:01:43,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {83987#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {83987#true} is VALID [2022-02-20 20:01:43,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {83987#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {83987#true} is VALID [2022-02-20 20:01:43,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {83987#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {83989#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:43,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {83989#(= 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; {83989#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:43,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {83989#(= 1 ~c_dr_i~0)} call update_channels1(); {84034#(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,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {84034#(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); {83987#true} is VALID [2022-02-20 20:01:43,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,011 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {83987#true} {83989#(= 1 ~c_dr_i~0)} #1833#return; {83989#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:43,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {83989#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {83989#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:43,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {83989#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {83989#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:43,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {83989#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {83988#false} is VALID [2022-02-20 20:01:43,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {83988#false} assume { :end_inline_init_threads1 } true; {83988#false} is VALID [2022-02-20 20:01:43,012 INFO L272 TraceCheckUtils]: 12: Hoare triple {83988#false} call fire_delta_events1(); {84035#(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,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {84035#(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); {83987#true} is VALID [2022-02-20 20:01:43,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {83987#true} assume !(0 == ~q_write_ev~0); {83987#true} is VALID [2022-02-20 20:01:43,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,013 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {83987#true} {83988#false} #1835#return; {83988#false} is VALID [2022-02-20 20:01:43,013 INFO L272 TraceCheckUtils]: 17: Hoare triple {83988#false} call activate_threads1(); {84036#(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,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {84036#(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; {83987#true} is VALID [2022-02-20 20:01:43,013 INFO L272 TraceCheckUtils]: 19: Hoare triple {83987#true} call #t~ret8 := is_do_write_p_triggered(); {83987#true} is VALID [2022-02-20 20:01:43,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {83987#true} havoc ~__retres1~0; {83987#true} is VALID [2022-02-20 20:01:43,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {83987#true} assume !(1 == ~p_dw_pc~0); {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {83987#true} assume !(2 == ~p_dw_pc~0); {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {83987#true} ~__retres1~0 := 0; {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {83987#true} #res := ~__retres1~0; {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {83987#true} {83987#true} #1829#return; {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {83987#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {83987#true} assume !(0 != ~tmp~1); {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L272 TraceCheckUtils]: 29: Hoare triple {83987#true} call #t~ret9 := is_do_read_c_triggered(); {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {83987#true} havoc ~__retres1~1; {83987#true} is VALID [2022-02-20 20:01:43,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {83987#true} assume !(1 == ~c_dr_pc~0); {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {83987#true} assume !(2 == ~c_dr_pc~0); {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {83987#true} ~__retres1~1 := 0; {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {83987#true} #res := ~__retres1~1; {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {83987#true} {83987#true} #1831#return; {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {83987#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {83987#true} assume !(0 != ~tmp___0~1); {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,015 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {83987#true} {83988#false} #1837#return; {83988#false} is VALID [2022-02-20 20:01:43,015 INFO L272 TraceCheckUtils]: 41: Hoare triple {83988#false} call reset_delta_events1(); {84035#(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,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {84035#(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); {83987#true} is VALID [2022-02-20 20:01:43,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {83987#true} assume !(1 == ~q_write_ev~0); {83987#true} is VALID [2022-02-20 20:01:43,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,016 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {83987#true} {83988#false} #1839#return; {83988#false} is VALID [2022-02-20 20:01:43,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {83988#false} assume !false; {83988#false} is VALID [2022-02-20 20:01:43,016 INFO L290 TraceCheckUtils]: 47: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {83988#false} assume !false; {83988#false} is VALID [2022-02-20 20:01:43,016 INFO L272 TraceCheckUtils]: 49: Hoare triple {83988#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {83987#true} is VALID [2022-02-20 20:01:43,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {83987#true} havoc ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {83987#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83987#true} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {83987#true} #res := ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,017 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {83987#true} {83988#false} #1841#return; {83988#false} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {83988#false} assume 0 != eval1_~tmp___1~0#1; {83988#false} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {83988#false} assume 0 == ~p_dw_pc~0; {83988#false} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {83988#false} assume !false; {83988#false} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {83988#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {83988#false} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {83988#false} assume { :end_inline_do_write_p } true; {83988#false} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {83988#false} assume !(0 == ~c_dr_st~0); {83988#false} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {83988#false} assume !false; {83988#false} is VALID [2022-02-20 20:01:43,018 INFO L272 TraceCheckUtils]: 65: Hoare triple {83988#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {83987#true} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {83987#true} havoc ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {83987#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83987#true} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 68: Hoare triple {83987#true} #res := ~__retres1~2; {83987#true} is VALID [2022-02-20 20:01:43,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {83987#true} assume true; {83987#true} is VALID [2022-02-20 20:01:43,019 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {83987#true} {83988#false} #1841#return; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {83988#false} assume 0 != eval1_~tmp___1~0#1; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 75: Hoare triple {83988#false} assume !(0 == ~p_dw_pc~0); {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {83988#false} assume 1 == ~p_dw_pc~0; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {83988#false} assume !(0 == ~q_free~0); {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 78: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,019 INFO L290 TraceCheckUtils]: 79: Hoare triple {83988#false} assume !false; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {83988#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 81: Hoare triple {83988#false} assume { :end_inline_do_write_p } true; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 82: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 83: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 84: Hoare triple {83988#false} assume !(0 == ~c_dr_pc~0); {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 85: Hoare triple {83988#false} assume 2 == ~c_dr_pc~0; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 86: Hoare triple {83988#false} do_read_c_~a~0#1 := ~a_t~0; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 87: Hoare triple {83988#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; {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L290 TraceCheckUtils]: 88: Hoare triple {83988#false} assume !(~p_last_write~0 == ~c_last_read~0); {83988#false} is VALID [2022-02-20 20:01:43,020 INFO L272 TraceCheckUtils]: 89: Hoare triple {83988#false} call error1(); {83988#false} is VALID [2022-02-20 20:01:43,021 INFO L290 TraceCheckUtils]: 90: Hoare triple {83988#false} assume !false; {83988#false} is VALID [2022-02-20 20:01:43,021 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,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:43,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378594306] [2022-02-20 20:01:43,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378594306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:43,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:43,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:43,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349755136] [2022-02-20 20:01:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:43,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:43,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:43,067 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,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:43,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:43,068 INFO L87 Difference]: Start difference. First operand 3300 states and 4303 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:45,697 INFO L93 Difference]: Finished difference Result 4884 states and 6287 transitions. [2022-02-20 20:01:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2022-02-20 20:01:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2022-02-20 20:01:45,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 864 transitions. [2022-02-20 20:01:46,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 864 edges. 864 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:46,425 INFO L225 Difference]: With dead ends: 4884 [2022-02-20 20:01:46,425 INFO L226 Difference]: Without dead ends: 1946 [2022-02-20 20:01:46,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:46,429 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 1034 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:46,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 1588 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2022-02-20 20:01:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1831. [2022-02-20 20:01:46,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:46,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1946 states. Second operand has 1831 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1507 states have internal predecessors, (1968), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:46,518 INFO L74 IsIncluded]: Start isIncluded. First operand 1946 states. Second operand has 1831 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1507 states have internal predecessors, (1968), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:46,519 INFO L87 Difference]: Start difference. First operand 1946 states. Second operand has 1831 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1507 states have internal predecessors, (1968), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:46,635 INFO L93 Difference]: Finished difference Result 1946 states and 2554 transitions. [2022-02-20 20:01:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2554 transitions. [2022-02-20 20:01:46,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:46,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:46,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 1831 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1507 states have internal predecessors, (1968), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 1946 states. [2022-02-20 20:01:46,644 INFO L87 Difference]: Start difference. First operand has 1831 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1507 states have internal predecessors, (1968), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) Second operand 1946 states. [2022-02-20 20:01:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:46,785 INFO L93 Difference]: Finished difference Result 1946 states and 2554 transitions. [2022-02-20 20:01:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2554 transitions. [2022-02-20 20:01:46,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:46,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:46,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:46,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1487 states have (on average 1.3234700739744452) internal successors, (1968), 1507 states have internal predecessors, (1968), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2022-02-20 20:01:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2394 transitions. [2022-02-20 20:01:46,939 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2394 transitions. Word has length 91 [2022-02-20 20:01:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:46,939 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2394 transitions. [2022-02-20 20:01:46,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2394 transitions. [2022-02-20 20:01:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:46,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:46,940 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:46,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:46,940 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:46,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2118566296, now seen corresponding path program 1 times [2022-02-20 20:01:46,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:46,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166874500] [2022-02-20 20:01:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {96981#(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); {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {96935#(= ~q_read_ev~0 2)} #1833#return; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {96983#(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); {96933#true} is VALID [2022-02-20 20:01:47,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume !(0 == ~q_write_ev~0); {96933#true} is VALID [2022-02-20 20:01:47,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96933#true} {96935#(= ~q_read_ev~0 2)} #1835#return; {96933#true} is VALID [2022-02-20 20:01:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {96933#true} havoc ~__retres1~0; {96933#true} is VALID [2022-02-20 20:01:47,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume !(1 == ~p_dw_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} assume !(2 == ~p_dw_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {96933#true} ~__retres1~0 := 0; {96933#true} is VALID [2022-02-20 20:01:47,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {96933#true} #res := ~__retres1~0; {96933#true} is VALID [2022-02-20 20:01:47,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,020 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96933#true} {96933#true} #1829#return; {96933#true} is VALID [2022-02-20 20:01:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {96933#true} havoc ~__retres1~1; {96933#true} is VALID [2022-02-20 20:01:47,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume !(1 == ~c_dr_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} assume !(2 == ~c_dr_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {96933#true} ~__retres1~1 := 0; {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {96933#true} #res := ~__retres1~1; {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96933#true} {96933#true} #1831#return; {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {96984#(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; {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L272 TraceCheckUtils]: 1: Hoare triple {96933#true} call #t~ret8 := is_do_write_p_triggered(); {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} havoc ~__retres1~0; {96933#true} is VALID [2022-02-20 20:01:47,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {96933#true} assume !(1 == ~p_dw_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {96933#true} assume !(2 == ~p_dw_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {96933#true} ~__retres1~0 := 0; {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {96933#true} #res := ~__retres1~0; {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {96933#true} {96933#true} #1829#return; {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {96933#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {96933#true} assume !(0 != ~tmp~1); {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L272 TraceCheckUtils]: 11: Hoare triple {96933#true} call #t~ret9 := is_do_read_c_triggered(); {96933#true} is VALID [2022-02-20 20:01:47,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {96933#true} havoc ~__retres1~1; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {96933#true} assume !(1 == ~c_dr_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {96933#true} assume !(2 == ~c_dr_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {96933#true} ~__retres1~1 := 0; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {96933#true} #res := ~__retres1~1; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {96933#true} {96933#true} #1831#return; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {96933#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {96933#true} assume !(0 != ~tmp___0~1); {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,028 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {96933#true} {96933#true} #1837#return; {96933#true} is VALID [2022-02-20 20:01:47,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {96983#(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); {96933#true} is VALID [2022-02-20 20:01:47,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume !(1 == ~q_write_ev~0); {96933#true} is VALID [2022-02-20 20:01:47,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96933#true} {96933#true} #1839#return; {96933#true} is VALID [2022-02-20 20:01:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {96933#true} havoc ~__retres1~2; {96933#true} is VALID [2022-02-20 20:01:47,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96933#true} is VALID [2022-02-20 20:01:47,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} #res := ~__retres1~2; {96933#true} is VALID [2022-02-20 20:01:47,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,034 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96933#true} {96933#true} #1841#return; {96933#true} is VALID [2022-02-20 20:01:47,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:47,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {96933#true} havoc ~__retres1~2; {96933#true} is VALID [2022-02-20 20:01:47,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96999#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:47,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {96999#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {96999#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:47,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {96999#(= ~p_dw_st~0 0)} assume true; {96999#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:47,042 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96999#(= ~p_dw_st~0 0)} {96975#(not (= ~p_dw_st~0 0))} #1841#return; {96934#false} is VALID [2022-02-20 20:01:47,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {96933#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {96933#true} is VALID [2022-02-20 20:01:47,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {96933#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {96933#true} is VALID [2022-02-20 20:01:47,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {96933#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {96935#(= ~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; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {96935#(= ~q_read_ev~0 2)} call update_channels1(); {96981#(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:47,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {96981#(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); {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:47,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:47,045 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96982#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {96935#(= ~q_read_ev~0 2)} #1833#return; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {96935#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {96935#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {96935#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {96935#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {96935#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:47,046 INFO L272 TraceCheckUtils]: 12: Hoare triple {96935#(= ~q_read_ev~0 2)} call fire_delta_events1(); {96983#(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:47,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {96983#(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); {96933#true} is VALID [2022-02-20 20:01:47,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {96933#true} assume !(0 == ~q_write_ev~0); {96933#true} is VALID [2022-02-20 20:01:47,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,047 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96933#true} {96935#(= ~q_read_ev~0 2)} #1835#return; {96933#true} is VALID [2022-02-20 20:01:47,047 INFO L272 TraceCheckUtils]: 17: Hoare triple {96933#true} call activate_threads1(); {96984#(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:47,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {96984#(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; {96933#true} is VALID [2022-02-20 20:01:47,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {96933#true} call #t~ret8 := is_do_write_p_triggered(); {96933#true} is VALID [2022-02-20 20:01:47,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {96933#true} havoc ~__retres1~0; {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {96933#true} assume !(1 == ~p_dw_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {96933#true} assume !(2 == ~p_dw_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {96933#true} ~__retres1~0 := 0; {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {96933#true} #res := ~__retres1~0; {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {96933#true} {96933#true} #1829#return; {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {96933#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {96933#true} assume !(0 != ~tmp~1); {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L272 TraceCheckUtils]: 29: Hoare triple {96933#true} call #t~ret9 := is_do_read_c_triggered(); {96933#true} is VALID [2022-02-20 20:01:47,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {96933#true} havoc ~__retres1~1; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {96933#true} assume !(1 == ~c_dr_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {96933#true} assume !(2 == ~c_dr_pc~0); {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {96933#true} ~__retres1~1 := 0; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {96933#true} #res := ~__retres1~1; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {96933#true} {96933#true} #1831#return; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {96933#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {96933#true} assume !(0 != ~tmp___0~1); {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,049 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {96933#true} {96933#true} #1837#return; {96933#true} is VALID [2022-02-20 20:01:47,050 INFO L272 TraceCheckUtils]: 41: Hoare triple {96933#true} call reset_delta_events1(); {96983#(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:47,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {96983#(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); {96933#true} is VALID [2022-02-20 20:01:47,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {96933#true} assume !(1 == ~q_write_ev~0); {96933#true} is VALID [2022-02-20 20:01:47,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,050 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {96933#true} {96933#true} #1839#return; {96933#true} is VALID [2022-02-20 20:01:47,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {96933#true} assume !false; {96933#true} is VALID [2022-02-20 20:01:47,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {96933#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; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {96933#true} assume !false; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L272 TraceCheckUtils]: 49: Hoare triple {96933#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {96933#true} havoc ~__retres1~2; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {96933#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {96933#true} #res := ~__retres1~2; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {96933#true} assume true; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {96933#true} {96933#true} #1841#return; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {96933#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; {96933#true} is VALID [2022-02-20 20:01:47,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {96933#true} assume 0 != eval1_~tmp___1~0#1; {96933#true} is VALID [2022-02-20 20:01:47,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {96933#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; {96933#true} is VALID [2022-02-20 20:01:47,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {96933#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; {96933#true} is VALID [2022-02-20 20:01:47,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {96933#true} assume 0 == ~p_dw_pc~0; {96933#true} is VALID [2022-02-20 20:01:47,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {96933#true} assume !false; {96933#true} is VALID [2022-02-20 20:01:47,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {96933#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96975#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:47,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {96975#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {96975#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:47,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {96975#(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; {96975#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:47,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {96975#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {96975#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:47,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {96975#(not (= ~p_dw_st~0 0))} assume !false; {96975#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:47,053 INFO L272 TraceCheckUtils]: 66: Hoare triple {96975#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96933#true} is VALID [2022-02-20 20:01:47,053 INFO L290 TraceCheckUtils]: 67: Hoare triple {96933#true} havoc ~__retres1~2; {96933#true} is VALID [2022-02-20 20:01:47,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {96933#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96999#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:47,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {96999#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {96999#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:47,054 INFO L290 TraceCheckUtils]: 70: Hoare triple {96999#(= ~p_dw_st~0 0)} assume true; {96999#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:47,055 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {96999#(= ~p_dw_st~0 0)} {96975#(not (= ~p_dw_st~0 0))} #1841#return; {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 72: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 73: Hoare triple {96934#false} assume 0 != eval1_~tmp___1~0#1; {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 74: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 75: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {96934#false} assume !(0 == ~p_dw_pc~0); {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {96934#false} assume 1 == ~p_dw_pc~0; {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 78: Hoare triple {96934#false} assume !(0 == ~q_free~0); {96934#false} is VALID [2022-02-20 20:01:47,055 INFO L290 TraceCheckUtils]: 79: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {96934#false} assume !false; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {96934#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 82: Hoare triple {96934#false} assume { :end_inline_do_write_p } true; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 83: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 85: Hoare triple {96934#false} assume !(0 == ~c_dr_pc~0); {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {96934#false} assume 2 == ~c_dr_pc~0; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 87: Hoare triple {96934#false} do_read_c_~a~0#1 := ~a_t~0; {96934#false} is VALID [2022-02-20 20:01:47,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {96934#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; {96934#false} is VALID [2022-02-20 20:01:47,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {96934#false} assume !(~p_last_write~0 == ~c_last_read~0); {96934#false} is VALID [2022-02-20 20:01:47,057 INFO L272 TraceCheckUtils]: 90: Hoare triple {96934#false} call error1(); {96934#false} is VALID [2022-02-20 20:01:47,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {96934#false} assume !false; {96934#false} is VALID [2022-02-20 20:01:47,057 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:47,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:47,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166874500] [2022-02-20 20:01:47,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166874500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:47,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:47,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:47,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252937487] [2022-02-20 20:01:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:47,058 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:47,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:47,059 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:47,104 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:47,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:47,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:47,105 INFO L87 Difference]: Start difference. First operand 1831 states and 2394 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) [2022-02-20 20:01:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:51,602 INFO L93 Difference]: Finished difference Result 4249 states and 5477 transitions. [2022-02-20 20:01:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:01:51,603 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:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 20:01:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1304 transitions. [2022-02-20 20:01:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 20:01:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1304 transitions. [2022-02-20 20:01:51,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1304 transitions. [2022-02-20 20:01:52,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1304 edges. 1304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:52,663 INFO L225 Difference]: With dead ends: 4249 [2022-02-20 20:01:52,663 INFO L226 Difference]: Without dead ends: 2629 [2022-02-20 20:01:52,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:01:52,666 INFO L933 BasicCegarLoop]: 758 mSDtfsCounter, 2410 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:52,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2452 Valid, 2188 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:01:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-02-20 20:01:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2452. [2022-02-20 20:01:52,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:52,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2629 states. Second operand has 2452 states, 1954 states have (on average 1.284544524053224) internal successors, (2510), 1982 states have internal predecessors, (2510), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) [2022-02-20 20:01:52,792 INFO L74 IsIncluded]: Start isIncluded. First operand 2629 states. Second operand has 2452 states, 1954 states have (on average 1.284544524053224) internal successors, (2510), 1982 states have internal predecessors, (2510), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) [2022-02-20 20:01:52,794 INFO L87 Difference]: Start difference. First operand 2629 states. Second operand has 2452 states, 1954 states have (on average 1.284544524053224) internal successors, (2510), 1982 states have internal predecessors, (2510), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) [2022-02-20 20:01:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:52,986 INFO L93 Difference]: Finished difference Result 2629 states and 3349 transitions. [2022-02-20 20:01:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3349 transitions. [2022-02-20 20:01:52,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:52,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:52,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 2452 states, 1954 states have (on average 1.284544524053224) internal successors, (2510), 1982 states have internal predecessors, (2510), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) Second operand 2629 states. [2022-02-20 20:01:52,996 INFO L87 Difference]: Start difference. First operand has 2452 states, 1954 states have (on average 1.284544524053224) internal successors, (2510), 1982 states have internal predecessors, (2510), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) Second operand 2629 states. [2022-02-20 20:01:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:53,189 INFO L93 Difference]: Finished difference Result 2629 states and 3349 transitions. [2022-02-20 20:01:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3349 transitions. [2022-02-20 20:01:53,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:53,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:53,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:53,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1954 states have (on average 1.284544524053224) internal successors, (2510), 1982 states have internal predecessors, (2510), 266 states have call successors, (266), 168 states have call predecessors, (266), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) [2022-02-20 20:01:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3144 transitions. [2022-02-20 20:01:53,482 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3144 transitions. Word has length 92 [2022-02-20 20:01:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:53,482 INFO L470 AbstractCegarLoop]: Abstraction has 2452 states and 3144 transitions. [2022-02-20 20:01:53,483 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 20:01:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3144 transitions. [2022-02-20 20:01:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-20 20:01:53,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:53,484 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:01:53,485 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2087366859, now seen corresponding path program 1 times [2022-02-20 20:01:53,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:53,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419488926] [2022-02-20 20:01:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {111344#(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); {111246#true} is VALID [2022-02-20 20:01:53,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111246#true} {111248#(= ~q_req_up~0 0)} #1833#return; {111246#true} is VALID [2022-02-20 20:01:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(0 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111246#true} {111246#true} #1835#return; {111246#true} is VALID [2022-02-20 20:01:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(1 == ~p_dw_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume !(2 == ~p_dw_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} ~__retres1~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {111246#true} #res := ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,549 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {111246#true} {111246#true} #1829#return; {111246#true} is VALID [2022-02-20 20:01:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(1 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume !(2 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} ~__retres1~1 := 0; {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {111246#true} #res := ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {111246#true} {111246#true} #1831#return; {111246#true} is VALID [2022-02-20 20:01:53,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {111346#(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; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L272 TraceCheckUtils]: 1: Hoare triple {111246#true} call #t~ret8 := is_do_write_p_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} havoc ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} assume !(1 == ~p_dw_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {111246#true} assume !(2 == ~p_dw_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {111246#true} ~__retres1~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {111246#true} #res := ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {111246#true} {111246#true} #1829#return; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {111246#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111246#true} is VALID [2022-02-20 20:01:53,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {111246#true} assume !(0 != ~tmp~1); {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L272 TraceCheckUtils]: 11: Hoare triple {111246#true} call #t~ret9 := is_do_read_c_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {111246#true} havoc ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {111246#true} assume !(1 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {111246#true} assume !(2 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {111246#true} ~__retres1~1 := 0; {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {111246#true} #res := ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {111246#true} {111246#true} #1831#return; {111246#true} is VALID [2022-02-20 20:01:53,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {111246#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111246#true} is VALID [2022-02-20 20:01:53,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {111246#true} assume !(0 != ~tmp___0~1); {111246#true} is VALID [2022-02-20 20:01:53,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {111246#true} {111246#true} #1837#return; {111246#true} is VALID [2022-02-20 20:01:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(1 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111246#true} {111246#true} #1839#return; {111246#true} is VALID [2022-02-20 20:01:53,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,559 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111246#true} {111246#true} #1841#return; {111246#true} is VALID [2022-02-20 20:01:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(0 == ~p_dw_st~0); {111246#true} is VALID [2022-02-20 20:01:53,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume 0 == ~c_dr_st~0;~__retres1~2 := 1; {111361#(<= 1 exists_runnable_thread1_~__retres1~2)} is VALID [2022-02-20 20:01:53,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {111361#(<= 1 exists_runnable_thread1_~__retres1~2)} #res := ~__retres1~2; {111362#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:53,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {111362#(<= 1 |exists_runnable_thread1_#res|)} assume true; {111362#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:53,577 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111362#(<= 1 |exists_runnable_thread1_#res|)} {111246#true} #1841#return; {111294#(not (= |ULTIMATE.start_eval1_#t~ret10#1| 0))} is VALID [2022-02-20 20:01:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:01:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {111344#(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); {111246#true} is VALID [2022-02-20 20:01:53,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111246#true} {111247#false} #1847#return; {111247#false} is VALID [2022-02-20 20:01:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-02-20 20:01:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(0 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111246#true} {111247#false} #1849#return; {111247#false} is VALID [2022-02-20 20:01:53,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-20 20:01:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume 1 == ~p_dw_pc~0; {111246#true} is VALID [2022-02-20 20:01:53,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {111246#true} is VALID [2022-02-20 20:01:53,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} #res := ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,590 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111246#true} {111246#true} #1829#return; {111246#true} is VALID [2022-02-20 20:01:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(1 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume !(2 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} ~__retres1~1 := 0; {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {111246#true} #res := ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {111246#true} {111246#true} #1831#return; {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {111346#(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; {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L272 TraceCheckUtils]: 1: Hoare triple {111246#true} call #t~ret8 := is_do_write_p_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} havoc ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} assume 1 == ~p_dw_pc~0; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {111246#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {111246#true} #res := ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111246#true} {111246#true} #1829#return; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {111246#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {111246#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L272 TraceCheckUtils]: 10: Hoare triple {111246#true} call #t~ret9 := is_do_read_c_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {111246#true} havoc ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {111246#true} assume !(1 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {111246#true} assume !(2 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {111246#true} ~__retres1~1 := 0; {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {111246#true} #res := ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {111246#true} {111246#true} #1831#return; {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {111246#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {111246#true} assume !(0 != ~tmp___0~1); {111246#true} is VALID [2022-02-20 20:01:53,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,595 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {111246#true} {111247#false} #1851#return; {111247#false} is VALID [2022-02-20 20:01:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-02-20 20:01:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume !(1 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111246#true} {111247#false} #1853#return; {111247#false} is VALID [2022-02-20 20:01:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-02-20 20:01:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,600 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111246#true} {111247#false} #1855#return; {111247#false} is VALID [2022-02-20 20:01:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-02-20 20:01:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,603 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111246#true} {111247#false} #1859#return; {111247#false} is VALID [2022-02-20 20:01:53,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-02-20 20:01:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,606 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111246#true} {111247#false} #1841#return; {111247#false} is VALID [2022-02-20 20:01:53,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111248#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:53,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {111248#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {111248#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:53,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {111248#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {111248#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:53,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {111248#(= ~q_req_up~0 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; {111248#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:53,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {111248#(= ~q_req_up~0 0)} call update_channels1(); {111344#(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,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {111344#(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); {111246#true} is VALID [2022-02-20 20:01:53,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,608 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111246#true} {111248#(= ~q_req_up~0 0)} #1833#return; {111246#true} is VALID [2022-02-20 20:01:53,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {111246#true} assume { :begin_inline_init_threads1 } true; {111246#true} is VALID [2022-02-20 20:01:53,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {111246#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {111246#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {111246#true} assume { :end_inline_init_threads1 } true; {111246#true} is VALID [2022-02-20 20:01:53,609 INFO L272 TraceCheckUtils]: 12: Hoare triple {111246#true} call fire_delta_events1(); {111345#(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,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {111246#true} assume !(0 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,609 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111246#true} {111246#true} #1835#return; {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L272 TraceCheckUtils]: 17: Hoare triple {111246#true} call activate_threads1(); {111346#(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,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {111346#(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; {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L272 TraceCheckUtils]: 19: Hoare triple {111246#true} call #t~ret8 := is_do_write_p_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {111246#true} havoc ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {111246#true} assume !(1 == ~p_dw_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {111246#true} assume !(2 == ~p_dw_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {111246#true} ~__retres1~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {111246#true} #res := ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,610 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {111246#true} {111246#true} #1829#return; {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {111246#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {111246#true} assume !(0 != ~tmp~1); {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L272 TraceCheckUtils]: 29: Hoare triple {111246#true} call #t~ret9 := is_do_read_c_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {111246#true} havoc ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {111246#true} assume !(1 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {111246#true} assume !(2 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {111246#true} ~__retres1~1 := 0; {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {111246#true} #res := ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,611 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {111246#true} {111246#true} #1831#return; {111246#true} is VALID [2022-02-20 20:01:53,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {111246#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111246#true} is VALID [2022-02-20 20:01:53,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {111246#true} assume !(0 != ~tmp___0~1); {111246#true} is VALID [2022-02-20 20:01:53,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,612 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {111246#true} {111246#true} #1837#return; {111246#true} is VALID [2022-02-20 20:01:53,612 INFO L272 TraceCheckUtils]: 41: Hoare triple {111246#true} call reset_delta_events1(); {111345#(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,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {111246#true} assume !(1 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {111246#true} {111246#true} #1839#return; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {111246#true} assume !false; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {111246#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; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {111246#true} assume !false; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L272 TraceCheckUtils]: 49: Hoare triple {111246#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {111246#true} {111246#true} #1841#return; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {111246#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; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {111246#true} assume 0 != eval1_~tmp___1~0#1; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {111246#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; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {111246#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; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 59: Hoare triple {111246#true} assume 0 == ~p_dw_pc~0; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {111246#true} assume !false; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {111246#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {111246#true} assume { :end_inline_do_write_p } true; {111246#true} is VALID [2022-02-20 20:01:53,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {111246#true} 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; {111246#true} is VALID [2022-02-20 20:01:53,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {111246#true} assume !(0 != eval1_~tmp___0~2#1); {111246#true} is VALID [2022-02-20 20:01:53,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {111246#true} assume !false; {111246#true} is VALID [2022-02-20 20:01:53,615 INFO L272 TraceCheckUtils]: 66: Hoare triple {111246#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111246#true} is VALID [2022-02-20 20:01:53,615 INFO L290 TraceCheckUtils]: 67: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {111246#true} assume !(0 == ~p_dw_st~0); {111246#true} is VALID [2022-02-20 20:01:53,615 INFO L290 TraceCheckUtils]: 69: Hoare triple {111246#true} assume 0 == ~c_dr_st~0;~__retres1~2 := 1; {111361#(<= 1 exists_runnable_thread1_~__retres1~2)} is VALID [2022-02-20 20:01:53,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {111361#(<= 1 exists_runnable_thread1_~__retres1~2)} #res := ~__retres1~2; {111362#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:53,616 INFO L290 TraceCheckUtils]: 71: Hoare triple {111362#(<= 1 |exists_runnable_thread1_#res|)} assume true; {111362#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:53,616 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {111362#(<= 1 |exists_runnable_thread1_#res|)} {111246#true} #1841#return; {111294#(not (= |ULTIMATE.start_eval1_#t~ret10#1| 0))} is VALID [2022-02-20 20:01:53,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {111294#(not (= |ULTIMATE.start_eval1_#t~ret10#1| 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; {111295#(not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))} is VALID [2022-02-20 20:01:53,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {111295#(not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))} assume !(0 != eval1_~tmp___1~0#1); {111247#false} is VALID [2022-02-20 20:01:53,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {111247#false} assume { :end_inline_eval1 } true;start_simulation1_~kernel_st~0#1 := 2; {111247#false} is VALID [2022-02-20 20:01:53,617 INFO L272 TraceCheckUtils]: 76: Hoare triple {111247#false} call update_channels1(); {111344#(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,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {111344#(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); {111246#true} is VALID [2022-02-20 20:01:53,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,618 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111246#true} {111247#false} #1847#return; {111247#false} is VALID [2022-02-20 20:01:53,618 INFO L290 TraceCheckUtils]: 80: Hoare triple {111247#false} start_simulation1_~kernel_st~0#1 := 3; {111247#false} is VALID [2022-02-20 20:01:53,618 INFO L272 TraceCheckUtils]: 81: Hoare triple {111247#false} call fire_delta_events1(); {111345#(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,618 INFO L290 TraceCheckUtils]: 82: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {111246#true} assume !(0 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,618 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {111246#true} {111247#false} #1849#return; {111247#false} is VALID [2022-02-20 20:01:53,618 INFO L272 TraceCheckUtils]: 86: Hoare triple {111247#false} call activate_threads1(); {111346#(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,618 INFO L290 TraceCheckUtils]: 87: Hoare triple {111346#(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; {111246#true} is VALID [2022-02-20 20:01:53,618 INFO L272 TraceCheckUtils]: 88: Hoare triple {111246#true} call #t~ret8 := is_do_write_p_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 89: Hoare triple {111246#true} havoc ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 90: Hoare triple {111246#true} assume 1 == ~p_dw_pc~0; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 91: Hoare triple {111246#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 92: Hoare triple {111246#true} #res := ~__retres1~0; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 93: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {111246#true} {111246#true} #1829#return; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 95: Hoare triple {111246#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L290 TraceCheckUtils]: 96: Hoare triple {111246#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {111246#true} is VALID [2022-02-20 20:01:53,619 INFO L272 TraceCheckUtils]: 97: Hoare triple {111246#true} call #t~ret9 := is_do_read_c_triggered(); {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 98: Hoare triple {111246#true} havoc ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 99: Hoare triple {111246#true} assume !(1 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 100: Hoare triple {111246#true} assume !(2 == ~c_dr_pc~0); {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 101: Hoare triple {111246#true} ~__retres1~1 := 0; {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 102: Hoare triple {111246#true} #res := ~__retres1~1; {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 103: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {111246#true} {111246#true} #1831#return; {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 105: Hoare triple {111246#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 106: Hoare triple {111246#true} assume !(0 != ~tmp___0~1); {111246#true} is VALID [2022-02-20 20:01:53,620 INFO L290 TraceCheckUtils]: 107: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,621 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {111246#true} {111247#false} #1851#return; {111247#false} is VALID [2022-02-20 20:01:53,621 INFO L272 TraceCheckUtils]: 109: Hoare triple {111247#false} call reset_delta_events1(); {111345#(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,621 INFO L290 TraceCheckUtils]: 110: Hoare triple {111345#(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); {111246#true} is VALID [2022-02-20 20:01:53,621 INFO L290 TraceCheckUtils]: 111: Hoare triple {111246#true} assume !(1 == ~q_write_ev~0); {111246#true} is VALID [2022-02-20 20:01:53,621 INFO L290 TraceCheckUtils]: 112: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,621 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {111246#true} {111247#false} #1853#return; {111247#false} is VALID [2022-02-20 20:01:53,621 INFO L272 TraceCheckUtils]: 114: Hoare triple {111247#false} call start_simulation1_#t~ret14#1 := exists_runnable_thread1(); {111246#true} is VALID [2022-02-20 20:01:53,621 INFO L290 TraceCheckUtils]: 115: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,621 INFO L290 TraceCheckUtils]: 116: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 117: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 118: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,622 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111246#true} {111247#false} #1855#return; {111247#false} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 120: Hoare triple {111247#false} assume -2147483648 <= start_simulation1_#t~ret14#1 && start_simulation1_#t~ret14#1 <= 2147483647;start_simulation1_~tmp~4#1 := start_simulation1_#t~ret14#1;havoc start_simulation1_#t~ret14#1; {111247#false} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 121: Hoare triple {111247#false} assume !(0 == start_simulation1_~tmp~4#1); {111247#false} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 122: Hoare triple {111247#false} assume { :begin_inline_stop_simulation1 } true;havoc stop_simulation1_#res#1;havoc stop_simulation1_#t~ret13#1, stop_simulation1_~tmp~3#1, stop_simulation1_~__retres2~0#1;havoc stop_simulation1_~tmp~3#1;havoc stop_simulation1_~__retres2~0#1; {111247#false} is VALID [2022-02-20 20:01:53,622 INFO L272 TraceCheckUtils]: 123: Hoare triple {111247#false} call stop_simulation1_#t~ret13#1 := exists_runnable_thread1(); {111246#true} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 124: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 125: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,622 INFO L290 TraceCheckUtils]: 126: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 127: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,623 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {111246#true} {111247#false} #1859#return; {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 129: Hoare triple {111247#false} assume -2147483648 <= stop_simulation1_#t~ret13#1 && stop_simulation1_#t~ret13#1 <= 2147483647;stop_simulation1_~tmp~3#1 := stop_simulation1_#t~ret13#1;havoc stop_simulation1_#t~ret13#1; {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 130: Hoare triple {111247#false} assume 0 != stop_simulation1_~tmp~3#1;stop_simulation1_~__retres2~0#1 := 0; {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 131: Hoare triple {111247#false} stop_simulation1_#res#1 := stop_simulation1_~__retres2~0#1; {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 132: Hoare triple {111247#false} start_simulation1_#t~ret15#1 := stop_simulation1_#res#1;assume { :end_inline_stop_simulation1 } true;assume -2147483648 <= start_simulation1_#t~ret15#1 && start_simulation1_#t~ret15#1 <= 2147483647;start_simulation1_~tmp___0~3#1 := start_simulation1_#t~ret15#1;havoc start_simulation1_#t~ret15#1; {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 133: Hoare triple {111247#false} assume !(0 != start_simulation1_~tmp___0~3#1); {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 134: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:53,623 INFO L290 TraceCheckUtils]: 135: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 136: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:53,624 INFO L272 TraceCheckUtils]: 137: Hoare triple {111247#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111246#true} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 138: Hoare triple {111246#true} havoc ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 139: Hoare triple {111246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111246#true} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 140: Hoare triple {111246#true} #res := ~__retres1~2; {111246#true} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 141: Hoare triple {111246#true} assume true; {111246#true} is VALID [2022-02-20 20:01:53,624 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {111246#true} {111247#false} #1841#return; {111247#false} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 143: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 144: Hoare triple {111247#false} assume 0 != eval1_~tmp___1~0#1; {111247#false} is VALID [2022-02-20 20:01:53,624 INFO L290 TraceCheckUtils]: 145: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 146: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 147: Hoare triple {111247#false} assume !(0 == ~p_dw_pc~0); {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 148: Hoare triple {111247#false} assume 1 == ~p_dw_pc~0; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 149: Hoare triple {111247#false} assume !(0 == ~q_free~0); {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 150: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 151: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 152: Hoare triple {111247#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 153: Hoare triple {111247#false} assume { :end_inline_do_write_p } true; {111247#false} is VALID [2022-02-20 20:01:53,625 INFO L290 TraceCheckUtils]: 154: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 155: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 156: Hoare triple {111247#false} assume !(0 == ~c_dr_pc~0); {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 157: Hoare triple {111247#false} assume 2 == ~c_dr_pc~0; {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 158: Hoare triple {111247#false} do_read_c_~a~0#1 := ~a_t~0; {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 159: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 160: Hoare triple {111247#false} assume !(~p_last_write~0 == ~c_last_read~0); {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L272 TraceCheckUtils]: 161: Hoare triple {111247#false} call error1(); {111247#false} is VALID [2022-02-20 20:01:53,626 INFO L290 TraceCheckUtils]: 162: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-02-20 20:01:53,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:53,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419488926] [2022-02-20 20:01:53,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419488926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 20:01:53,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046596183] [2022-02-20 20:01:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 20:01:53,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:01:53,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 20:01:53,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 20:01:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 20:01:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:53,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:01:54,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {111246#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {111246#true} is VALID [2022-02-20 20:01:54,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {111246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {111246#true} is VALID [2022-02-20 20:01:54,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {111246#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call update_channels1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_req_up~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,302 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1833#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume { :begin_inline_init_threads1 } true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_init_threads1 } true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call fire_delta_events1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_read_ev~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_write_ev~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1835#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,304 INFO L272 TraceCheckUtils]: 17: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call activate_threads1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~tmp~1;havoc ~tmp___0~1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call #t~ret8 := is_do_write_p_triggered(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~p_dw_pc~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(2 == ~p_dw_pc~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} ~__retres1~0 := 0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,307 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1829#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 != ~tmp~1); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,308 INFO L272 TraceCheckUtils]: 29: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call #t~ret9 := is_do_read_c_triggered(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~c_dr_pc~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(2 == ~c_dr_pc~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} ~__retres1~1 := 0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,310 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1831#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 != ~tmp___0~1); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,311 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1837#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,311 INFO L272 TraceCheckUtils]: 41: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call reset_delta_events1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_read_ev~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_write_ev~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,312 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1839#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !false; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !false; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,314 INFO L272 TraceCheckUtils]: 49: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~2; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~2; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,315 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1841#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 0 != eval1_~tmp___1~0#1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 0 == ~p_dw_pc~0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !false; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_do_write_p } true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 != eval1_~tmp___0~2#1); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !false; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,319 INFO L272 TraceCheckUtils]: 66: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~2; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~p_dw_st~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 0 == ~c_dr_st~0;~__retres1~2 := 1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~2; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,321 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1841#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {111385#(<= 2 ~fast_clk_edge~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; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 != eval1_~tmp___1~0#1); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,322 INFO L290 TraceCheckUtils]: 75: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_eval1 } true;start_simulation1_~kernel_st~0#1 := 2; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,322 INFO L272 TraceCheckUtils]: 76: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call update_channels1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,322 INFO L290 TraceCheckUtils]: 77: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_req_up~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,322 INFO L290 TraceCheckUtils]: 78: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,323 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1847#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,323 INFO L290 TraceCheckUtils]: 80: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} start_simulation1_~kernel_st~0#1 := 3; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,323 INFO L272 TraceCheckUtils]: 81: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call fire_delta_events1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_read_ev~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,324 INFO L290 TraceCheckUtils]: 83: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_write_ev~0); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume true; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,325 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {111385#(<= 2 ~fast_clk_edge~0)} {111385#(<= 2 ~fast_clk_edge~0)} #1849#return; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,325 INFO L272 TraceCheckUtils]: 86: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call activate_threads1(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~tmp~1;havoc ~tmp___0~1; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,325 INFO L272 TraceCheckUtils]: 88: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} call #t~ret8 := is_do_write_p_triggered(); {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,326 INFO L290 TraceCheckUtils]: 89: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,326 INFO L290 TraceCheckUtils]: 90: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 1 == ~p_dw_pc~0; {111385#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:54,326 INFO L290 TraceCheckUtils]: 91: Hoare triple {111385#(<= 2 ~fast_clk_edge~0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {111247#false} is VALID [2022-02-20 20:01:54,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {111247#false} #res := ~__retres1~0; {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L290 TraceCheckUtils]: 93: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {111247#false} {111385#(<= 2 ~fast_clk_edge~0)} #1829#return; {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L290 TraceCheckUtils]: 95: Hoare triple {111247#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L290 TraceCheckUtils]: 96: Hoare triple {111247#false} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L272 TraceCheckUtils]: 97: Hoare triple {111247#false} call #t~ret9 := is_do_read_c_triggered(); {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {111247#false} havoc ~__retres1~1; {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L290 TraceCheckUtils]: 99: Hoare triple {111247#false} assume !(1 == ~c_dr_pc~0); {111247#false} is VALID [2022-02-20 20:01:54,327 INFO L290 TraceCheckUtils]: 100: Hoare triple {111247#false} assume !(2 == ~c_dr_pc~0); {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L290 TraceCheckUtils]: 101: Hoare triple {111247#false} ~__retres1~1 := 0; {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L290 TraceCheckUtils]: 102: Hoare triple {111247#false} #res := ~__retres1~1; {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L290 TraceCheckUtils]: 103: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {111247#false} {111247#false} #1831#return; {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L290 TraceCheckUtils]: 105: Hoare triple {111247#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L290 TraceCheckUtils]: 106: Hoare triple {111247#false} assume !(0 != ~tmp___0~1); {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L290 TraceCheckUtils]: 107: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,328 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {111247#false} {111385#(<= 2 ~fast_clk_edge~0)} #1851#return; {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L272 TraceCheckUtils]: 109: Hoare triple {111247#false} call reset_delta_events1(); {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L290 TraceCheckUtils]: 110: Hoare triple {111247#false} assume !(1 == ~q_read_ev~0); {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L290 TraceCheckUtils]: 111: Hoare triple {111247#false} assume !(1 == ~q_write_ev~0); {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L290 TraceCheckUtils]: 112: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {111247#false} {111247#false} #1853#return; {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L272 TraceCheckUtils]: 114: Hoare triple {111247#false} call start_simulation1_#t~ret14#1 := exists_runnable_thread1(); {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L290 TraceCheckUtils]: 115: Hoare triple {111247#false} havoc ~__retres1~2; {111247#false} is VALID [2022-02-20 20:01:54,329 INFO L290 TraceCheckUtils]: 116: Hoare triple {111247#false} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L290 TraceCheckUtils]: 117: Hoare triple {111247#false} #res := ~__retres1~2; {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L290 TraceCheckUtils]: 118: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111247#false} {111247#false} #1855#return; {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L290 TraceCheckUtils]: 120: Hoare triple {111247#false} assume -2147483648 <= start_simulation1_#t~ret14#1 && start_simulation1_#t~ret14#1 <= 2147483647;start_simulation1_~tmp~4#1 := start_simulation1_#t~ret14#1;havoc start_simulation1_#t~ret14#1; {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L290 TraceCheckUtils]: 121: Hoare triple {111247#false} assume !(0 == start_simulation1_~tmp~4#1); {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L290 TraceCheckUtils]: 122: Hoare triple {111247#false} assume { :begin_inline_stop_simulation1 } true;havoc stop_simulation1_#res#1;havoc stop_simulation1_#t~ret13#1, stop_simulation1_~tmp~3#1, stop_simulation1_~__retres2~0#1;havoc stop_simulation1_~tmp~3#1;havoc stop_simulation1_~__retres2~0#1; {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L272 TraceCheckUtils]: 123: Hoare triple {111247#false} call stop_simulation1_#t~ret13#1 := exists_runnable_thread1(); {111247#false} is VALID [2022-02-20 20:01:54,330 INFO L290 TraceCheckUtils]: 124: Hoare triple {111247#false} havoc ~__retres1~2; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 125: Hoare triple {111247#false} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 126: Hoare triple {111247#false} #res := ~__retres1~2; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 127: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {111247#false} {111247#false} #1859#return; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 129: Hoare triple {111247#false} assume -2147483648 <= stop_simulation1_#t~ret13#1 && stop_simulation1_#t~ret13#1 <= 2147483647;stop_simulation1_~tmp~3#1 := stop_simulation1_#t~ret13#1;havoc stop_simulation1_#t~ret13#1; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 130: Hoare triple {111247#false} assume 0 != stop_simulation1_~tmp~3#1;stop_simulation1_~__retres2~0#1 := 0; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 131: Hoare triple {111247#false} stop_simulation1_#res#1 := stop_simulation1_~__retres2~0#1; {111247#false} is VALID [2022-02-20 20:01:54,331 INFO L290 TraceCheckUtils]: 132: Hoare triple {111247#false} start_simulation1_#t~ret15#1 := stop_simulation1_#res#1;assume { :end_inline_stop_simulation1 } true;assume -2147483648 <= start_simulation1_#t~ret15#1 && start_simulation1_#t~ret15#1 <= 2147483647;start_simulation1_~tmp___0~3#1 := start_simulation1_#t~ret15#1;havoc start_simulation1_#t~ret15#1; {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 133: Hoare triple {111247#false} assume !(0 != start_simulation1_~tmp___0~3#1); {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 134: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 135: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 136: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L272 TraceCheckUtils]: 137: Hoare triple {111247#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 138: Hoare triple {111247#false} havoc ~__retres1~2; {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 139: Hoare triple {111247#false} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111247#false} is VALID [2022-02-20 20:01:54,332 INFO L290 TraceCheckUtils]: 140: Hoare triple {111247#false} #res := ~__retres1~2; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 141: Hoare triple {111247#false} assume true; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {111247#false} {111247#false} #1841#return; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 143: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 144: Hoare triple {111247#false} assume 0 != eval1_~tmp___1~0#1; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 145: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 146: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 147: Hoare triple {111247#false} assume !(0 == ~p_dw_pc~0); {111247#false} is VALID [2022-02-20 20:01:54,333 INFO L290 TraceCheckUtils]: 148: Hoare triple {111247#false} assume 1 == ~p_dw_pc~0; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 149: Hoare triple {111247#false} assume !(0 == ~q_free~0); {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 150: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 151: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 152: Hoare triple {111247#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 153: Hoare triple {111247#false} assume { :end_inline_do_write_p } true; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 154: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 155: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,334 INFO L290 TraceCheckUtils]: 156: Hoare triple {111247#false} assume !(0 == ~c_dr_pc~0); {111247#false} is VALID [2022-02-20 20:01:54,335 INFO L290 TraceCheckUtils]: 157: Hoare triple {111247#false} assume 2 == ~c_dr_pc~0; {111247#false} is VALID [2022-02-20 20:01:54,335 INFO L290 TraceCheckUtils]: 158: Hoare triple {111247#false} do_read_c_~a~0#1 := ~a_t~0; {111247#false} is VALID [2022-02-20 20:01:54,335 INFO L290 TraceCheckUtils]: 159: Hoare triple {111247#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; {111247#false} is VALID [2022-02-20 20:01:54,335 INFO L290 TraceCheckUtils]: 160: Hoare triple {111247#false} assume !(~p_last_write~0 == ~c_last_read~0); {111247#false} is VALID [2022-02-20 20:01:54,335 INFO L272 TraceCheckUtils]: 161: Hoare triple {111247#false} call error1(); {111247#false} is VALID [2022-02-20 20:01:54,335 INFO L290 TraceCheckUtils]: 162: Hoare triple {111247#false} assume !false; {111247#false} is VALID [2022-02-20 20:01:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-20 20:01:54,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:01:54,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046596183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:54,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 20:01:54,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-02-20 20:01:54,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988947226] [2022-02-20 20:01:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-02-20 20:01:54,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:54,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 20:01:54,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:54,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:01:54,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:01:54,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:54,424 INFO L87 Difference]: Start difference. First operand 2452 states and 3144 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)