./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93c2f95927688290d9634a76e5cb5c078ca9f28d9ebb5a85520405b4d17220b1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:23,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:23,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:23,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:23,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:23,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:23,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:23,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:23,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:23,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:23,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:23,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:23,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:23,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:23,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:23,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:23,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:23,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:23,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:23,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:23,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:23,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:23,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:23,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:23,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:23,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:23,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:23,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:23,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:23,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:23,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:23,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:23,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:23,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:23,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:23,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:23,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:23,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:23,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:23,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:23,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:23,159 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:23,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:23,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:23,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:23,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:23,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:23,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:23,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:23,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:23,196 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:23,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:23,197 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:23,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:23,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:23,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:23,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:23,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:23,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:23,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:23,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:23,199 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:23,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:23,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:23,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:23,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:23,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:23,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:23,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:23,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:23,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:23,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:23,203 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:23,203 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:23,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:23,204 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 -> 93c2f95927688290d9634a76e5cb5c078ca9f28d9ebb5a85520405b4d17220b1 [2022-02-20 20:00:23,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:23,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:23,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:23,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:23,472 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:23,473 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.09.cil-1.c [2022-02-20 20:00:23,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93ea7e1e2/0e77fc85220b43c78a0ede4620d9a171/FLAGf5221e8d4 [2022-02-20 20:00:23,937 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:23,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-02-20 20:00:23,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93ea7e1e2/0e77fc85220b43c78a0ede4620d9a171/FLAGf5221e8d4 [2022-02-20 20:00:23,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93ea7e1e2/0e77fc85220b43c78a0ede4620d9a171 [2022-02-20 20:00:23,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:23,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:23,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:23,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:23,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:23,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:23" (1/1) ... [2022-02-20 20:00:23,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b132dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:23, skipping insertion in model container [2022-02-20 20:00:23,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:23" (1/1) ... [2022-02-20 20:00:23,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:24,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:24,164 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.09.cil-1.c[911,924] [2022-02-20 20:00:24,212 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.09.cil-1.c[8416,8429] [2022-02-20 20:00:24,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:24,334 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:24,352 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.09.cil-1.c[911,924] [2022-02-20 20:00:24,374 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.09.cil-1.c[8416,8429] [2022-02-20 20:00:24,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:24,469 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:24,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:24 WrapperNode [2022-02-20 20:00:24,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:24,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:24,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:24,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:24,477 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:24" (1/1) ... [2022-02-20 20:00:24,490 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:24" (1/1) ... [2022-02-20 20:00:24,573 INFO L137 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 904 [2022-02-20 20:00:24,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:24,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:24,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:24,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:24,583 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:24" (1/1) ... [2022-02-20 20:00:24,584 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:24" (1/1) ... [2022-02-20 20:00:24,597 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:24" (1/1) ... [2022-02-20 20:00:24,603 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:24" (1/1) ... [2022-02-20 20:00:24,617 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:24" (1/1) ... [2022-02-20 20:00:24,648 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:24" (1/1) ... [2022-02-20 20:00:24,651 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:24" (1/1) ... [2022-02-20 20:00:24,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:24,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:24,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:24,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:24,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:24" (1/1) ... [2022-02-20 20:00:24,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:24,705 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:24,726 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:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:24,756 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:24,921 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:24,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:25,616 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:25,616 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:25,688 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:25,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:25,706 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 20:00:25,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:25 BoogieIcfgContainer [2022-02-20 20:00:25,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:25,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:25,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:25,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:25,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:23" (1/3) ... [2022-02-20 20:00:25,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b04c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:25, skipping insertion in model container [2022-02-20 20:00:25,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:24" (2/3) ... [2022-02-20 20:00:25,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b04c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:25, skipping insertion in model container [2022-02-20 20:00:25,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:25" (3/3) ... [2022-02-20 20:00:25,717 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-02-20 20:00:25,721 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:25,722 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:25,765 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:25,770 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:25,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 368 states have (on average 1.625) internal successors, (598), 374 states have internal predecessors, (598), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 20:00:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:25,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:25,820 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:25,820 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1177923463, now seen corresponding path program 1 times [2022-02-20 20:00:25,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:25,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470309439] [2022-02-20 20:00:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {467#(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); {427#true} is VALID [2022-02-20 20:00:26,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {427#true} {429#(= ~p_dw_i~0 1)} #1609#return; {429#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(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; {427#true} is VALID [2022-02-20 20:00:26,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {427#true} is VALID [2022-02-20 20:00:26,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {428#false} #1611#return; {428#false} is VALID [2022-02-20 20:00:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#true} havoc ~__retres1~0; {427#true} is VALID [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume 1 == ~p_dw_pc~0; {427#true} is VALID [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {427#true} is VALID [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {427#true} #res := ~__retres1~0; {427#true} is VALID [2022-02-20 20:00:26,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,129 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {427#true} {427#true} #1605#return; {427#true} is VALID [2022-02-20 20:00:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#true} havoc ~__retres1~1; {427#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume 1 == ~c_dr_pc~0; {427#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {427#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {427#true} #res := ~__retres1~1; {427#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,135 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {427#true} {427#true} #1607#return; {427#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#(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; {427#true} is VALID [2022-02-20 20:00:26,136 INFO L272 TraceCheckUtils]: 1: Hoare triple {427#true} call #t~ret8 := is_do_write_p_triggered(); {427#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} havoc ~__retres1~0; {427#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {427#true} assume 1 == ~p_dw_pc~0; {427#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {427#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {427#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} #res := ~__retres1~0; {427#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,137 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {427#true} {427#true} #1605#return; {427#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {427#true} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {427#true} is VALID [2022-02-20 20:00:26,138 INFO L272 TraceCheckUtils]: 10: Hoare triple {427#true} call #t~ret9 := is_do_read_c_triggered(); {427#true} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {427#true} havoc ~__retres1~1; {427#true} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {427#true} assume 1 == ~c_dr_pc~0; {427#true} is VALID [2022-02-20 20:00:26,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {427#true} is VALID [2022-02-20 20:00:26,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {427#true} #res := ~__retres1~1; {427#true} is VALID [2022-02-20 20:00:26,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,139 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {427#true} {427#true} #1607#return; {427#true} is VALID [2022-02-20 20:00:26,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {427#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {427#true} is VALID [2022-02-20 20:00:26,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {427#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {427#true} is VALID [2022-02-20 20:00:26,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,140 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {427#true} {428#false} #1613#return; {428#false} is VALID [2022-02-20 20:00:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(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); {427#true} is VALID [2022-02-20 20:00:26,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {427#true} is VALID [2022-02-20 20:00:26,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {428#false} #1615#return; {428#false} is VALID [2022-02-20 20:00:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#true} havoc ~__retres1~2; {427#true} is VALID [2022-02-20 20:00:26,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {427#true} is VALID [2022-02-20 20:00:26,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} #res := ~__retres1~2; {427#true} is VALID [2022-02-20 20:00:26,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,154 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {427#true} {428#false} #1617#return; {428#false} is VALID [2022-02-20 20:00:26,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {427#true} is VALID [2022-02-20 20:00:26,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {427#true} is VALID [2022-02-20 20:00:26,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {429#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:26,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#(= ~p_dw_i~0 1)} 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; {429#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:26,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {429#(= ~p_dw_i~0 1)} call update_channels1(); {467#(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:26,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#(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); {427#true} is VALID [2022-02-20 20:00:26,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,172 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {427#true} {429#(= ~p_dw_i~0 1)} #1609#return; {429#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:26,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {429#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:26,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {428#false} is VALID [2022-02-20 20:00:26,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {428#false} is VALID [2022-02-20 20:00:26,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#false} assume { :end_inline_init_threads1 } true; {428#false} is VALID [2022-02-20 20:00:26,175 INFO L272 TraceCheckUtils]: 12: Hoare triple {428#false} call fire_delta_events1(); {468#(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:26,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(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; {427#true} is VALID [2022-02-20 20:00:26,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {427#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {427#true} is VALID [2022-02-20 20:00:26,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,176 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {427#true} {428#false} #1611#return; {428#false} is VALID [2022-02-20 20:00:26,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {428#false} call activate_threads1(); {469#(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:26,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {469#(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; {427#true} is VALID [2022-02-20 20:00:26,177 INFO L272 TraceCheckUtils]: 19: Hoare triple {427#true} call #t~ret8 := is_do_write_p_triggered(); {427#true} is VALID [2022-02-20 20:00:26,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {427#true} havoc ~__retres1~0; {427#true} is VALID [2022-02-20 20:00:26,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {427#true} assume 1 == ~p_dw_pc~0; {427#true} is VALID [2022-02-20 20:00:26,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {427#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {427#true} is VALID [2022-02-20 20:00:26,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {427#true} #res := ~__retres1~0; {427#true} is VALID [2022-02-20 20:00:26,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,179 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {427#true} {427#true} #1605#return; {427#true} is VALID [2022-02-20 20:00:26,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {427#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {427#true} is VALID [2022-02-20 20:00:26,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {427#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {427#true} is VALID [2022-02-20 20:00:26,180 INFO L272 TraceCheckUtils]: 28: Hoare triple {427#true} call #t~ret9 := is_do_read_c_triggered(); {427#true} is VALID [2022-02-20 20:00:26,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {427#true} havoc ~__retres1~1; {427#true} is VALID [2022-02-20 20:00:26,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {427#true} assume 1 == ~c_dr_pc~0; {427#true} is VALID [2022-02-20 20:00:26,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {427#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {427#true} is VALID [2022-02-20 20:00:26,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {427#true} #res := ~__retres1~1; {427#true} is VALID [2022-02-20 20:00:26,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,182 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {427#true} {427#true} #1607#return; {427#true} is VALID [2022-02-20 20:00:26,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {427#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {427#true} is VALID [2022-02-20 20:00:26,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {427#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {427#true} is VALID [2022-02-20 20:00:26,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,184 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {427#true} {428#false} #1613#return; {428#false} is VALID [2022-02-20 20:00:26,184 INFO L272 TraceCheckUtils]: 39: Hoare triple {428#false} call reset_delta_events1(); {468#(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:26,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {468#(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); {427#true} is VALID [2022-02-20 20:00:26,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {427#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {427#true} is VALID [2022-02-20 20:00:26,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,185 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {427#true} {428#false} #1615#return; {428#false} is VALID [2022-02-20 20:00:26,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 20:00:26,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {428#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; {428#false} is VALID [2022-02-20 20:00:26,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 20:00:26,186 INFO L272 TraceCheckUtils]: 47: Hoare triple {428#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {427#true} is VALID [2022-02-20 20:00:26,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {427#true} havoc ~__retres1~2; {427#true} is VALID [2022-02-20 20:00:26,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {427#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {427#true} is VALID [2022-02-20 20:00:26,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {427#true} #res := ~__retres1~2; {427#true} is VALID [2022-02-20 20:00:26,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {427#true} assume true; {427#true} is VALID [2022-02-20 20:00:26,189 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {427#true} {428#false} #1617#return; {428#false} is VALID [2022-02-20 20:00:26,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {428#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; {428#false} is VALID [2022-02-20 20:00:26,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {428#false} assume 0 != eval1_~tmp___1~0#1; {428#false} is VALID [2022-02-20 20:00:26,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {428#false} assume !(0 == ~p_dw_st~0); {428#false} is VALID [2022-02-20 20:00:26,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {428#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; {428#false} is VALID [2022-02-20 20:00:26,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {428#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; {428#false} is VALID [2022-02-20 20:00:26,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {428#false} assume !(0 == ~c_dr_pc~0); {428#false} is VALID [2022-02-20 20:00:26,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {428#false} assume 2 == ~c_dr_pc~0; {428#false} is VALID [2022-02-20 20:00:26,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {428#false} do_read_c_~a~0#1 := ~a_t~0; {428#false} is VALID [2022-02-20 20:00:26,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {428#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; {428#false} is VALID [2022-02-20 20:00:26,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {428#false} assume !(~p_last_write~0 == ~c_last_read~0); {428#false} is VALID [2022-02-20 20:00:26,198 INFO L272 TraceCheckUtils]: 63: Hoare triple {428#false} call error1(); {428#false} is VALID [2022-02-20 20:00:26,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 20:00:26,199 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:26,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:26,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470309439] [2022-02-20 20:00:26,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470309439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:26,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:26,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:26,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732308917] [2022-02-20 20:00:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:26,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:26,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:26,278 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:26,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:26,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:26,301 INFO L87 Difference]: Start difference. First operand has 424 states, 368 states have (on average 1.625) internal successors, (598), 374 states have internal predecessors, (598), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,636 INFO L93 Difference]: Finished difference Result 842 states and 1340 transitions. [2022-02-20 20:00:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:28,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1340 transitions. [2022-02-20 20:00:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1340 transitions. [2022-02-20 20:00:28,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1340 transitions. [2022-02-20 20:00:29,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1340 edges. 1340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:29,743 INFO L225 Difference]: With dead ends: 842 [2022-02-20 20:00:29,744 INFO L226 Difference]: Without dead ends: 432 [2022-02-20 20:00:29,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:29,757 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 669 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:29,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 1741 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:00:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-02-20 20:00:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2022-02-20 20:00:29,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:29,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:29,822 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:29,825 INFO L87 Difference]: Start difference. First operand 432 states. Second operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:29,866 INFO L93 Difference]: Finished difference Result 432 states and 658 transitions. [2022-02-20 20:00:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 658 transitions. [2022-02-20 20:00:29,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:29,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:29,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 432 states. [2022-02-20 20:00:29,874 INFO L87 Difference]: Start difference. First operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 432 states. [2022-02-20 20:00:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:29,909 INFO L93 Difference]: Finished difference Result 432 states and 658 transitions. [2022-02-20 20:00:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 658 transitions. [2022-02-20 20:00:29,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:29,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:29,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:29,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2022-02-20 20:00:29,936 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 65 [2022-02-20 20:00:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:29,936 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2022-02-20 20:00:29,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2022-02-20 20:00:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:29,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:29,939 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:29,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:29,939 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1137248713, now seen corresponding path program 1 times [2022-02-20 20:00:29,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:29,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939361916] [2022-02-20 20:00:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {3057#(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); {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:30,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:30,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3019#(= ~q_read_ev~0 2)} #1609#return; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {3059#(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; {3060#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:30,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {3060#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3060#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:30,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {3060#(= |old(~q_read_ev~0)| 0)} assume true; {3060#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:30,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3060#(= |old(~q_read_ev~0)| 0)} {3019#(= ~q_read_ev~0 2)} #1611#return; {3018#false} is VALID [2022-02-20 20:00:30,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {3017#true} havoc ~__retres1~0; {3017#true} is VALID [2022-02-20 20:00:30,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {3017#true} assume 1 == ~p_dw_pc~0; {3017#true} is VALID [2022-02-20 20:00:30,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {3017#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3017#true} is VALID [2022-02-20 20:00:30,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {3017#true} #res := ~__retres1~0; {3017#true} is VALID [2022-02-20 20:00:30,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,103 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3017#true} {3017#true} #1605#return; {3017#true} is VALID [2022-02-20 20:00:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {3017#true} havoc ~__retres1~1; {3017#true} is VALID [2022-02-20 20:00:30,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {3017#true} assume 1 == ~c_dr_pc~0; {3017#true} is VALID [2022-02-20 20:00:30,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {3017#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3017#true} is VALID [2022-02-20 20:00:30,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {3017#true} #res := ~__retres1~1; {3017#true} is VALID [2022-02-20 20:00:30,110 INFO L290 TraceCheckUtils]: 4: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,110 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3017#true} {3017#true} #1607#return; {3017#true} is VALID [2022-02-20 20:00:30,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {3061#(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; {3017#true} is VALID [2022-02-20 20:00:30,110 INFO L272 TraceCheckUtils]: 1: Hoare triple {3017#true} call #t~ret8 := is_do_write_p_triggered(); {3017#true} is VALID [2022-02-20 20:00:30,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {3017#true} havoc ~__retres1~0; {3017#true} is VALID [2022-02-20 20:00:30,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {3017#true} assume 1 == ~p_dw_pc~0; {3017#true} is VALID [2022-02-20 20:00:30,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {3017#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3017#true} is VALID [2022-02-20 20:00:30,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {3017#true} #res := ~__retres1~0; {3017#true} is VALID [2022-02-20 20:00:30,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,112 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3017#true} {3017#true} #1605#return; {3017#true} is VALID [2022-02-20 20:00:30,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {3017#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3017#true} is VALID [2022-02-20 20:00:30,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {3017#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3017#true} is VALID [2022-02-20 20:00:30,112 INFO L272 TraceCheckUtils]: 10: Hoare triple {3017#true} call #t~ret9 := is_do_read_c_triggered(); {3017#true} is VALID [2022-02-20 20:00:30,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {3017#true} havoc ~__retres1~1; {3017#true} is VALID [2022-02-20 20:00:30,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {3017#true} assume 1 == ~c_dr_pc~0; {3017#true} is VALID [2022-02-20 20:00:30,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {3017#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3017#true} is VALID [2022-02-20 20:00:30,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {3017#true} #res := ~__retres1~1; {3017#true} is VALID [2022-02-20 20:00:30,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,113 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3017#true} {3017#true} #1607#return; {3017#true} is VALID [2022-02-20 20:00:30,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {3017#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3017#true} is VALID [2022-02-20 20:00:30,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {3017#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3017#true} is VALID [2022-02-20 20:00:30,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,114 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3017#true} {3018#false} #1613#return; {3018#false} is VALID [2022-02-20 20:00:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {3059#(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); {3017#true} is VALID [2022-02-20 20:00:30,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3017#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3017#true} is VALID [2022-02-20 20:00:30,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3017#true} {3018#false} #1615#return; {3018#false} is VALID [2022-02-20 20:00:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:30,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {3017#true} havoc ~__retres1~2; {3017#true} is VALID [2022-02-20 20:00:30,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {3017#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3017#true} is VALID [2022-02-20 20:00:30,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {3017#true} #res := ~__retres1~2; {3017#true} is VALID [2022-02-20 20:00:30,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,135 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3017#true} {3018#false} #1617#return; {3018#false} is VALID [2022-02-20 20:00:30,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {3017#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {3017#true} is VALID [2022-02-20 20:00:30,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {3017#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {3017#true} is VALID [2022-02-20 20:00:30,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {3017#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {3019#(= ~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; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {3019#(= ~q_read_ev~0 2)} call update_channels1(); {3057#(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:30,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {3057#(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); {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:30,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:30,139 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3058#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3019#(= ~q_read_ev~0 2)} #1609#return; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {3019#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {3019#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {3019#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {3019#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:30,141 INFO L272 TraceCheckUtils]: 12: Hoare triple {3019#(= ~q_read_ev~0 2)} call fire_delta_events1(); {3059#(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:30,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {3059#(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; {3060#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:30,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {3060#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3060#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:30,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {3060#(= |old(~q_read_ev~0)| 0)} assume true; {3060#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:30,143 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3060#(= |old(~q_read_ev~0)| 0)} {3019#(= ~q_read_ev~0 2)} #1611#return; {3018#false} is VALID [2022-02-20 20:00:30,143 INFO L272 TraceCheckUtils]: 17: Hoare triple {3018#false} call activate_threads1(); {3061#(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:30,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {3061#(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; {3017#true} is VALID [2022-02-20 20:00:30,144 INFO L272 TraceCheckUtils]: 19: Hoare triple {3017#true} call #t~ret8 := is_do_write_p_triggered(); {3017#true} is VALID [2022-02-20 20:00:30,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {3017#true} havoc ~__retres1~0; {3017#true} is VALID [2022-02-20 20:00:30,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#true} assume 1 == ~p_dw_pc~0; {3017#true} is VALID [2022-02-20 20:00:30,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {3017#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3017#true} is VALID [2022-02-20 20:00:30,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#true} #res := ~__retres1~0; {3017#true} is VALID [2022-02-20 20:00:30,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,145 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3017#true} {3017#true} #1605#return; {3017#true} is VALID [2022-02-20 20:00:30,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {3017#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3017#true} is VALID [2022-02-20 20:00:30,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3017#true} is VALID [2022-02-20 20:00:30,146 INFO L272 TraceCheckUtils]: 28: Hoare triple {3017#true} call #t~ret9 := is_do_read_c_triggered(); {3017#true} is VALID [2022-02-20 20:00:30,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {3017#true} havoc ~__retres1~1; {3017#true} is VALID [2022-02-20 20:00:30,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {3017#true} assume 1 == ~c_dr_pc~0; {3017#true} is VALID [2022-02-20 20:00:30,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {3017#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3017#true} is VALID [2022-02-20 20:00:30,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {3017#true} #res := ~__retres1~1; {3017#true} is VALID [2022-02-20 20:00:30,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,147 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3017#true} {3017#true} #1607#return; {3017#true} is VALID [2022-02-20 20:00:30,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {3017#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3017#true} is VALID [2022-02-20 20:00:30,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {3017#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3017#true} is VALID [2022-02-20 20:00:30,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,148 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3017#true} {3018#false} #1613#return; {3018#false} is VALID [2022-02-20 20:00:30,148 INFO L272 TraceCheckUtils]: 39: Hoare triple {3018#false} call reset_delta_events1(); {3059#(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:30,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {3059#(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); {3017#true} is VALID [2022-02-20 20:00:30,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {3017#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3017#true} is VALID [2022-02-20 20:00:30,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,149 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3017#true} {3018#false} #1615#return; {3018#false} is VALID [2022-02-20 20:00:30,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {3018#false} assume !false; {3018#false} is VALID [2022-02-20 20:00:30,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {3018#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; {3018#false} is VALID [2022-02-20 20:00:30,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {3018#false} assume !false; {3018#false} is VALID [2022-02-20 20:00:30,149 INFO L272 TraceCheckUtils]: 47: Hoare triple {3018#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3017#true} is VALID [2022-02-20 20:00:30,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {3017#true} havoc ~__retres1~2; {3017#true} is VALID [2022-02-20 20:00:30,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {3017#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3017#true} is VALID [2022-02-20 20:00:30,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {3017#true} #res := ~__retres1~2; {3017#true} is VALID [2022-02-20 20:00:30,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {3017#true} assume true; {3017#true} is VALID [2022-02-20 20:00:30,150 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3017#true} {3018#false} #1617#return; {3018#false} is VALID [2022-02-20 20:00:30,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {3018#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; {3018#false} is VALID [2022-02-20 20:00:30,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {3018#false} assume 0 != eval1_~tmp___1~0#1; {3018#false} is VALID [2022-02-20 20:00:30,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {3018#false} assume !(0 == ~p_dw_st~0); {3018#false} is VALID [2022-02-20 20:00:30,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {3018#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; {3018#false} is VALID [2022-02-20 20:00:30,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {3018#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; {3018#false} is VALID [2022-02-20 20:00:30,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {3018#false} assume !(0 == ~c_dr_pc~0); {3018#false} is VALID [2022-02-20 20:00:30,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {3018#false} assume 2 == ~c_dr_pc~0; {3018#false} is VALID [2022-02-20 20:00:30,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {3018#false} do_read_c_~a~0#1 := ~a_t~0; {3018#false} is VALID [2022-02-20 20:00:30,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {3018#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; {3018#false} is VALID [2022-02-20 20:00:30,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {3018#false} assume !(~p_last_write~0 == ~c_last_read~0); {3018#false} is VALID [2022-02-20 20:00:30,153 INFO L272 TraceCheckUtils]: 63: Hoare triple {3018#false} call error1(); {3018#false} is VALID [2022-02-20 20:00:30,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {3018#false} assume !false; {3018#false} is VALID [2022-02-20 20:00:30,153 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:30,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:30,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939361916] [2022-02-20 20:00:30,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939361916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:30,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:30,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:30,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937804256] [2022-02-20 20:00:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:30,156 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:30,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:30,157 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:30,206 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:30,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:30,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:30,208 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,577 INFO L93 Difference]: Finished difference Result 669 states and 998 transitions. [2022-02-20 20:00:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:33,577 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:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:33,578 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:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2022-02-20 20:00:33,592 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:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2022-02-20 20:00:33,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 998 transitions. [2022-02-20 20:00:34,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 998 edges. 998 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:34,349 INFO L225 Difference]: With dead ends: 669 [2022-02-20 20:00:34,349 INFO L226 Difference]: Without dead ends: 565 [2022-02-20 20:00:34,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:34,351 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 1095 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:34,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 2182 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-02-20 20:00:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 526. [2022-02-20 20:00:34,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:34,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:34,381 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:34,382 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:34,406 INFO L93 Difference]: Finished difference Result 565 states and 842 transitions. [2022-02-20 20:00:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 842 transitions. [2022-02-20 20:00:34,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:34,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:34,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 565 states. [2022-02-20 20:00:34,414 INFO L87 Difference]: Start difference. First operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 565 states. [2022-02-20 20:00:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:34,440 INFO L93 Difference]: Finished difference Result 565 states and 842 transitions. [2022-02-20 20:00:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 842 transitions. [2022-02-20 20:00:34,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:34,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:34,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:34,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 786 transitions. [2022-02-20 20:00:34,469 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 786 transitions. Word has length 65 [2022-02-20 20:00:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:34,471 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 786 transitions. [2022-02-20 20:00:34,472 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:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 786 transitions. [2022-02-20 20:00:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:34,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:34,475 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:34,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:34,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1619378553, now seen corresponding path program 1 times [2022-02-20 20:00:34,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:34,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786806864] [2022-02-20 20:00:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {5856#(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); {5857#(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:34,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {5857#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5857#(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:34,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5857#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5818#(= ~q_write_ev~0 ~q_read_ev~0)} #1609#return; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {5857#(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); {5858#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:34,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {5858#(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; {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:34,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:34,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5818#(= ~q_write_ev~0 ~q_read_ev~0)} #1611#return; {5817#false} is VALID [2022-02-20 20:00:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {5816#true} havoc ~__retres1~0; {5816#true} is VALID [2022-02-20 20:00:34,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {5816#true} assume 1 == ~p_dw_pc~0; {5816#true} is VALID [2022-02-20 20:00:34,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {5816#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5816#true} is VALID [2022-02-20 20:00:34,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {5816#true} #res := ~__retres1~0; {5816#true} is VALID [2022-02-20 20:00:34,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,632 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5816#true} {5816#true} #1605#return; {5816#true} is VALID [2022-02-20 20:00:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5816#true} havoc ~__retres1~1; {5816#true} is VALID [2022-02-20 20:00:34,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5816#true} assume 1 == ~c_dr_pc~0; {5816#true} is VALID [2022-02-20 20:00:34,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {5816#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5816#true} is VALID [2022-02-20 20:00:34,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {5816#true} #res := ~__retres1~1; {5816#true} is VALID [2022-02-20 20:00:34,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,637 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5816#true} {5816#true} #1607#return; {5816#true} is VALID [2022-02-20 20:00:34,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {5860#(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; {5816#true} is VALID [2022-02-20 20:00:34,637 INFO L272 TraceCheckUtils]: 1: Hoare triple {5816#true} call #t~ret8 := is_do_write_p_triggered(); {5816#true} is VALID [2022-02-20 20:00:34,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {5816#true} havoc ~__retres1~0; {5816#true} is VALID [2022-02-20 20:00:34,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {5816#true} assume 1 == ~p_dw_pc~0; {5816#true} is VALID [2022-02-20 20:00:34,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {5816#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5816#true} is VALID [2022-02-20 20:00:34,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {5816#true} #res := ~__retres1~0; {5816#true} is VALID [2022-02-20 20:00:34,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,638 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5816#true} {5816#true} #1605#return; {5816#true} is VALID [2022-02-20 20:00:34,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {5816#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5816#true} is VALID [2022-02-20 20:00:34,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {5816#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5816#true} is VALID [2022-02-20 20:00:34,639 INFO L272 TraceCheckUtils]: 10: Hoare triple {5816#true} call #t~ret9 := is_do_read_c_triggered(); {5816#true} is VALID [2022-02-20 20:00:34,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {5816#true} havoc ~__retres1~1; {5816#true} is VALID [2022-02-20 20:00:34,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {5816#true} assume 1 == ~c_dr_pc~0; {5816#true} is VALID [2022-02-20 20:00:34,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {5816#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5816#true} is VALID [2022-02-20 20:00:34,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {5816#true} #res := ~__retres1~1; {5816#true} is VALID [2022-02-20 20:00:34,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,640 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5816#true} {5816#true} #1607#return; {5816#true} is VALID [2022-02-20 20:00:34,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {5816#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5816#true} is VALID [2022-02-20 20:00:34,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {5816#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5816#true} is VALID [2022-02-20 20:00:34,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,641 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5816#true} {5817#false} #1613#return; {5817#false} is VALID [2022-02-20 20:00:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {5857#(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); {5816#true} is VALID [2022-02-20 20:00:34,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {5816#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5816#true} is VALID [2022-02-20 20:00:34,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5816#true} {5817#false} #1615#return; {5817#false} is VALID [2022-02-20 20:00:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:34,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {5816#true} havoc ~__retres1~2; {5816#true} is VALID [2022-02-20 20:00:34,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {5816#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5816#true} is VALID [2022-02-20 20:00:34,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {5816#true} #res := ~__retres1~2; {5816#true} is VALID [2022-02-20 20:00:34,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,649 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5816#true} {5817#false} #1617#return; {5817#false} is VALID [2022-02-20 20:00:34,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {5816#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {5816#true} is VALID [2022-02-20 20:00:34,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {5816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {5816#true} is VALID [2022-02-20 20:00:34,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {5816#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {5818#(= ~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; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5856#(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:34,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {5856#(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); {5857#(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:34,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {5857#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5857#(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:34,653 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5857#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5818#(= ~q_write_ev~0 ~q_read_ev~0)} #1609#return; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {5818#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {5818#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {5818#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {5818#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {5818#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:34,655 INFO L272 TraceCheckUtils]: 12: Hoare triple {5818#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5857#(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:34,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {5857#(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); {5858#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:34,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {5858#(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; {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:34,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:34,657 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5859#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5818#(= ~q_write_ev~0 ~q_read_ev~0)} #1611#return; {5817#false} is VALID [2022-02-20 20:00:34,657 INFO L272 TraceCheckUtils]: 17: Hoare triple {5817#false} call activate_threads1(); {5860#(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:34,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {5860#(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; {5816#true} is VALID [2022-02-20 20:00:34,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {5816#true} call #t~ret8 := is_do_write_p_triggered(); {5816#true} is VALID [2022-02-20 20:00:34,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {5816#true} havoc ~__retres1~0; {5816#true} is VALID [2022-02-20 20:00:34,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {5816#true} assume 1 == ~p_dw_pc~0; {5816#true} is VALID [2022-02-20 20:00:34,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {5816#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5816#true} is VALID [2022-02-20 20:00:34,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {5816#true} #res := ~__retres1~0; {5816#true} is VALID [2022-02-20 20:00:34,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,659 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5816#true} {5816#true} #1605#return; {5816#true} is VALID [2022-02-20 20:00:34,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {5816#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5816#true} is VALID [2022-02-20 20:00:34,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {5816#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5816#true} is VALID [2022-02-20 20:00:34,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {5816#true} call #t~ret9 := is_do_read_c_triggered(); {5816#true} is VALID [2022-02-20 20:00:34,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {5816#true} havoc ~__retres1~1; {5816#true} is VALID [2022-02-20 20:00:34,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {5816#true} assume 1 == ~c_dr_pc~0; {5816#true} is VALID [2022-02-20 20:00:34,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {5816#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5816#true} is VALID [2022-02-20 20:00:34,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {5816#true} #res := ~__retres1~1; {5816#true} is VALID [2022-02-20 20:00:34,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,661 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5816#true} {5816#true} #1607#return; {5816#true} is VALID [2022-02-20 20:00:34,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {5816#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5816#true} is VALID [2022-02-20 20:00:34,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {5816#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5816#true} is VALID [2022-02-20 20:00:34,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,661 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5816#true} {5817#false} #1613#return; {5817#false} is VALID [2022-02-20 20:00:34,662 INFO L272 TraceCheckUtils]: 39: Hoare triple {5817#false} call reset_delta_events1(); {5857#(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:34,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {5857#(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); {5816#true} is VALID [2022-02-20 20:00:34,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {5816#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5816#true} is VALID [2022-02-20 20:00:34,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,662 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5816#true} {5817#false} #1615#return; {5817#false} is VALID [2022-02-20 20:00:34,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {5817#false} assume !false; {5817#false} is VALID [2022-02-20 20:00:34,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {5817#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; {5817#false} is VALID [2022-02-20 20:00:34,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {5817#false} assume !false; {5817#false} is VALID [2022-02-20 20:00:34,663 INFO L272 TraceCheckUtils]: 47: Hoare triple {5817#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5816#true} is VALID [2022-02-20 20:00:34,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {5816#true} havoc ~__retres1~2; {5816#true} is VALID [2022-02-20 20:00:34,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {5816#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5816#true} is VALID [2022-02-20 20:00:34,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {5816#true} #res := ~__retres1~2; {5816#true} is VALID [2022-02-20 20:00:34,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {5816#true} assume true; {5816#true} is VALID [2022-02-20 20:00:34,664 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5816#true} {5817#false} #1617#return; {5817#false} is VALID [2022-02-20 20:00:34,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {5817#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; {5817#false} is VALID [2022-02-20 20:00:34,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {5817#false} assume 0 != eval1_~tmp___1~0#1; {5817#false} is VALID [2022-02-20 20:00:34,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {5817#false} assume !(0 == ~p_dw_st~0); {5817#false} is VALID [2022-02-20 20:00:34,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {5817#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; {5817#false} is VALID [2022-02-20 20:00:34,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {5817#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; {5817#false} is VALID [2022-02-20 20:00:34,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {5817#false} assume !(0 == ~c_dr_pc~0); {5817#false} is VALID [2022-02-20 20:00:34,665 INFO L290 TraceCheckUtils]: 59: Hoare triple {5817#false} assume 2 == ~c_dr_pc~0; {5817#false} is VALID [2022-02-20 20:00:34,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {5817#false} do_read_c_~a~0#1 := ~a_t~0; {5817#false} is VALID [2022-02-20 20:00:34,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {5817#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; {5817#false} is VALID [2022-02-20 20:00:34,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {5817#false} assume !(~p_last_write~0 == ~c_last_read~0); {5817#false} is VALID [2022-02-20 20:00:34,666 INFO L272 TraceCheckUtils]: 63: Hoare triple {5817#false} call error1(); {5817#false} is VALID [2022-02-20 20:00:34,666 INFO L290 TraceCheckUtils]: 64: Hoare triple {5817#false} assume !false; {5817#false} is VALID [2022-02-20 20:00:34,667 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:34,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:34,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786806864] [2022-02-20 20:00:34,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786806864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:34,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:34,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:34,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956911918] [2022-02-20 20:00:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:34,669 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:34,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:34,669 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:34,711 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:34,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:34,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:34,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:34,713 INFO L87 Difference]: Start difference. First operand 526 states and 786 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:38,403 INFO L93 Difference]: Finished difference Result 923 states and 1351 transitions. [2022-02-20 20:00:38,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:38,403 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:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1028 transitions. [2022-02-20 20:00:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1028 transitions. [2022-02-20 20:00:38,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1028 transitions. [2022-02-20 20:00:39,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1028 edges. 1028 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:39,202 INFO L225 Difference]: With dead ends: 923 [2022-02-20 20:00:39,203 INFO L226 Difference]: Without dead ends: 714 [2022-02-20 20:00:39,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:39,204 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 1522 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:39,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1552 Valid, 2151 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:00:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-02-20 20:00:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 638. [2022-02-20 20:00:39,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:39,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,239 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,241 INFO L87 Difference]: Start difference. First operand 714 states. Second operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,273 INFO L93 Difference]: Finished difference Result 714 states and 1059 transitions. [2022-02-20 20:00:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1059 transitions. [2022-02-20 20:00:39,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:39,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:39,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) Second operand 714 states. [2022-02-20 20:00:39,280 INFO L87 Difference]: Start difference. First operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) Second operand 714 states. [2022-02-20 20:00:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,310 INFO L93 Difference]: Finished difference Result 714 states and 1059 transitions. [2022-02-20 20:00:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1059 transitions. [2022-02-20 20:00:39,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:39,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:39,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:39,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 945 transitions. [2022-02-20 20:00:39,344 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 945 transitions. Word has length 65 [2022-02-20 20:00:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:39,344 INFO L470 AbstractCegarLoop]: Abstraction has 638 states and 945 transitions. [2022-02-20 20:00:39,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 945 transitions. [2022-02-20 20:00:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:39,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:39,347 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:39,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:39,348 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash 647002633, now seen corresponding path program 1 times [2022-02-20 20:00:39,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:39,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505494242] [2022-02-20 20:00:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {9449#(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); {9450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:39,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {9450#(not (= |old(~q_req_up~0)| 1))} assume true; {9450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:39,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9450#(not (= |old(~q_req_up~0)| 1))} {9410#(= ~q_req_up~0 ~p_dw_pc~0)} #1609#return; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {9451#(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); {9407#true} is VALID [2022-02-20 20:00:39,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {9407#true} assume !(0 == ~q_write_ev~0); {9407#true} is VALID [2022-02-20 20:00:39,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9407#true} {9414#(not (= ~p_dw_pc~0 1))} #1611#return; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {9407#true} havoc ~__retres1~0; {9407#true} is VALID [2022-02-20 20:00:39,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {9407#true} assume 1 == ~p_dw_pc~0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,469 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} {9407#true} #1605#return; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {9407#true} havoc ~__retres1~1; {9407#true} is VALID [2022-02-20 20:00:39,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {9407#true} assume 1 == ~c_dr_pc~0; {9407#true} is VALID [2022-02-20 20:00:39,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {9407#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9407#true} is VALID [2022-02-20 20:00:39,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {9407#true} #res := ~__retres1~1; {9407#true} is VALID [2022-02-20 20:00:39,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,474 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9407#true} {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} #1607#return; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#(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; {9407#true} is VALID [2022-02-20 20:00:39,475 INFO L272 TraceCheckUtils]: 1: Hoare triple {9407#true} call #t~ret8 := is_do_write_p_triggered(); {9407#true} is VALID [2022-02-20 20:00:39,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {9407#true} havoc ~__retres1~0; {9407#true} is VALID [2022-02-20 20:00:39,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {9407#true} assume 1 == ~p_dw_pc~0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,477 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} {9407#true} #1605#return; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,478 INFO L272 TraceCheckUtils]: 10: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {9407#true} is VALID [2022-02-20 20:00:39,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {9407#true} havoc ~__retres1~1; {9407#true} is VALID [2022-02-20 20:00:39,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {9407#true} assume 1 == ~c_dr_pc~0; {9407#true} is VALID [2022-02-20 20:00:39,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {9407#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9407#true} is VALID [2022-02-20 20:00:39,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {9407#true} #res := ~__retres1~1; {9407#true} is VALID [2022-02-20 20:00:39,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,480 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9407#true} {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} #1607#return; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,481 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} {9414#(not (= ~p_dw_pc~0 1))} #1613#return; {9408#false} is VALID [2022-02-20 20:00:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {9451#(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); {9407#true} is VALID [2022-02-20 20:00:39,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {9407#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9407#true} is VALID [2022-02-20 20:00:39,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9407#true} {9408#false} #1615#return; {9408#false} is VALID [2022-02-20 20:00:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {9407#true} havoc ~__retres1~2; {9407#true} is VALID [2022-02-20 20:00:39,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {9407#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9407#true} is VALID [2022-02-20 20:00:39,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {9407#true} #res := ~__retres1~2; {9407#true} is VALID [2022-02-20 20:00:39,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,490 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9407#true} {9408#false} #1617#return; {9408#false} is VALID [2022-02-20 20:00:39,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {9407#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {9409#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:39,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {9409#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {9409#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:39,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {9410#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:39,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {9410#(= ~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; {9410#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:39,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {9410#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {9449#(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:39,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {9449#(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); {9450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:39,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {9450#(not (= |old(~q_req_up~0)| 1))} assume true; {9450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:39,494 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9450#(not (= |old(~q_req_up~0)| 1))} {9410#(= ~q_req_up~0 ~p_dw_pc~0)} #1609#return; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {9414#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {9414#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {9414#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {9414#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,496 INFO L272 TraceCheckUtils]: 12: Hoare triple {9414#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {9451#(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:39,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {9451#(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); {9407#true} is VALID [2022-02-20 20:00:39,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {9407#true} assume !(0 == ~q_write_ev~0); {9407#true} is VALID [2022-02-20 20:00:39,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,497 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9407#true} {9414#(not (= ~p_dw_pc~0 1))} #1611#return; {9414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:39,497 INFO L272 TraceCheckUtils]: 17: Hoare triple {9414#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {9452#(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:39,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {9452#(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; {9407#true} is VALID [2022-02-20 20:00:39,498 INFO L272 TraceCheckUtils]: 19: Hoare triple {9407#true} call #t~ret8 := is_do_write_p_triggered(); {9407#true} is VALID [2022-02-20 20:00:39,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {9407#true} havoc ~__retres1~0; {9407#true} is VALID [2022-02-20 20:00:39,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {9407#true} assume 1 == ~p_dw_pc~0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,500 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} {9407#true} #1605#return; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,501 INFO L272 TraceCheckUtils]: 28: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {9407#true} is VALID [2022-02-20 20:00:39,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {9407#true} havoc ~__retres1~1; {9407#true} is VALID [2022-02-20 20:00:39,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {9407#true} assume 1 == ~c_dr_pc~0; {9407#true} is VALID [2022-02-20 20:00:39,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {9407#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9407#true} is VALID [2022-02-20 20:00:39,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {9407#true} #res := ~__retres1~1; {9407#true} is VALID [2022-02-20 20:00:39,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,502 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9407#true} {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} #1607#return; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:39,504 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9459#(= (+ (- 1) ~p_dw_pc~0) 0)} {9414#(not (= ~p_dw_pc~0 1))} #1613#return; {9408#false} is VALID [2022-02-20 20:00:39,504 INFO L272 TraceCheckUtils]: 39: Hoare triple {9408#false} call reset_delta_events1(); {9451#(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:39,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {9451#(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); {9407#true} is VALID [2022-02-20 20:00:39,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {9407#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9407#true} is VALID [2022-02-20 20:00:39,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,506 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9407#true} {9408#false} #1615#return; {9408#false} is VALID [2022-02-20 20:00:39,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {9408#false} assume !false; {9408#false} is VALID [2022-02-20 20:00:39,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {9408#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; {9408#false} is VALID [2022-02-20 20:00:39,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {9408#false} assume !false; {9408#false} is VALID [2022-02-20 20:00:39,506 INFO L272 TraceCheckUtils]: 47: Hoare triple {9408#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {9407#true} is VALID [2022-02-20 20:00:39,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {9407#true} havoc ~__retres1~2; {9407#true} is VALID [2022-02-20 20:00:39,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {9407#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9407#true} is VALID [2022-02-20 20:00:39,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {9407#true} #res := ~__retres1~2; {9407#true} is VALID [2022-02-20 20:00:39,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {9407#true} assume true; {9407#true} is VALID [2022-02-20 20:00:39,507 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9407#true} {9408#false} #1617#return; {9408#false} is VALID [2022-02-20 20:00:39,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {9408#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; {9408#false} is VALID [2022-02-20 20:00:39,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {9408#false} assume 0 != eval1_~tmp___1~0#1; {9408#false} is VALID [2022-02-20 20:00:39,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {9408#false} assume !(0 == ~p_dw_st~0); {9408#false} is VALID [2022-02-20 20:00:39,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {9408#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; {9408#false} is VALID [2022-02-20 20:00:39,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {9408#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; {9408#false} is VALID [2022-02-20 20:00:39,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {9408#false} assume !(0 == ~c_dr_pc~0); {9408#false} is VALID [2022-02-20 20:00:39,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {9408#false} assume 2 == ~c_dr_pc~0; {9408#false} is VALID [2022-02-20 20:00:39,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {9408#false} do_read_c_~a~0#1 := ~a_t~0; {9408#false} is VALID [2022-02-20 20:00:39,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {9408#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; {9408#false} is VALID [2022-02-20 20:00:39,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {9408#false} assume !(~p_last_write~0 == ~c_last_read~0); {9408#false} is VALID [2022-02-20 20:00:39,509 INFO L272 TraceCheckUtils]: 63: Hoare triple {9408#false} call error1(); {9408#false} is VALID [2022-02-20 20:00:39,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {9408#false} assume !false; {9408#false} is VALID [2022-02-20 20:00:39,512 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:39,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:39,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505494242] [2022-02-20 20:00:39,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505494242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:39,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:39,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:39,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127611500] [2022-02-20 20:00:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:39,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:39,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:39,556 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:39,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:39,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:39,558 INFO L87 Difference]: Start difference. First operand 638 states and 945 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,178 INFO L93 Difference]: Finished difference Result 2184 states and 3142 transitions. [2022-02-20 20:00:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1433 transitions. [2022-02-20 20:00:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1433 transitions. [2022-02-20 20:00:46,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1433 transitions. [2022-02-20 20:00:47,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1433 edges. 1433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:47,609 INFO L225 Difference]: With dead ends: 2184 [2022-02-20 20:00:47,609 INFO L226 Difference]: Without dead ends: 1851 [2022-02-20 20:00:47,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:47,612 INFO L933 BasicCegarLoop]: 759 mSDtfsCounter, 3332 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:47,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3350 Valid, 2829 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 20:00:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2022-02-20 20:00:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1691. [2022-02-20 20:00:47,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:47,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1851 states. Second operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,684 INFO L74 IsIncluded]: Start isIncluded. First operand 1851 states. Second operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,688 INFO L87 Difference]: Start difference. First operand 1851 states. Second operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,859 INFO L93 Difference]: Finished difference Result 1851 states and 2546 transitions. [2022-02-20 20:00:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2546 transitions. [2022-02-20 20:00:47,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) Second operand 1851 states. [2022-02-20 20:00:47,872 INFO L87 Difference]: Start difference. First operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) Second operand 1851 states. [2022-02-20 20:00:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:48,038 INFO L93 Difference]: Finished difference Result 1851 states and 2546 transitions. [2022-02-20 20:00:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2546 transitions. [2022-02-20 20:00:48,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:48,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:48,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:48,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2334 transitions. [2022-02-20 20:00:48,254 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2334 transitions. Word has length 65 [2022-02-20 20:00:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:48,254 INFO L470 AbstractCegarLoop]: Abstraction has 1691 states and 2334 transitions. [2022-02-20 20:00:48,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2334 transitions. [2022-02-20 20:00:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:48,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:48,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:48,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:48,257 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1861088182, now seen corresponding path program 1 times [2022-02-20 20:00:48,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:48,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130045345] [2022-02-20 20:00:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {18481#(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); {18441#true} is VALID [2022-02-20 20:00:48,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18441#true} {18441#true} #1609#return; {18441#true} is VALID [2022-02-20 20:00:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {18482#(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); {18441#true} is VALID [2022-02-20 20:00:48,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume !(0 == ~q_write_ev~0); {18441#true} is VALID [2022-02-20 20:00:48,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #1611#return; {18441#true} is VALID [2022-02-20 20:00:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {18441#true} havoc ~__retres1~0; {18441#true} is VALID [2022-02-20 20:00:48,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume !(1 == ~p_dw_pc~0); {18441#true} is VALID [2022-02-20 20:00:48,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume !(2 == ~p_dw_pc~0); {18441#true} is VALID [2022-02-20 20:00:48,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {18441#true} ~__retres1~0 := 0; {18499#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:48,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {18499#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:48,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:48,405 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {18441#true} #1605#return; {18491#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {18441#true} havoc ~__retres1~1; {18441#true} is VALID [2022-02-20 20:00:48,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume 1 == ~c_dr_pc~0; {18441#true} is VALID [2022-02-20 20:00:48,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {18441#true} is VALID [2022-02-20 20:00:48,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {18441#true} #res := ~__retres1~1; {18441#true} is VALID [2022-02-20 20:00:48,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,416 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18441#true} {18442#false} #1607#return; {18442#false} is VALID [2022-02-20 20:00:48,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {18483#(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; {18441#true} is VALID [2022-02-20 20:00:48,416 INFO L272 TraceCheckUtils]: 1: Hoare triple {18441#true} call #t~ret8 := is_do_write_p_triggered(); {18441#true} is VALID [2022-02-20 20:00:48,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} havoc ~__retres1~0; {18441#true} is VALID [2022-02-20 20:00:48,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {18441#true} assume !(1 == ~p_dw_pc~0); {18441#true} is VALID [2022-02-20 20:00:48,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {18441#true} assume !(2 == ~p_dw_pc~0); {18441#true} is VALID [2022-02-20 20:00:48,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~__retres1~0 := 0; {18499#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:48,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {18499#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:48,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:48,419 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {18441#true} #1605#return; {18491#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:48,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {18491#(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; {18492#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:48,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {18492#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {18442#false} is VALID [2022-02-20 20:00:48,420 INFO L272 TraceCheckUtils]: 11: Hoare triple {18442#false} call #t~ret9 := is_do_read_c_triggered(); {18441#true} is VALID [2022-02-20 20:00:48,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {18441#true} havoc ~__retres1~1; {18441#true} is VALID [2022-02-20 20:00:48,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {18441#true} assume 1 == ~c_dr_pc~0; {18441#true} is VALID [2022-02-20 20:00:48,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {18441#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {18441#true} is VALID [2022-02-20 20:00:48,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {18441#true} #res := ~__retres1~1; {18441#true} is VALID [2022-02-20 20:00:48,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,424 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18441#true} {18442#false} #1607#return; {18442#false} is VALID [2022-02-20 20:00:48,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {18442#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {18442#false} is VALID [2022-02-20 20:00:48,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {18442#false} is VALID [2022-02-20 20:00:48,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#false} assume true; {18442#false} is VALID [2022-02-20 20:00:48,425 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18442#false} {18441#true} #1613#return; {18442#false} is VALID [2022-02-20 20:00:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {18482#(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); {18441#true} is VALID [2022-02-20 20:00:48,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {18441#true} is VALID [2022-02-20 20:00:48,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18442#false} #1615#return; {18442#false} is VALID [2022-02-20 20:00:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:48,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {18441#true} havoc ~__retres1~2; {18441#true} is VALID [2022-02-20 20:00:48,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {18441#true} is VALID [2022-02-20 20:00:48,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} #res := ~__retres1~2; {18441#true} is VALID [2022-02-20 20:00:48,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,449 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18441#true} {18442#false} #1617#return; {18442#false} is VALID [2022-02-20 20:00:48,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {18441#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {18441#true} is VALID [2022-02-20 20:00:48,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {18441#true} is VALID [2022-02-20 20:00:48,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {18441#true} is VALID [2022-02-20 20:00:48,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {18441#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; {18441#true} is VALID [2022-02-20 20:00:48,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call update_channels1(); {18481#(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:48,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {18481#(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); {18441#true} is VALID [2022-02-20 20:00:48,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,455 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18441#true} {18441#true} #1609#return; {18441#true} is VALID [2022-02-20 20:00:48,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {18441#true} assume { :begin_inline_init_threads1 } true; {18441#true} is VALID [2022-02-20 20:00:48,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {18441#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {18441#true} is VALID [2022-02-20 20:00:48,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {18441#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {18441#true} is VALID [2022-02-20 20:00:48,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {18441#true} assume { :end_inline_init_threads1 } true; {18441#true} is VALID [2022-02-20 20:00:48,456 INFO L272 TraceCheckUtils]: 12: Hoare triple {18441#true} call fire_delta_events1(); {18482#(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:48,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {18482#(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); {18441#true} is VALID [2022-02-20 20:00:48,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {18441#true} assume !(0 == ~q_write_ev~0); {18441#true} is VALID [2022-02-20 20:00:48,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,457 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18441#true} {18441#true} #1611#return; {18441#true} is VALID [2022-02-20 20:00:48,458 INFO L272 TraceCheckUtils]: 17: Hoare triple {18441#true} call activate_threads1(); {18483#(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:48,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {18483#(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; {18441#true} is VALID [2022-02-20 20:00:48,458 INFO L272 TraceCheckUtils]: 19: Hoare triple {18441#true} call #t~ret8 := is_do_write_p_triggered(); {18441#true} is VALID [2022-02-20 20:00:48,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {18441#true} havoc ~__retres1~0; {18441#true} is VALID [2022-02-20 20:00:48,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {18441#true} assume !(1 == ~p_dw_pc~0); {18441#true} is VALID [2022-02-20 20:00:48,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {18441#true} assume !(2 == ~p_dw_pc~0); {18441#true} is VALID [2022-02-20 20:00:48,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {18441#true} ~__retres1~0 := 0; {18499#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:48,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {18499#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:48,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:48,460 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18500#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {18441#true} #1605#return; {18491#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:48,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {18491#(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; {18492#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:48,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {18492#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {18442#false} is VALID [2022-02-20 20:00:48,461 INFO L272 TraceCheckUtils]: 29: Hoare triple {18442#false} call #t~ret9 := is_do_read_c_triggered(); {18441#true} is VALID [2022-02-20 20:00:48,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {18441#true} havoc ~__retres1~1; {18441#true} is VALID [2022-02-20 20:00:48,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {18441#true} assume 1 == ~c_dr_pc~0; {18441#true} is VALID [2022-02-20 20:00:48,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {18441#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {18441#true} is VALID [2022-02-20 20:00:48,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {18441#true} #res := ~__retres1~1; {18441#true} is VALID [2022-02-20 20:00:48,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,462 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18441#true} {18442#false} #1607#return; {18442#false} is VALID [2022-02-20 20:00:48,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {18442#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {18442#false} is VALID [2022-02-20 20:00:48,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {18442#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {18442#false} is VALID [2022-02-20 20:00:48,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {18442#false} assume true; {18442#false} is VALID [2022-02-20 20:00:48,463 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18442#false} {18441#true} #1613#return; {18442#false} is VALID [2022-02-20 20:00:48,463 INFO L272 TraceCheckUtils]: 40: Hoare triple {18442#false} call reset_delta_events1(); {18482#(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:48,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {18482#(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); {18441#true} is VALID [2022-02-20 20:00:48,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {18441#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {18441#true} is VALID [2022-02-20 20:00:48,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,464 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18441#true} {18442#false} #1615#return; {18442#false} is VALID [2022-02-20 20:00:48,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-02-20 20:00:48,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {18442#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; {18442#false} is VALID [2022-02-20 20:00:48,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-02-20 20:00:48,465 INFO L272 TraceCheckUtils]: 48: Hoare triple {18442#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {18441#true} is VALID [2022-02-20 20:00:48,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {18441#true} havoc ~__retres1~2; {18441#true} is VALID [2022-02-20 20:00:48,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {18441#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {18441#true} is VALID [2022-02-20 20:00:48,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {18441#true} #res := ~__retres1~2; {18441#true} is VALID [2022-02-20 20:00:48,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-02-20 20:00:48,466 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18441#true} {18442#false} #1617#return; {18442#false} is VALID [2022-02-20 20:00:48,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {18442#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; {18442#false} is VALID [2022-02-20 20:00:48,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {18442#false} assume 0 != eval1_~tmp___1~0#1; {18442#false} is VALID [2022-02-20 20:00:48,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {18442#false} assume !(0 == ~p_dw_st~0); {18442#false} is VALID [2022-02-20 20:00:48,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {18442#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; {18442#false} is VALID [2022-02-20 20:00:48,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {18442#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; {18442#false} is VALID [2022-02-20 20:00:48,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {18442#false} assume !(0 == ~c_dr_pc~0); {18442#false} is VALID [2022-02-20 20:00:48,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {18442#false} assume 2 == ~c_dr_pc~0; {18442#false} is VALID [2022-02-20 20:00:48,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {18442#false} do_read_c_~a~0#1 := ~a_t~0; {18442#false} is VALID [2022-02-20 20:00:48,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {18442#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; {18442#false} is VALID [2022-02-20 20:00:48,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {18442#false} assume !(~p_last_write~0 == ~c_last_read~0); {18442#false} is VALID [2022-02-20 20:00:48,468 INFO L272 TraceCheckUtils]: 64: Hoare triple {18442#false} call error1(); {18442#false} is VALID [2022-02-20 20:00:48,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-02-20 20:00:48,468 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:48,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:48,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130045345] [2022-02-20 20:00:48,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130045345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:48,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:48,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:48,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828097969] [2022-02-20 20:00:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:48,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:48,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:48,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:48,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:48,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:48,513 INFO L87 Difference]: Start difference. First operand 1691 states and 2334 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,883 INFO L93 Difference]: Finished difference Result 3219 states and 4413 transitions. [2022-02-20 20:00:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:52,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 810 transitions. [2022-02-20 20:00:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 810 transitions. [2022-02-20 20:00:52,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 810 transitions. [2022-02-20 20:00:53,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 810 edges. 810 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:53,696 INFO L225 Difference]: With dead ends: 3219 [2022-02-20 20:00:53,696 INFO L226 Difference]: Without dead ends: 1839 [2022-02-20 20:00:53,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:00:53,701 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 546 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:53,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 2744 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:00:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2022-02-20 20:00:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1731. [2022-02-20 20:00:53,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:53,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1839 states. Second operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:53,795 INFO L74 IsIncluded]: Start isIncluded. First operand 1839 states. Second operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:53,798 INFO L87 Difference]: Start difference. First operand 1839 states. Second operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:53,956 INFO L93 Difference]: Finished difference Result 1839 states and 2522 transitions. [2022-02-20 20:00:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2522 transitions. [2022-02-20 20:00:53,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:53,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:53,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) Second operand 1839 states. [2022-02-20 20:00:53,969 INFO L87 Difference]: Start difference. First operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) Second operand 1839 states. [2022-02-20 20:00:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:54,135 INFO L93 Difference]: Finished difference Result 1839 states and 2522 transitions. [2022-02-20 20:00:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2522 transitions. [2022-02-20 20:00:54,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:54,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:54,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:54,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2368 transitions. [2022-02-20 20:00:54,310 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2368 transitions. Word has length 66 [2022-02-20 20:00:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:54,311 INFO L470 AbstractCegarLoop]: Abstraction has 1731 states and 2368 transitions. [2022-02-20 20:00:54,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2368 transitions. [2022-02-20 20:00:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:54,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:54,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:54,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:54,313 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:54,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1404519816, now seen corresponding path program 1 times [2022-02-20 20:00:54,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:54,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595806955] [2022-02-20 20:00:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {28869#(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); {28870#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:54,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {28870#(not (= |old(~q_req_up~0)| 1))} assume true; {28870#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:54,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28870#(not (= |old(~q_req_up~0)| 1))} {28829#(= ~c_dr_pc~0 ~q_req_up~0)} #1609#return; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {28871#(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); {28826#true} is VALID [2022-02-20 20:00:54,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {28826#true} assume !(0 == ~q_write_ev~0); {28826#true} is VALID [2022-02-20 20:00:54,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28826#true} {28833#(not (= ~c_dr_pc~0 1))} #1611#return; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {28826#true} havoc ~__retres1~0; {28826#true} is VALID [2022-02-20 20:00:54,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {28826#true} assume !(1 == ~p_dw_pc~0); {28826#true} is VALID [2022-02-20 20:00:54,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {28826#true} assume !(2 == ~p_dw_pc~0); {28826#true} is VALID [2022-02-20 20:00:54,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {28826#true} ~__retres1~0 := 0; {28826#true} is VALID [2022-02-20 20:00:54,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {28826#true} #res := ~__retres1~0; {28826#true} is VALID [2022-02-20 20:00:54,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,425 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28826#true} {28826#true} #1605#return; {28826#true} is VALID [2022-02-20 20:00:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {28826#true} havoc ~__retres1~1; {28826#true} is VALID [2022-02-20 20:00:54,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {28826#true} assume 1 == ~c_dr_pc~0; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,433 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} {28826#true} #1607#return; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {28872#(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; {28826#true} is VALID [2022-02-20 20:00:54,434 INFO L272 TraceCheckUtils]: 1: Hoare triple {28826#true} call #t~ret8 := is_do_write_p_triggered(); {28826#true} is VALID [2022-02-20 20:00:54,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {28826#true} havoc ~__retres1~0; {28826#true} is VALID [2022-02-20 20:00:54,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {28826#true} assume !(1 == ~p_dw_pc~0); {28826#true} is VALID [2022-02-20 20:00:54,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {28826#true} assume !(2 == ~p_dw_pc~0); {28826#true} is VALID [2022-02-20 20:00:54,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {28826#true} ~__retres1~0 := 0; {28826#true} is VALID [2022-02-20 20:00:54,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {28826#true} #res := ~__retres1~0; {28826#true} is VALID [2022-02-20 20:00:54,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,435 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {28826#true} {28826#true} #1605#return; {28826#true} is VALID [2022-02-20 20:00:54,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {28826#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28826#true} is VALID [2022-02-20 20:00:54,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {28826#true} assume !(0 != ~tmp~1); {28826#true} is VALID [2022-02-20 20:00:54,436 INFO L272 TraceCheckUtils]: 11: Hoare triple {28826#true} call #t~ret9 := is_do_read_c_triggered(); {28826#true} is VALID [2022-02-20 20:00:54,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {28826#true} havoc ~__retres1~1; {28826#true} is VALID [2022-02-20 20:00:54,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {28826#true} assume 1 == ~c_dr_pc~0; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,438 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} {28826#true} #1607#return; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,439 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} {28833#(not (= ~c_dr_pc~0 1))} #1613#return; {28827#false} is VALID [2022-02-20 20:00:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {28871#(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); {28826#true} is VALID [2022-02-20 20:00:54,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {28826#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {28826#true} is VALID [2022-02-20 20:00:54,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28826#true} {28827#false} #1615#return; {28827#false} is VALID [2022-02-20 20:00:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:54,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {28826#true} havoc ~__retres1~2; {28826#true} is VALID [2022-02-20 20:00:54,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {28826#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28826#true} is VALID [2022-02-20 20:00:54,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {28826#true} #res := ~__retres1~2; {28826#true} is VALID [2022-02-20 20:00:54,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,451 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28826#true} {28827#false} #1617#return; {28827#false} is VALID [2022-02-20 20:00:54,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {28826#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {28828#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:54,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {28828#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {28828#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:54,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {28828#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {28829#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:54,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {28829#(= ~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; {28829#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:54,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {28829#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {28869#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:54,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {28869#(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); {28870#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:54,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {28870#(not (= |old(~q_req_up~0)| 1))} assume true; {28870#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:54,456 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28870#(not (= |old(~q_req_up~0)| 1))} {28829#(= ~c_dr_pc~0 ~q_req_up~0)} #1609#return; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {28833#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {28833#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {28833#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {28833#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,458 INFO L272 TraceCheckUtils]: 12: Hoare triple {28833#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {28871#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {28871#(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); {28826#true} is VALID [2022-02-20 20:00:54,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {28826#true} assume !(0 == ~q_write_ev~0); {28826#true} is VALID [2022-02-20 20:00:54,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,459 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28826#true} {28833#(not (= ~c_dr_pc~0 1))} #1611#return; {28833#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:54,459 INFO L272 TraceCheckUtils]: 17: Hoare triple {28833#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {28872#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:54,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {28872#(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; {28826#true} is VALID [2022-02-20 20:00:54,459 INFO L272 TraceCheckUtils]: 19: Hoare triple {28826#true} call #t~ret8 := is_do_write_p_triggered(); {28826#true} is VALID [2022-02-20 20:00:54,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {28826#true} havoc ~__retres1~0; {28826#true} is VALID [2022-02-20 20:00:54,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {28826#true} assume !(1 == ~p_dw_pc~0); {28826#true} is VALID [2022-02-20 20:00:54,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {28826#true} assume !(2 == ~p_dw_pc~0); {28826#true} is VALID [2022-02-20 20:00:54,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {28826#true} ~__retres1~0 := 0; {28826#true} is VALID [2022-02-20 20:00:54,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {28826#true} #res := ~__retres1~0; {28826#true} is VALID [2022-02-20 20:00:54,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,461 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28826#true} {28826#true} #1605#return; {28826#true} is VALID [2022-02-20 20:00:54,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {28826#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28826#true} is VALID [2022-02-20 20:00:54,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {28826#true} assume !(0 != ~tmp~1); {28826#true} is VALID [2022-02-20 20:00:54,461 INFO L272 TraceCheckUtils]: 29: Hoare triple {28826#true} call #t~ret9 := is_do_read_c_triggered(); {28826#true} is VALID [2022-02-20 20:00:54,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {28826#true} havoc ~__retres1~1; {28826#true} is VALID [2022-02-20 20:00:54,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {28826#true} assume 1 == ~c_dr_pc~0; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,466 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} {28826#true} #1607#return; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:54,467 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28886#(= (+ (- 1) ~c_dr_pc~0) 0)} {28833#(not (= ~c_dr_pc~0 1))} #1613#return; {28827#false} is VALID [2022-02-20 20:00:54,468 INFO L272 TraceCheckUtils]: 40: Hoare triple {28827#false} call reset_delta_events1(); {28871#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:54,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {28871#(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); {28826#true} is VALID [2022-02-20 20:00:54,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {28826#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {28826#true} is VALID [2022-02-20 20:00:54,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,468 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {28826#true} {28827#false} #1615#return; {28827#false} is VALID [2022-02-20 20:00:54,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {28827#false} assume !false; {28827#false} is VALID [2022-02-20 20:00:54,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {28827#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; {28827#false} is VALID [2022-02-20 20:00:54,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {28827#false} assume !false; {28827#false} is VALID [2022-02-20 20:00:54,469 INFO L272 TraceCheckUtils]: 48: Hoare triple {28827#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28826#true} is VALID [2022-02-20 20:00:54,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {28826#true} havoc ~__retres1~2; {28826#true} is VALID [2022-02-20 20:00:54,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {28826#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28826#true} is VALID [2022-02-20 20:00:54,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {28826#true} #res := ~__retres1~2; {28826#true} is VALID [2022-02-20 20:00:54,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {28826#true} assume true; {28826#true} is VALID [2022-02-20 20:00:54,470 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {28826#true} {28827#false} #1617#return; {28827#false} is VALID [2022-02-20 20:00:54,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {28827#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; {28827#false} is VALID [2022-02-20 20:00:54,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {28827#false} assume 0 != eval1_~tmp___1~0#1; {28827#false} is VALID [2022-02-20 20:00:54,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {28827#false} assume !(0 == ~p_dw_st~0); {28827#false} is VALID [2022-02-20 20:00:54,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {28827#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; {28827#false} is VALID [2022-02-20 20:00:54,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {28827#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; {28827#false} is VALID [2022-02-20 20:00:54,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {28827#false} assume !(0 == ~c_dr_pc~0); {28827#false} is VALID [2022-02-20 20:00:54,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {28827#false} assume 2 == ~c_dr_pc~0; {28827#false} is VALID [2022-02-20 20:00:54,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {28827#false} do_read_c_~a~0#1 := ~a_t~0; {28827#false} is VALID [2022-02-20 20:00:54,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {28827#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; {28827#false} is VALID [2022-02-20 20:00:54,471 INFO L290 TraceCheckUtils]: 63: Hoare triple {28827#false} assume !(~p_last_write~0 == ~c_last_read~0); {28827#false} is VALID [2022-02-20 20:00:54,471 INFO L272 TraceCheckUtils]: 64: Hoare triple {28827#false} call error1(); {28827#false} is VALID [2022-02-20 20:00:54,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {28827#false} assume !false; {28827#false} is VALID [2022-02-20 20:00:54,472 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:54,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:54,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595806955] [2022-02-20 20:00:54,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595806955] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:54,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:54,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:54,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112359811] [2022-02-20 20:00:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:00:54,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:54,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:54,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:54,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:54,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:54,517 INFO L87 Difference]: Start difference. First operand 1731 states and 2368 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:01,682 INFO L93 Difference]: Finished difference Result 5303 states and 7242 transitions. [2022-02-20 20:01:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:01,683 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:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:01,683 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:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1423 transitions. [2022-02-20 20:01:01,695 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:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1423 transitions. [2022-02-20 20:01:01,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1423 transitions. [2022-02-20 20:01:02,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1423 edges. 1423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:02,999 INFO L225 Difference]: With dead ends: 5303 [2022-02-20 20:01:03,000 INFO L226 Difference]: Without dead ends: 2122 [2022-02-20 20:01:03,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:03,009 INFO L933 BasicCegarLoop]: 756 mSDtfsCounter, 3851 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3869 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:03,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3869 Valid, 2483 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 20:01:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-02-20 20:01:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1942. [2022-02-20 20:01:03,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:03,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:03,128 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:03,130 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:03,265 INFO L93 Difference]: Finished difference Result 2122 states and 2811 transitions. [2022-02-20 20:01:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2811 transitions. [2022-02-20 20:01:03,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:03,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:03,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) Second operand 2122 states. [2022-02-20 20:01:03,277 INFO L87 Difference]: Start difference. First operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) Second operand 2122 states. [2022-02-20 20:01:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:03,451 INFO L93 Difference]: Finished difference Result 2122 states and 2811 transitions. [2022-02-20 20:01:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2811 transitions. [2022-02-20 20:01:03,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:03,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:03,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:03,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2580 transitions. [2022-02-20 20:01:03,693 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2580 transitions. Word has length 66 [2022-02-20 20:01:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:03,693 INFO L470 AbstractCegarLoop]: Abstraction has 1942 states and 2580 transitions. [2022-02-20 20:01:03,694 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:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2580 transitions. [2022-02-20 20:01:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:03,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:03,696 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:03,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:03,696 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:03,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash -934912176, now seen corresponding path program 1 times [2022-02-20 20:01:03,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:03,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249977440] [2022-02-20 20:01:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {42982#(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); {42936#true} is VALID [2022-02-20 20:01:03,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42936#true} {42936#true} #1609#return; {42936#true} is VALID [2022-02-20 20:01:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {42983#(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); {42936#true} is VALID [2022-02-20 20:01:03,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume !(0 == ~q_write_ev~0); {42936#true} is VALID [2022-02-20 20:01:03,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42936#true} {42936#true} #1611#return; {42936#true} is VALID [2022-02-20 20:01:03,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {42936#true} havoc ~__retres1~0; {42936#true} is VALID [2022-02-20 20:01:03,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume !(1 == ~p_dw_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} assume !(2 == ~p_dw_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {42936#true} ~__retres1~0 := 0; {42936#true} is VALID [2022-02-20 20:01:03,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {42936#true} #res := ~__retres1~0; {42936#true} is VALID [2022-02-20 20:01:03,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,803 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42936#true} {42936#true} #1605#return; {42936#true} is VALID [2022-02-20 20:01:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {42936#true} havoc ~__retres1~1; {42936#true} is VALID [2022-02-20 20:01:03,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume !(1 == ~c_dr_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} assume !(2 == ~c_dr_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {42936#true} ~__retres1~1 := 0; {43001#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:03,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {43001#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:03,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:03,836 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {42936#true} #1607#return; {42999#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:03,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {42984#(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; {42936#true} is VALID [2022-02-20 20:01:03,836 INFO L272 TraceCheckUtils]: 1: Hoare triple {42936#true} call #t~ret8 := is_do_write_p_triggered(); {42936#true} is VALID [2022-02-20 20:01:03,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} havoc ~__retres1~0; {42936#true} is VALID [2022-02-20 20:01:03,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {42936#true} assume !(1 == ~p_dw_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {42936#true} assume !(2 == ~p_dw_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {42936#true} ~__retres1~0 := 0; {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {42936#true} #res := ~__retres1~0; {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {42936#true} {42936#true} #1605#return; {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {42936#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {42936#true} assume !(0 != ~tmp~1); {42936#true} is VALID [2022-02-20 20:01:03,837 INFO L272 TraceCheckUtils]: 11: Hoare triple {42936#true} call #t~ret9 := is_do_read_c_triggered(); {42936#true} is VALID [2022-02-20 20:01:03,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {42936#true} havoc ~__retres1~1; {42936#true} is VALID [2022-02-20 20:01:03,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {42936#true} assume !(1 == ~c_dr_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {42936#true} assume !(2 == ~c_dr_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {42936#true} ~__retres1~1 := 0; {43001#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:03,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {43001#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:03,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:03,840 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {42936#true} #1607#return; {42999#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:03,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {42999#(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; {43000#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:03,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {43000#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {42937#false} is VALID [2022-02-20 20:01:03,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {42937#false} assume true; {42937#false} is VALID [2022-02-20 20:01:03,841 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42937#false} {42936#true} #1613#return; {42937#false} is VALID [2022-02-20 20:01:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {42983#(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); {42936#true} is VALID [2022-02-20 20:01:03,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {42936#true} is VALID [2022-02-20 20:01:03,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42936#true} {42937#false} #1615#return; {42937#false} is VALID [2022-02-20 20:01:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {42936#true} havoc ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42936#true} is VALID [2022-02-20 20:01:03,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} #res := ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,851 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42936#true} {42937#false} #1617#return; {42937#false} is VALID [2022-02-20 20:01:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {42936#true} havoc ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42936#true} is VALID [2022-02-20 20:01:03,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} #res := ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,855 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42936#true} {42937#false} #1617#return; {42937#false} is VALID [2022-02-20 20:01:03,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {42936#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {42936#true} is VALID [2022-02-20 20:01:03,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {42936#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {42936#true} is VALID [2022-02-20 20:01:03,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {42936#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {42936#true} is VALID [2022-02-20 20:01:03,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {42936#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; {42936#true} is VALID [2022-02-20 20:01:03,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {42936#true} call update_channels1(); {42982#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:03,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {42982#(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); {42936#true} is VALID [2022-02-20 20:01:03,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,856 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42936#true} {42936#true} #1609#return; {42936#true} is VALID [2022-02-20 20:01:03,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {42936#true} assume { :begin_inline_init_threads1 } true; {42936#true} is VALID [2022-02-20 20:01:03,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {42936#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {42936#true} is VALID [2022-02-20 20:01:03,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {42936#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {42936#true} is VALID [2022-02-20 20:01:03,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {42936#true} assume { :end_inline_init_threads1 } true; {42936#true} is VALID [2022-02-20 20:01:03,858 INFO L272 TraceCheckUtils]: 12: Hoare triple {42936#true} call fire_delta_events1(); {42983#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:03,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {42983#(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); {42936#true} is VALID [2022-02-20 20:01:03,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {42936#true} assume !(0 == ~q_write_ev~0); {42936#true} is VALID [2022-02-20 20:01:03,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,859 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42936#true} {42936#true} #1611#return; {42936#true} is VALID [2022-02-20 20:01:03,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {42936#true} call activate_threads1(); {42984#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:03,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {42984#(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; {42936#true} is VALID [2022-02-20 20:01:03,860 INFO L272 TraceCheckUtils]: 19: Hoare triple {42936#true} call #t~ret8 := is_do_write_p_triggered(); {42936#true} is VALID [2022-02-20 20:01:03,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {42936#true} havoc ~__retres1~0; {42936#true} is VALID [2022-02-20 20:01:03,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {42936#true} assume !(1 == ~p_dw_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {42936#true} assume !(2 == ~p_dw_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {42936#true} ~__retres1~0 := 0; {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {42936#true} #res := ~__retres1~0; {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42936#true} {42936#true} #1605#return; {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {42936#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {42936#true} assume !(0 != ~tmp~1); {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L272 TraceCheckUtils]: 29: Hoare triple {42936#true} call #t~ret9 := is_do_read_c_triggered(); {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {42936#true} havoc ~__retres1~1; {42936#true} is VALID [2022-02-20 20:01:03,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {42936#true} assume !(1 == ~c_dr_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {42936#true} assume !(2 == ~c_dr_pc~0); {42936#true} is VALID [2022-02-20 20:01:03,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {42936#true} ~__retres1~1 := 0; {43001#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:03,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {43001#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:03,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:03,863 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {43002#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {42936#true} #1607#return; {42999#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:03,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {42999#(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; {43000#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:03,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {43000#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {42937#false} is VALID [2022-02-20 20:01:03,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {42937#false} assume true; {42937#false} is VALID [2022-02-20 20:01:03,865 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42937#false} {42936#true} #1613#return; {42937#false} is VALID [2022-02-20 20:01:03,865 INFO L272 TraceCheckUtils]: 41: Hoare triple {42937#false} call reset_delta_events1(); {42983#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:03,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {42983#(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); {42936#true} is VALID [2022-02-20 20:01:03,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {42936#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {42936#true} is VALID [2022-02-20 20:01:03,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,865 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {42936#true} {42937#false} #1615#return; {42937#false} is VALID [2022-02-20 20:01:03,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {42937#false} assume !false; {42937#false} is VALID [2022-02-20 20:01:03,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {42937#false} assume !false; {42937#false} is VALID [2022-02-20 20:01:03,873 INFO L272 TraceCheckUtils]: 49: Hoare triple {42937#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42936#true} is VALID [2022-02-20 20:01:03,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {42936#true} havoc ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {42936#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42936#true} is VALID [2022-02-20 20:01:03,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {42936#true} #res := ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,874 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {42936#true} {42937#false} #1617#return; {42937#false} is VALID [2022-02-20 20:01:03,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {42937#false} assume 0 != eval1_~tmp___1~0#1; {42937#false} is VALID [2022-02-20 20:01:03,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {42937#false} assume 0 == ~p_dw_pc~0; {42937#false} is VALID [2022-02-20 20:01:03,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {42937#false} assume !false; {42937#false} is VALID [2022-02-20 20:01:03,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {42937#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {42937#false} is VALID [2022-02-20 20:01:03,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {42937#false} assume { :end_inline_do_write_p } true; {42937#false} is VALID [2022-02-20 20:01:03,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {42937#false} assume !(0 == ~c_dr_st~0); {42937#false} is VALID [2022-02-20 20:01:03,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {42937#false} assume !false; {42937#false} is VALID [2022-02-20 20:01:03,875 INFO L272 TraceCheckUtils]: 65: Hoare triple {42937#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42936#true} is VALID [2022-02-20 20:01:03,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {42936#true} havoc ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {42936#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42936#true} is VALID [2022-02-20 20:01:03,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {42936#true} #res := ~__retres1~2; {42936#true} is VALID [2022-02-20 20:01:03,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {42936#true} assume true; {42936#true} is VALID [2022-02-20 20:01:03,876 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {42936#true} {42937#false} #1617#return; {42937#false} is VALID [2022-02-20 20:01:03,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {42937#false} assume 0 != eval1_~tmp___1~0#1; {42937#false} is VALID [2022-02-20 20:01:03,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {42937#false} assume !(0 == ~p_dw_pc~0); {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {42937#false} assume 1 == ~p_dw_pc~0; {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {42937#false} assume !(0 == ~q_free~0); {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {42937#false} assume !false; {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {42937#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {42937#false} is VALID [2022-02-20 20:01:03,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {42937#false} assume { :end_inline_do_write_p } true; {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {42937#false} assume !(0 == ~c_dr_pc~0); {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {42937#false} assume 2 == ~c_dr_pc~0; {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 86: Hoare triple {42937#false} do_read_c_~a~0#1 := ~a_t~0; {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {42937#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; {42937#false} is VALID [2022-02-20 20:01:03,878 INFO L290 TraceCheckUtils]: 88: Hoare triple {42937#false} assume !(~p_last_write~0 == ~c_last_read~0); {42937#false} is VALID [2022-02-20 20:01:03,879 INFO L272 TraceCheckUtils]: 89: Hoare triple {42937#false} call error1(); {42937#false} is VALID [2022-02-20 20:01:03,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {42937#false} assume !false; {42937#false} is VALID [2022-02-20 20:01:03,879 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:03,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:03,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249977440] [2022-02-20 20:01:03,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249977440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:03,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:03,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:03,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315215904] [2022-02-20 20:01:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:03,881 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:03,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:03,882 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:03,928 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:03,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:03,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:03,929 INFO L87 Difference]: Start difference. First operand 1942 states and 2580 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:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:07,810 INFO L93 Difference]: Finished difference Result 3767 states and 4982 transitions. [2022-02-20 20:01:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:07,810 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:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:07,810 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:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 795 transitions. [2022-02-20 20:01:07,816 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:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 795 transitions. [2022-02-20 20:01:07,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 795 transitions. [2022-02-20 20:01:08,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:08,562 INFO L225 Difference]: With dead ends: 3767 [2022-02-20 20:01:08,563 INFO L226 Difference]: Without dead ends: 2136 [2022-02-20 20:01:08,566 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:08,567 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 806 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:08,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 2413 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2022-02-20 20:01:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2002. [2022-02-20 20:01:08,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:08,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2136 states. Second operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:08,699 INFO L74 IsIncluded]: Start isIncluded. First operand 2136 states. Second operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:08,702 INFO L87 Difference]: Start difference. First operand 2136 states. Second operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:08,898 INFO L93 Difference]: Finished difference Result 2136 states and 2823 transitions. [2022-02-20 20:01:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2823 transitions. [2022-02-20 20:01:08,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:08,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:08,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) Second operand 2136 states. [2022-02-20 20:01:08,910 INFO L87 Difference]: Start difference. First operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) Second operand 2136 states. [2022-02-20 20:01:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:09,127 INFO L93 Difference]: Finished difference Result 2136 states and 2823 transitions. [2022-02-20 20:01:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2823 transitions. [2022-02-20 20:01:09,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:09,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:09,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:09,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2634 transitions. [2022-02-20 20:01:09,365 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2634 transitions. Word has length 91 [2022-02-20 20:01:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:09,366 INFO L470 AbstractCegarLoop]: Abstraction has 2002 states and 2634 transitions. [2022-02-20 20:01:09,366 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:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2634 transitions. [2022-02-20 20:01:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:09,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:09,368 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:09,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:09,368 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:09,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash -491011502, now seen corresponding path program 1 times [2022-02-20 20:01:09,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:09,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521342584] [2022-02-20 20:01:09,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {55061#(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); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1609#return; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {55062#(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); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {55062#(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); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1611#return; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {55014#true} havoc ~__retres1~0; {55014#true} is VALID [2022-02-20 20:01:09,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {55014#true} assume !(1 == ~p_dw_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {55014#true} assume !(2 == ~p_dw_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {55014#true} ~__retres1~0 := 0; {55014#true} is VALID [2022-02-20 20:01:09,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {55014#true} #res := ~__retres1~0; {55014#true} is VALID [2022-02-20 20:01:09,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,456 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55014#true} {55014#true} #1605#return; {55014#true} is VALID [2022-02-20 20:01:09,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {55014#true} havoc ~__retres1~1; {55014#true} is VALID [2022-02-20 20:01:09,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {55014#true} assume !(1 == ~c_dr_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {55014#true} assume !(2 == ~c_dr_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {55014#true} ~__retres1~1 := 0; {55014#true} is VALID [2022-02-20 20:01:09,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {55014#true} #res := ~__retres1~1; {55014#true} is VALID [2022-02-20 20:01:09,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,462 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55014#true} {55014#true} #1607#return; {55014#true} is VALID [2022-02-20 20:01:09,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {55063#(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; {55014#true} is VALID [2022-02-20 20:01:09,462 INFO L272 TraceCheckUtils]: 1: Hoare triple {55014#true} call #t~ret8 := is_do_write_p_triggered(); {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {55014#true} havoc ~__retres1~0; {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {55014#true} assume !(1 == ~p_dw_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {55014#true} assume !(2 == ~p_dw_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {55014#true} ~__retres1~0 := 0; {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {55014#true} #res := ~__retres1~0; {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,463 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {55014#true} {55014#true} #1605#return; {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {55014#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {55014#true} assume !(0 != ~tmp~1); {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L272 TraceCheckUtils]: 11: Hoare triple {55014#true} call #t~ret9 := is_do_read_c_triggered(); {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {55014#true} havoc ~__retres1~1; {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {55014#true} assume !(1 == ~c_dr_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {55014#true} assume !(2 == ~c_dr_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {55014#true} ~__retres1~1 := 0; {55014#true} is VALID [2022-02-20 20:01:09,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {55014#true} #res := ~__retres1~1; {55014#true} is VALID [2022-02-20 20:01:09,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,465 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {55014#true} {55014#true} #1607#return; {55014#true} is VALID [2022-02-20 20:01:09,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {55014#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {55014#true} is VALID [2022-02-20 20:01:09,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {55014#true} assume !(0 != ~tmp___0~1); {55014#true} is VALID [2022-02-20 20:01:09,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,466 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {55014#true} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1613#return; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {55062#(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); {55078#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:09,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {55078#(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; {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1615#return; {55015#false} is VALID [2022-02-20 20:01:09,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {55014#true} havoc ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {55014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55014#true} is VALID [2022-02-20 20:01:09,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {55014#true} #res := ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,492 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55014#true} {55015#false} #1617#return; {55015#false} is VALID [2022-02-20 20:01:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:09,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {55014#true} havoc ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {55014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55014#true} is VALID [2022-02-20 20:01:09,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {55014#true} #res := ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,502 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55014#true} {55015#false} #1617#return; {55015#false} is VALID [2022-02-20 20:01:09,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {55014#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {55014#true} is VALID [2022-02-20 20:01:09,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {55014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {55014#true} is VALID [2022-02-20 20:01:09,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {55014#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {55016#(= ~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; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {55061#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:09,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {55061#(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); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,505 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1609#return; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,507 INFO L272 TraceCheckUtils]: 12: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {55062#(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); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {55062#(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); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,508 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1611#return; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,509 INFO L272 TraceCheckUtils]: 17: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {55063#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:09,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {55063#(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; {55014#true} is VALID [2022-02-20 20:01:09,509 INFO L272 TraceCheckUtils]: 19: Hoare triple {55014#true} call #t~ret8 := is_do_write_p_triggered(); {55014#true} is VALID [2022-02-20 20:01:09,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {55014#true} havoc ~__retres1~0; {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {55014#true} assume !(1 == ~p_dw_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {55014#true} assume !(2 == ~p_dw_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {55014#true} ~__retres1~0 := 0; {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {55014#true} #res := ~__retres1~0; {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {55014#true} {55014#true} #1605#return; {55014#true} is VALID [2022-02-20 20:01:09,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {55014#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {55014#true} is VALID [2022-02-20 20:01:09,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {55014#true} assume !(0 != ~tmp~1); {55014#true} is VALID [2022-02-20 20:01:09,511 INFO L272 TraceCheckUtils]: 29: Hoare triple {55014#true} call #t~ret9 := is_do_read_c_triggered(); {55014#true} is VALID [2022-02-20 20:01:09,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {55014#true} havoc ~__retres1~1; {55014#true} is VALID [2022-02-20 20:01:09,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {55014#true} assume !(1 == ~c_dr_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {55014#true} assume !(2 == ~c_dr_pc~0); {55014#true} is VALID [2022-02-20 20:01:09,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {55014#true} ~__retres1~1 := 0; {55014#true} is VALID [2022-02-20 20:01:09,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {55014#true} #res := ~__retres1~1; {55014#true} is VALID [2022-02-20 20:01:09,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,512 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {55014#true} {55014#true} #1607#return; {55014#true} is VALID [2022-02-20 20:01:09,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {55014#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {55014#true} is VALID [2022-02-20 20:01:09,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {55014#true} assume !(0 != ~tmp___0~1); {55014#true} is VALID [2022-02-20 20:01:09,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,513 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {55014#true} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1613#return; {55016#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:09,513 INFO L272 TraceCheckUtils]: 41: Hoare triple {55016#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {55062#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:09,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {55062#(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); {55078#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:09,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {55078#(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; {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:09,515 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {55079#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {55016#(= ~q_write_ev~0 ~q_read_ev~0)} #1615#return; {55015#false} is VALID [2022-02-20 20:01:09,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {55015#false} assume !false; {55015#false} is VALID [2022-02-20 20:01:09,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {55015#false} assume !false; {55015#false} is VALID [2022-02-20 20:01:09,515 INFO L272 TraceCheckUtils]: 49: Hoare triple {55015#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {55014#true} is VALID [2022-02-20 20:01:09,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {55014#true} havoc ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {55014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55014#true} is VALID [2022-02-20 20:01:09,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {55014#true} #res := ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,516 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {55014#true} {55015#false} #1617#return; {55015#false} is VALID [2022-02-20 20:01:09,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {55015#false} assume 0 != eval1_~tmp___1~0#1; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {55015#false} assume 0 == ~p_dw_pc~0; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {55015#false} assume !false; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {55015#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {55015#false} assume { :end_inline_do_write_p } true; {55015#false} is VALID [2022-02-20 20:01:09,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {55015#false} assume !(0 == ~c_dr_st~0); {55015#false} is VALID [2022-02-20 20:01:09,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {55015#false} assume !false; {55015#false} is VALID [2022-02-20 20:01:09,518 INFO L272 TraceCheckUtils]: 65: Hoare triple {55015#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {55014#true} is VALID [2022-02-20 20:01:09,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {55014#true} havoc ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {55014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55014#true} is VALID [2022-02-20 20:01:09,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {55014#true} #res := ~__retres1~2; {55014#true} is VALID [2022-02-20 20:01:09,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {55014#true} assume true; {55014#true} is VALID [2022-02-20 20:01:09,518 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {55014#true} {55015#false} #1617#return; {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {55015#false} assume 0 != eval1_~tmp___1~0#1; {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 74: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 75: Hoare triple {55015#false} assume !(0 == ~p_dw_pc~0); {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {55015#false} assume 1 == ~p_dw_pc~0; {55015#false} is VALID [2022-02-20 20:01:09,519 INFO L290 TraceCheckUtils]: 77: Hoare triple {55015#false} assume !(0 == ~q_free~0); {55015#false} is VALID [2022-02-20 20:01:09,520 INFO L290 TraceCheckUtils]: 78: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,520 INFO L290 TraceCheckUtils]: 79: Hoare triple {55015#false} assume !false; {55015#false} is VALID [2022-02-20 20:01:09,520 INFO L290 TraceCheckUtils]: 80: Hoare triple {55015#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {55015#false} is VALID [2022-02-20 20:01:09,520 INFO L290 TraceCheckUtils]: 81: Hoare triple {55015#false} assume { :end_inline_do_write_p } true; {55015#false} is VALID [2022-02-20 20:01:09,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L290 TraceCheckUtils]: 84: Hoare triple {55015#false} assume !(0 == ~c_dr_pc~0); {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L290 TraceCheckUtils]: 85: Hoare triple {55015#false} assume 2 == ~c_dr_pc~0; {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L290 TraceCheckUtils]: 86: Hoare triple {55015#false} do_read_c_~a~0#1 := ~a_t~0; {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L290 TraceCheckUtils]: 87: Hoare triple {55015#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; {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L290 TraceCheckUtils]: 88: Hoare triple {55015#false} assume !(~p_last_write~0 == ~c_last_read~0); {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L272 TraceCheckUtils]: 89: Hoare triple {55015#false} call error1(); {55015#false} is VALID [2022-02-20 20:01:09,521 INFO L290 TraceCheckUtils]: 90: Hoare triple {55015#false} assume !false; {55015#false} is VALID [2022-02-20 20:01:09,522 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:09,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:09,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521342584] [2022-02-20 20:01:09,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521342584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:09,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:09,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:09,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898137826] [2022-02-20 20:01:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:09,523 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:09,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:09,524 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:09,570 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:09,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:09,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:09,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:09,572 INFO L87 Difference]: Start difference. First operand 2002 states and 2634 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:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:13,309 INFO L93 Difference]: Finished difference Result 3529 states and 4598 transitions. [2022-02-20 20:01:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:13,310 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:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:13,310 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:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 987 transitions. [2022-02-20 20:01:13,315 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:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 987 transitions. [2022-02-20 20:01:13,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 987 transitions. [2022-02-20 20:01:14,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 987 edges. 987 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:14,187 INFO L225 Difference]: With dead ends: 3529 [2022-02-20 20:01:14,187 INFO L226 Difference]: Without dead ends: 2076 [2022-02-20 20:01:14,190 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:14,190 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 1237 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:14,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 2174 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-02-20 20:01:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1781. [2022-02-20 20:01:14,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:14,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2076 states. Second operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-02-20 20:01:14,314 INFO L74 IsIncluded]: Start isIncluded. First operand 2076 states. Second operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-02-20 20:01:14,317 INFO L87 Difference]: Start difference. First operand 2076 states. Second operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-02-20 20:01:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,497 INFO L93 Difference]: Finished difference Result 2076 states and 2721 transitions. [2022-02-20 20:01:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2721 transitions. [2022-02-20 20:01:14,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:14,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:14,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) Second operand 2076 states. [2022-02-20 20:01:14,507 INFO L87 Difference]: Start difference. First operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) Second operand 2076 states. [2022-02-20 20:01:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,701 INFO L93 Difference]: Finished difference Result 2076 states and 2721 transitions. [2022-02-20 20:01:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2721 transitions. [2022-02-20 20:01:14,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:14,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:14,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:14,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-02-20 20:01:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2348 transitions. [2022-02-20 20:01:14,902 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2348 transitions. Word has length 91 [2022-02-20 20:01:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:14,902 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 2348 transitions. [2022-02-20 20:01:14,902 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:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2348 transitions. [2022-02-20 20:01:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:14,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:14,904 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:14,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:14,904 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:14,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1448150544, now seen corresponding path program 1 times [2022-02-20 20:01:14,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:14,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000897674] [2022-02-20 20:01:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {66370#(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); {66323#true} is VALID [2022-02-20 20:01:14,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66323#true} {66323#true} #1609#return; {66323#true} is VALID [2022-02-20 20:01:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {66371#(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); {66323#true} is VALID [2022-02-20 20:01:14,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume !(0 == ~q_write_ev~0); {66323#true} is VALID [2022-02-20 20:01:14,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66323#true} {66328#(= ~c_dr_st~0 0)} #1611#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:14,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {66323#true} havoc ~__retres1~0; {66323#true} is VALID [2022-02-20 20:01:14,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume !(1 == ~p_dw_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} assume !(2 == ~p_dw_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {66323#true} ~__retres1~0 := 0; {66323#true} is VALID [2022-02-20 20:01:14,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {66323#true} #res := ~__retres1~0; {66323#true} is VALID [2022-02-20 20:01:14,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,982 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66323#true} {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1605#return; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {66323#true} havoc ~__retres1~1; {66323#true} is VALID [2022-02-20 20:01:14,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume !(1 == ~c_dr_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} assume !(2 == ~c_dr_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {66323#true} ~__retres1~1 := 0; {66323#true} is VALID [2022-02-20 20:01:14,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {66323#true} #res := ~__retres1~1; {66323#true} is VALID [2022-02-20 20:01:14,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,986 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66323#true} {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1607#return; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {66372#(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; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,987 INFO L272 TraceCheckUtils]: 1: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {66323#true} is VALID [2022-02-20 20:01:14,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} havoc ~__retres1~0; {66323#true} is VALID [2022-02-20 20:01:14,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {66323#true} assume !(1 == ~p_dw_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {66323#true} assume !(2 == ~p_dw_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {66323#true} ~__retres1~0 := 0; {66323#true} is VALID [2022-02-20 20:01:14,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {66323#true} #res := ~__retres1~0; {66323#true} is VALID [2022-02-20 20:01:14,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,988 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {66323#true} {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1605#return; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,989 INFO L272 TraceCheckUtils]: 11: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {66323#true} is VALID [2022-02-20 20:01:14,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {66323#true} havoc ~__retres1~1; {66323#true} is VALID [2022-02-20 20:01:14,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {66323#true} assume !(1 == ~c_dr_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {66323#true} assume !(2 == ~c_dr_pc~0); {66323#true} is VALID [2022-02-20 20:01:14,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {66323#true} ~__retres1~1 := 0; {66323#true} is VALID [2022-02-20 20:01:14,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {66323#true} #res := ~__retres1~1; {66323#true} is VALID [2022-02-20 20:01:14,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,991 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {66323#true} {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1607#return; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:14,992 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {66328#(= ~c_dr_st~0 0)} #1613#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {66371#(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); {66323#true} is VALID [2022-02-20 20:01:14,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume !(1 == ~q_write_ev~0); {66323#true} is VALID [2022-02-20 20:01:14,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:14,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66323#true} {66328#(= ~c_dr_st~0 0)} #1615#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {66323#true} havoc ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66323#true} is VALID [2022-02-20 20:01:15,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} #res := ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,002 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66323#true} {66328#(= ~c_dr_st~0 0)} #1617#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {66323#true} havoc ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66323#true} is VALID [2022-02-20 20:01:15,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} #res := ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,007 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66323#true} {66324#false} #1617#return; {66324#false} is VALID [2022-02-20 20:01:15,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {66323#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {66323#true} is VALID [2022-02-20 20:01:15,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {66323#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {66323#true} is VALID [2022-02-20 20:01:15,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {66323#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {66323#true} is VALID [2022-02-20 20:01:15,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {66323#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; {66323#true} is VALID [2022-02-20 20:01:15,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {66323#true} call update_channels1(); {66370#(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,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {66370#(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); {66323#true} is VALID [2022-02-20 20:01:15,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,009 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66323#true} {66323#true} #1609#return; {66323#true} is VALID [2022-02-20 20:01:15,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {66323#true} assume { :begin_inline_init_threads1 } true; {66323#true} is VALID [2022-02-20 20:01:15,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {66323#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {66323#true} is VALID [2022-02-20 20:01:15,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {66323#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {66328#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {66328#(= ~c_dr_st~0 0)} call fire_delta_events1(); {66371#(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,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {66371#(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); {66323#true} is VALID [2022-02-20 20:01:15,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {66323#true} assume !(0 == ~q_write_ev~0); {66323#true} is VALID [2022-02-20 20:01:15,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,011 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66323#true} {66328#(= ~c_dr_st~0 0)} #1611#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {66328#(= ~c_dr_st~0 0)} call activate_threads1(); {66372#(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,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {66372#(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; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,012 INFO L272 TraceCheckUtils]: 19: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {66323#true} is VALID [2022-02-20 20:01:15,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {66323#true} havoc ~__retres1~0; {66323#true} is VALID [2022-02-20 20:01:15,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {66323#true} assume !(1 == ~p_dw_pc~0); {66323#true} is VALID [2022-02-20 20:01:15,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {66323#true} assume !(2 == ~p_dw_pc~0); {66323#true} is VALID [2022-02-20 20:01:15,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {66323#true} ~__retres1~0 := 0; {66323#true} is VALID [2022-02-20 20:01:15,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {66323#true} #res := ~__retres1~0; {66323#true} is VALID [2022-02-20 20:01:15,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,014 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66323#true} {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1605#return; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,014 INFO L272 TraceCheckUtils]: 29: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {66323#true} is VALID [2022-02-20 20:01:15,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {66323#true} havoc ~__retres1~1; {66323#true} is VALID [2022-02-20 20:01:15,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {66323#true} assume !(1 == ~c_dr_pc~0); {66323#true} is VALID [2022-02-20 20:01:15,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {66323#true} assume !(2 == ~c_dr_pc~0); {66323#true} is VALID [2022-02-20 20:01:15,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {66323#true} ~__retres1~1 := 0; {66323#true} is VALID [2022-02-20 20:01:15,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {66323#true} #res := ~__retres1~1; {66323#true} is VALID [2022-02-20 20:01:15,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,016 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66323#true} {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1607#return; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:15,018 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {66373#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {66328#(= ~c_dr_st~0 0)} #1613#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,018 INFO L272 TraceCheckUtils]: 41: Hoare triple {66328#(= ~c_dr_st~0 0)} call reset_delta_events1(); {66371#(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,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {66371#(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); {66323#true} is VALID [2022-02-20 20:01:15,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {66323#true} assume !(1 == ~q_write_ev~0); {66323#true} is VALID [2022-02-20 20:01:15,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,019 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {66323#true} {66328#(= ~c_dr_st~0 0)} #1615#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {66328#(= ~c_dr_st~0 0)} assume !false; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {66328#(= ~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; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {66328#(= ~c_dr_st~0 0)} assume !false; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,020 INFO L272 TraceCheckUtils]: 49: Hoare triple {66328#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66323#true} is VALID [2022-02-20 20:01:15,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {66323#true} havoc ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {66323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66323#true} is VALID [2022-02-20 20:01:15,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {66323#true} #res := ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,021 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {66323#true} {66328#(= ~c_dr_st~0 0)} #1617#return; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {66328#(= ~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; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {66328#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {66328#(= ~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; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {66328#(= ~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; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {66328#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {66328#(= ~c_dr_st~0 0)} assume !false; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {66328#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {66328#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {66328#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:15,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {66328#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {66324#false} is VALID [2022-02-20 20:01:15,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {66324#false} assume !false; {66324#false} is VALID [2022-02-20 20:01:15,044 INFO L272 TraceCheckUtils]: 65: Hoare triple {66324#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {66323#true} is VALID [2022-02-20 20:01:15,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {66323#true} havoc ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {66323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {66323#true} is VALID [2022-02-20 20:01:15,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {66323#true} #res := ~__retres1~2; {66323#true} is VALID [2022-02-20 20:01:15,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {66323#true} assume true; {66323#true} is VALID [2022-02-20 20:01:15,044 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {66323#true} {66324#false} #1617#return; {66324#false} is VALID [2022-02-20 20:01:15,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {66324#false} assume 0 != eval1_~tmp___1~0#1; {66324#false} is VALID [2022-02-20 20:01:15,045 INFO L290 TraceCheckUtils]: 73: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {66324#false} assume !(0 == ~p_dw_pc~0); {66324#false} is VALID [2022-02-20 20:01:15,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {66324#false} assume 1 == ~p_dw_pc~0; {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {66324#false} assume !(0 == ~q_free~0); {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {66324#false} assume !false; {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {66324#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 81: Hoare triple {66324#false} assume { :end_inline_do_write_p } true; {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {66324#false} assume !(0 == ~c_dr_pc~0); {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {66324#false} assume 2 == ~c_dr_pc~0; {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {66324#false} do_read_c_~a~0#1 := ~a_t~0; {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {66324#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; {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {66324#false} assume !(~p_last_write~0 == ~c_last_read~0); {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L272 TraceCheckUtils]: 89: Hoare triple {66324#false} call error1(); {66324#false} is VALID [2022-02-20 20:01:15,047 INFO L290 TraceCheckUtils]: 90: Hoare triple {66324#false} assume !false; {66324#false} is VALID [2022-02-20 20:01:15,048 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:15,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:15,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000897674] [2022-02-20 20:01:15,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000897674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:15,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:15,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:15,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015271051] [2022-02-20 20:01:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:15,050 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:15,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:15,050 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:15,117 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:15,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:15,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:15,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:15,118 INFO L87 Difference]: Start difference. First operand 1781 states and 2348 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)