./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.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_2.cil-1+token_ring.03.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 a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:44,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:44,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:44,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:44,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:44,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:44,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:44,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:44,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:44,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:44,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:44,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:44,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:44,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:44,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:44,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:44,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:44,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:44,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:44,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:44,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:44,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:44,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:44,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:44,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:44,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:44,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:44,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:44,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:44,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:44,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:44,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:44,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:44,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:44,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:44,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:44,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:44,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:44,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:44,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:44,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:44,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:56:44,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:44,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:44,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:44,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:44,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:44,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:44,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:44,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:44,769 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:44,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:44,771 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:44,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:44,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:44,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:44,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:44,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:44,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:44,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:44,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:44,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:44,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:44,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:44,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:44,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:44,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:44,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:44,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:44,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:44,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:44,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:44,776 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:44,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:44,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:44,777 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 -> a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 [2022-02-20 19:56:44,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:45,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:45,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:45,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:45,021 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:45,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-02-20 19:56:45,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86db085c2/54b666b1274d4e3f924b1a508963babc/FLAGb82da8b77 [2022-02-20 19:56:45,480 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:45,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-02-20 19:56:45,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86db085c2/54b666b1274d4e3f924b1a508963babc/FLAGb82da8b77 [2022-02-20 19:56:45,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86db085c2/54b666b1274d4e3f924b1a508963babc [2022-02-20 19:56:45,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:45,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:45,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:45,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:45,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:45,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:45,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724c4813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45, skipping insertion in model container [2022-02-20 19:56:45,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:45,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:45,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:45,685 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_2.cil-1+token_ring.03.cil-1.c[914,927] [2022-02-20 19:56:45,749 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_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2022-02-20 19:56:45,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:45,813 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:45,837 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_2.cil-1+token_ring.03.cil-1.c[914,927] [2022-02-20 19:56:45,860 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_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2022-02-20 19:56:45,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:45,928 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:45,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45 WrapperNode [2022-02-20 19:56:45,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:45,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:45,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:45,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:45,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:45,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,005 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 523 [2022-02-20 19:56:46,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:46,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:46,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:46,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:46,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:46,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:46,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:46,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:46,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:46,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:46,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:46,111 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 19:56:46,112 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 19:56:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:46,141 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:46,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:46,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:46,142 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:46,142 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:46,142 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:46,142 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:46,142 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:46,142 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:46,144 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:46,144 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:46,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:46,145 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:46,145 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:56:46,145 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:56:46,243 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:46,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:46,832 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:46,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:46,845 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:56:46,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:46 BoogieIcfgContainer [2022-02-20 19:56:46,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:46,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:46,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:46,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:46,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:45" (1/3) ... [2022-02-20 19:56:46,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777a8147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:46, skipping insertion in model container [2022-02-20 19:56:46,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45" (2/3) ... [2022-02-20 19:56:46,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777a8147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:46, skipping insertion in model container [2022-02-20 19:56:46,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:46" (3/3) ... [2022-02-20 19:56:46,859 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-02-20 19:56:46,865 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:46,865 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:46,924 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:46,929 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 19:56:46,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:56:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:46,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:46,971 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 19:56:46,972 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 207768249, now seen corresponding path program 1 times [2022-02-20 19:56:46,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:46,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514990146] [2022-02-20 19:56:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#(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); {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {271#(= ~q_read_ev~0 2)} #905#return; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#(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; {312#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {312#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#(= |old(~q_read_ev~0)| 0)} assume true; {312#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312#(= |old(~q_read_ev~0)| 0)} {271#(= ~q_read_ev~0 2)} #907#return; {270#false} is VALID [2022-02-20 19:56:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} havoc ~__retres1~0; {269#true} is VALID [2022-02-20 19:56:47,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume !(1 == ~p_dw_pc~0); {269#true} is VALID [2022-02-20 19:56:47,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} ~__retres1~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} #res := ~__retres1~0; {269#true} is VALID [2022-02-20 19:56:47,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,414 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {269#true} {269#true} #901#return; {269#true} is VALID [2022-02-20 19:56:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} havoc ~__retres1~1; {269#true} is VALID [2022-02-20 19:56:47,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume !(1 == ~c_dr_pc~0); {269#true} is VALID [2022-02-20 19:56:47,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} ~__retres1~1 := 0; {269#true} is VALID [2022-02-20 19:56:47,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} #res := ~__retres1~1; {269#true} is VALID [2022-02-20 19:56:47,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,427 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {269#true} {269#true} #903#return; {269#true} is VALID [2022-02-20 19:56:47,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(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; {269#true} is VALID [2022-02-20 19:56:47,427 INFO L272 TraceCheckUtils]: 1: Hoare triple {269#true} call #t~ret8 := is_do_write_p_triggered(); {269#true} is VALID [2022-02-20 19:56:47,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} havoc ~__retres1~0; {269#true} is VALID [2022-02-20 19:56:47,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} assume !(1 == ~p_dw_pc~0); {269#true} is VALID [2022-02-20 19:56:47,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#true} ~__retres1~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} #res := ~__retres1~0; {269#true} is VALID [2022-02-20 19:56:47,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,430 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {269#true} {269#true} #901#return; {269#true} is VALID [2022-02-20 19:56:47,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {269#true} is VALID [2022-02-20 19:56:47,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,430 INFO L272 TraceCheckUtils]: 10: Hoare triple {269#true} call #t~ret9 := is_do_read_c_triggered(); {269#true} is VALID [2022-02-20 19:56:47,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#true} havoc ~__retres1~1; {269#true} is VALID [2022-02-20 19:56:47,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {269#true} assume !(1 == ~c_dr_pc~0); {269#true} is VALID [2022-02-20 19:56:47,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#true} ~__retres1~1 := 0; {269#true} is VALID [2022-02-20 19:56:47,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#true} #res := ~__retres1~1; {269#true} is VALID [2022-02-20 19:56:47,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {269#true} {269#true} #903#return; {269#true} is VALID [2022-02-20 19:56:47,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {269#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {269#true} is VALID [2022-02-20 19:56:47,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {269#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,437 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {269#true} {270#false} #909#return; {270#false} is VALID [2022-02-20 19:56:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {269#true} is VALID [2022-02-20 19:56:47,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {269#true} is VALID [2022-02-20 19:56:47,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {270#false} #911#return; {270#false} is VALID [2022-02-20 19:56:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} havoc ~__retres1~2; {269#true} is VALID [2022-02-20 19:56:47,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {269#true} is VALID [2022-02-20 19:56:47,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} #res := ~__retres1~2; {269#true} is VALID [2022-02-20 19:56:47,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,472 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {269#true} {270#false} #913#return; {270#false} is VALID [2022-02-20 19:56:47,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {269#true} is VALID [2022-02-20 19:56:47,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#(= ~q_read_ev~0 2)} call update_channels1(); {309#(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 19:56:47,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#(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); {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,484 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {310#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {271#(= ~q_read_ev~0 2)} #905#return; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {271#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,488 INFO L272 TraceCheckUtils]: 12: Hoare triple {271#(= ~q_read_ev~0 2)} call fire_delta_events1(); {311#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:47,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#(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; {312#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {312#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(= |old(~q_read_ev~0)| 0)} assume true; {312#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,490 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {312#(= |old(~q_read_ev~0)| 0)} {271#(= ~q_read_ev~0 2)} #907#return; {270#false} is VALID [2022-02-20 19:56:47,490 INFO L272 TraceCheckUtils]: 17: Hoare triple {270#false} call activate_threads1(); {313#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:47,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(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; {269#true} is VALID [2022-02-20 19:56:47,491 INFO L272 TraceCheckUtils]: 19: Hoare triple {269#true} call #t~ret8 := is_do_write_p_triggered(); {269#true} is VALID [2022-02-20 19:56:47,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#true} havoc ~__retres1~0; {269#true} is VALID [2022-02-20 19:56:47,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {269#true} assume !(1 == ~p_dw_pc~0); {269#true} is VALID [2022-02-20 19:56:47,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {269#true} ~__retres1~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {269#true} #res := ~__retres1~0; {269#true} is VALID [2022-02-20 19:56:47,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,492 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {269#true} {269#true} #901#return; {269#true} is VALID [2022-02-20 19:56:47,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {269#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {269#true} is VALID [2022-02-20 19:56:47,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {269#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,493 INFO L272 TraceCheckUtils]: 28: Hoare triple {269#true} call #t~ret9 := is_do_read_c_triggered(); {269#true} is VALID [2022-02-20 19:56:47,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {269#true} havoc ~__retres1~1; {269#true} is VALID [2022-02-20 19:56:47,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {269#true} assume !(1 == ~c_dr_pc~0); {269#true} is VALID [2022-02-20 19:56:47,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {269#true} ~__retres1~1 := 0; {269#true} is VALID [2022-02-20 19:56:47,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {269#true} #res := ~__retres1~1; {269#true} is VALID [2022-02-20 19:56:47,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,495 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {269#true} {269#true} #903#return; {269#true} is VALID [2022-02-20 19:56:47,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {269#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {269#true} is VALID [2022-02-20 19:56:47,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {269#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {269#true} is VALID [2022-02-20 19:56:47,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,495 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {269#true} {270#false} #909#return; {270#false} is VALID [2022-02-20 19:56:47,496 INFO L272 TraceCheckUtils]: 39: Hoare triple {270#false} call reset_delta_events1(); {311#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:47,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {311#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {269#true} is VALID [2022-02-20 19:56:47,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {269#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {269#true} is VALID [2022-02-20 19:56:47,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,496 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {269#true} {270#false} #911#return; {270#false} is VALID [2022-02-20 19:56:47,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 19:56:47,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {270#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; {270#false} is VALID [2022-02-20 19:56:47,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 19:56:47,498 INFO L272 TraceCheckUtils]: 47: Hoare triple {270#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {269#true} is VALID [2022-02-20 19:56:47,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {269#true} havoc ~__retres1~2; {269#true} is VALID [2022-02-20 19:56:47,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {269#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {269#true} is VALID [2022-02-20 19:56:47,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {269#true} #res := ~__retres1~2; {269#true} is VALID [2022-02-20 19:56:47,498 INFO L290 TraceCheckUtils]: 51: Hoare triple {269#true} assume true; {269#true} is VALID [2022-02-20 19:56:47,500 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {269#true} {270#false} #913#return; {270#false} is VALID [2022-02-20 19:56:47,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {270#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; {270#false} is VALID [2022-02-20 19:56:47,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {270#false} assume 0 != eval1_~tmp___1~0#1; {270#false} is VALID [2022-02-20 19:56:47,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {270#false} assume !(0 == ~p_dw_st~0); {270#false} is VALID [2022-02-20 19:56:47,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {270#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; {270#false} is VALID [2022-02-20 19:56:47,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {270#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; {270#false} is VALID [2022-02-20 19:56:47,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {270#false} assume 0 == ~c_dr_pc~0; {270#false} is VALID [2022-02-20 19:56:47,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 19:56:47,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {270#false} assume !(1 == ~q_free~0); {270#false} is VALID [2022-02-20 19:56:47,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {270#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; {270#false} is VALID [2022-02-20 19:56:47,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {270#false} assume !(~p_last_write~0 == ~c_last_read~0); {270#false} is VALID [2022-02-20 19:56:47,505 INFO L272 TraceCheckUtils]: 63: Hoare triple {270#false} call error1(); {270#false} is VALID [2022-02-20 19:56:47,505 INFO L290 TraceCheckUtils]: 64: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 19:56:47,506 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 19:56:47,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:47,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514990146] [2022-02-20 19:56:47,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514990146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:47,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:47,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:47,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929878791] [2022-02-20 19:56:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:47,519 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 19:56:47,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:47,525 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 19:56:47,594 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 19:56:47,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:47,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:47,623 INFO L87 Difference]: Start difference. First operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) 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 19:56:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:50,040 INFO L93 Difference]: Finished difference Result 647 states and 988 transitions. [2022-02-20 19:56:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:50,041 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 19:56:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:50,042 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 19:56:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 988 transitions. [2022-02-20 19:56:50,074 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 19:56:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 988 transitions. [2022-02-20 19:56:50,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 988 transitions. [2022-02-20 19:56:50,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 988 edges. 988 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:50,899 INFO L225 Difference]: With dead ends: 647 [2022-02-20 19:56:50,899 INFO L226 Difference]: Without dead ends: 390 [2022-02-20 19:56:50,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:56:50,907 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 668 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:50,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 1101 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:56:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-20 19:56:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 351. [2022-02-20 19:56:50,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:50,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,965 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,967 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:50,990 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2022-02-20 19:56:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 556 transitions. [2022-02-20 19:56:50,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:50,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:50,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 390 states. [2022-02-20 19:56:50,997 INFO L87 Difference]: Start difference. First operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 390 states. [2022-02-20 19:56:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:51,016 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2022-02-20 19:56:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 556 transitions. [2022-02-20 19:56:51,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:51,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:51,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:51,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 502 transitions. [2022-02-20 19:56:51,038 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 502 transitions. Word has length 65 [2022-02-20 19:56:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:51,038 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 502 transitions. [2022-02-20 19:56:51,039 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 19:56:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 502 transitions. [2022-02-20 19:56:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:51,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:51,041 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 19:56:51,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:51,042 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1886656889, now seen corresponding path program 1 times [2022-02-20 19:56:51,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:51,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464815828] [2022-02-20 19:56:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {2529#(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); {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:51,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:51,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2491#(= ~q_write_ev~0 ~q_read_ev~0)} #905#return; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {2530#(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); {2531#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:51,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2531#(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; {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:51,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:51,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2491#(= ~q_write_ev~0 ~q_read_ev~0)} #907#return; {2490#false} is VALID [2022-02-20 19:56:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {2489#true} havoc ~__retres1~0; {2489#true} is VALID [2022-02-20 19:56:51,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume !(1 == ~p_dw_pc~0); {2489#true} is VALID [2022-02-20 19:56:51,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} ~__retres1~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {2489#true} #res := ~__retres1~0; {2489#true} is VALID [2022-02-20 19:56:51,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,158 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2489#true} {2489#true} #901#return; {2489#true} is VALID [2022-02-20 19:56:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {2489#true} havoc ~__retres1~1; {2489#true} is VALID [2022-02-20 19:56:51,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume !(1 == ~c_dr_pc~0); {2489#true} is VALID [2022-02-20 19:56:51,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} ~__retres1~1 := 0; {2489#true} is VALID [2022-02-20 19:56:51,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {2489#true} #res := ~__retres1~1; {2489#true} is VALID [2022-02-20 19:56:51,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,163 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2489#true} {2489#true} #903#return; {2489#true} is VALID [2022-02-20 19:56:51,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#(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; {2489#true} is VALID [2022-02-20 19:56:51,163 INFO L272 TraceCheckUtils]: 1: Hoare triple {2489#true} call #t~ret8 := is_do_write_p_triggered(); {2489#true} is VALID [2022-02-20 19:56:51,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} havoc ~__retres1~0; {2489#true} is VALID [2022-02-20 19:56:51,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {2489#true} assume !(1 == ~p_dw_pc~0); {2489#true} is VALID [2022-02-20 19:56:51,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {2489#true} ~__retres1~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#true} #res := ~__retres1~0; {2489#true} is VALID [2022-02-20 19:56:51,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,164 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2489#true} {2489#true} #901#return; {2489#true} is VALID [2022-02-20 19:56:51,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2489#true} is VALID [2022-02-20 19:56:51,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,165 INFO L272 TraceCheckUtils]: 10: Hoare triple {2489#true} call #t~ret9 := is_do_read_c_triggered(); {2489#true} is VALID [2022-02-20 19:56:51,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#true} havoc ~__retres1~1; {2489#true} is VALID [2022-02-20 19:56:51,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {2489#true} assume !(1 == ~c_dr_pc~0); {2489#true} is VALID [2022-02-20 19:56:51,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#true} ~__retres1~1 := 0; {2489#true} is VALID [2022-02-20 19:56:51,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {2489#true} #res := ~__retres1~1; {2489#true} is VALID [2022-02-20 19:56:51,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,166 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2489#true} {2489#true} #903#return; {2489#true} is VALID [2022-02-20 19:56:51,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {2489#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2489#true} is VALID [2022-02-20 19:56:51,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,167 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2489#true} {2490#false} #909#return; {2490#false} is VALID [2022-02-20 19:56:51,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2530#(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); {2489#true} is VALID [2022-02-20 19:56:51,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2489#true} is VALID [2022-02-20 19:56:51,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2490#false} #911#return; {2490#false} is VALID [2022-02-20 19:56:51,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:51,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {2489#true} havoc ~__retres1~2; {2489#true} is VALID [2022-02-20 19:56:51,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2489#true} is VALID [2022-02-20 19:56:51,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} #res := ~__retres1~2; {2489#true} is VALID [2022-02-20 19:56:51,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,178 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2489#true} {2490#false} #913#return; {2490#false} is VALID [2022-02-20 19:56:51,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {2489#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {2489#true} is VALID [2022-02-20 19:56:51,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {2491#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {2491#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2529#(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 19:56:51,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {2529#(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); {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:51,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:51,181 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2491#(= ~q_write_ev~0 ~q_read_ev~0)} #905#return; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {2491#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2491#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:51,183 INFO L272 TraceCheckUtils]: 12: Hoare triple {2491#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:51,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {2530#(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); {2531#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:51,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {2531#(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; {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:51,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:51,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2532#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2491#(= ~q_write_ev~0 ~q_read_ev~0)} #907#return; {2490#false} is VALID [2022-02-20 19:56:51,185 INFO L272 TraceCheckUtils]: 17: Hoare triple {2490#false} call activate_threads1(); {2533#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:51,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {2533#(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; {2489#true} is VALID [2022-02-20 19:56:51,185 INFO L272 TraceCheckUtils]: 19: Hoare triple {2489#true} call #t~ret8 := is_do_write_p_triggered(); {2489#true} is VALID [2022-02-20 19:56:51,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {2489#true} havoc ~__retres1~0; {2489#true} is VALID [2022-02-20 19:56:51,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {2489#true} assume !(1 == ~p_dw_pc~0); {2489#true} is VALID [2022-02-20 19:56:51,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {2489#true} ~__retres1~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {2489#true} #res := ~__retres1~0; {2489#true} is VALID [2022-02-20 19:56:51,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,187 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2489#true} {2489#true} #901#return; {2489#true} is VALID [2022-02-20 19:56:51,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {2489#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2489#true} is VALID [2022-02-20 19:56:51,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {2489#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,187 INFO L272 TraceCheckUtils]: 28: Hoare triple {2489#true} call #t~ret9 := is_do_read_c_triggered(); {2489#true} is VALID [2022-02-20 19:56:51,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {2489#true} havoc ~__retres1~1; {2489#true} is VALID [2022-02-20 19:56:51,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {2489#true} assume !(1 == ~c_dr_pc~0); {2489#true} is VALID [2022-02-20 19:56:51,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {2489#true} ~__retres1~1 := 0; {2489#true} is VALID [2022-02-20 19:56:51,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {2489#true} #res := ~__retres1~1; {2489#true} is VALID [2022-02-20 19:56:51,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,188 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2489#true} {2489#true} #903#return; {2489#true} is VALID [2022-02-20 19:56:51,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {2489#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2489#true} is VALID [2022-02-20 19:56:51,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {2489#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2489#true} is VALID [2022-02-20 19:56:51,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,189 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2489#true} {2490#false} #909#return; {2490#false} is VALID [2022-02-20 19:56:51,189 INFO L272 TraceCheckUtils]: 39: Hoare triple {2490#false} call reset_delta_events1(); {2530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:51,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {2530#(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); {2489#true} is VALID [2022-02-20 19:56:51,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {2489#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2489#true} is VALID [2022-02-20 19:56:51,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,190 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2489#true} {2490#false} #911#return; {2490#false} is VALID [2022-02-20 19:56:51,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-02-20 19:56:51,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {2490#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; {2490#false} is VALID [2022-02-20 19:56:51,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-02-20 19:56:51,190 INFO L272 TraceCheckUtils]: 47: Hoare triple {2490#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2489#true} is VALID [2022-02-20 19:56:51,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {2489#true} havoc ~__retres1~2; {2489#true} is VALID [2022-02-20 19:56:51,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {2489#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2489#true} is VALID [2022-02-20 19:56:51,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {2489#true} #res := ~__retres1~2; {2489#true} is VALID [2022-02-20 19:56:51,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-02-20 19:56:51,191 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2489#true} {2490#false} #913#return; {2490#false} is VALID [2022-02-20 19:56:51,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {2490#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; {2490#false} is VALID [2022-02-20 19:56:51,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {2490#false} assume 0 != eval1_~tmp___1~0#1; {2490#false} is VALID [2022-02-20 19:56:51,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {2490#false} assume !(0 == ~p_dw_st~0); {2490#false} is VALID [2022-02-20 19:56:51,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {2490#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; {2490#false} is VALID [2022-02-20 19:56:51,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {2490#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; {2490#false} is VALID [2022-02-20 19:56:51,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {2490#false} assume 0 == ~c_dr_pc~0; {2490#false} is VALID [2022-02-20 19:56:51,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-02-20 19:56:51,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {2490#false} assume !(1 == ~q_free~0); {2490#false} is VALID [2022-02-20 19:56:51,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {2490#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; {2490#false} is VALID [2022-02-20 19:56:51,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {2490#false} assume !(~p_last_write~0 == ~c_last_read~0); {2490#false} is VALID [2022-02-20 19:56:51,193 INFO L272 TraceCheckUtils]: 63: Hoare triple {2490#false} call error1(); {2490#false} is VALID [2022-02-20 19:56:51,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-02-20 19:56:51,194 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 19:56:51,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:51,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464815828] [2022-02-20 19:56:51,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464815828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:51,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:51,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:51,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061681857] [2022-02-20 19:56:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:51,197 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 19:56:51,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:51,197 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 19:56:51,249 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 19:56:51,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:51,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:51,251 INFO L87 Difference]: Start difference. First operand 351 states and 502 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 19:56:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:54,326 INFO L93 Difference]: Finished difference Result 698 states and 979 transitions. [2022-02-20 19:56:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:56:54,326 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 19:56:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:54,327 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 19:56:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 708 transitions. [2022-02-20 19:56:54,338 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 19:56:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 708 transitions. [2022-02-20 19:56:54,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 708 transitions. [2022-02-20 19:56:54,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:54,915 INFO L225 Difference]: With dead ends: 698 [2022-02-20 19:56:54,916 INFO L226 Difference]: Without dead ends: 521 [2022-02-20 19:56:54,917 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 19:56:54,918 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 691 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:54,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 1541 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:56:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-02-20 19:56:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 447. [2022-02-20 19:56:54,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:54,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 521 states. Second operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:54,947 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:54,949 INFO L87 Difference]: Start difference. First operand 521 states. Second operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:54,972 INFO L93 Difference]: Finished difference Result 521 states and 739 transitions. [2022-02-20 19:56:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 739 transitions. [2022-02-20 19:56:54,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:54,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:54,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) Second operand 521 states. [2022-02-20 19:56:54,978 INFO L87 Difference]: Start difference. First operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) Second operand 521 states. [2022-02-20 19:56:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,002 INFO L93 Difference]: Finished difference Result 521 states and 739 transitions. [2022-02-20 19:56:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 739 transitions. [2022-02-20 19:56:55,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:55,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 636 transitions. [2022-02-20 19:56:55,026 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 636 transitions. Word has length 65 [2022-02-20 19:56:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:55,027 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 636 transitions. [2022-02-20 19:56:55,027 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 19:56:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 636 transitions. [2022-02-20 19:56:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:55,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:55,029 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 19:56:55,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:56:55,029 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:55,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -141929221, now seen corresponding path program 1 times [2022-02-20 19:56:55,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:55,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117155763] [2022-02-20 19:56:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {5211#(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); {5172#true} is VALID [2022-02-20 19:56:55,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5172#true} {5172#true} #905#return; {5172#true} is VALID [2022-02-20 19:56:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {5212#(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); {5172#true} is VALID [2022-02-20 19:56:55,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume !(0 == ~q_write_ev~0); {5172#true} is VALID [2022-02-20 19:56:55,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} #907#return; {5172#true} is VALID [2022-02-20 19:56:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {5172#true} havoc ~__retres1~0; {5172#true} is VALID [2022-02-20 19:56:55,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume !(1 == ~p_dw_pc~0); {5172#true} is VALID [2022-02-20 19:56:55,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} ~__retres1~0 := 0; {5228#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:55,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {5228#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:55,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:55,211 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5172#true} #901#return; {5220#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {5172#true} havoc ~__retres1~1; {5172#true} is VALID [2022-02-20 19:56:55,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume !(1 == ~c_dr_pc~0); {5172#true} is VALID [2022-02-20 19:56:55,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} ~__retres1~1 := 0; {5172#true} is VALID [2022-02-20 19:56:55,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {5172#true} #res := ~__retres1~1; {5172#true} is VALID [2022-02-20 19:56:55,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,218 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5172#true} {5173#false} #903#return; {5173#false} is VALID [2022-02-20 19:56:55,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {5213#(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; {5172#true} is VALID [2022-02-20 19:56:55,219 INFO L272 TraceCheckUtils]: 1: Hoare triple {5172#true} call #t~ret8 := is_do_write_p_triggered(); {5172#true} is VALID [2022-02-20 19:56:55,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} havoc ~__retres1~0; {5172#true} is VALID [2022-02-20 19:56:55,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {5172#true} assume !(1 == ~p_dw_pc~0); {5172#true} is VALID [2022-02-20 19:56:55,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {5172#true} ~__retres1~0 := 0; {5228#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:55,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {5228#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:55,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:55,222 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5172#true} #901#return; {5220#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:55,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {5220#(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; {5221#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:55,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {5221#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5173#false} is VALID [2022-02-20 19:56:55,223 INFO L272 TraceCheckUtils]: 10: Hoare triple {5173#false} call #t~ret9 := is_do_read_c_triggered(); {5172#true} is VALID [2022-02-20 19:56:55,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {5172#true} havoc ~__retres1~1; {5172#true} is VALID [2022-02-20 19:56:55,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {5172#true} assume !(1 == ~c_dr_pc~0); {5172#true} is VALID [2022-02-20 19:56:55,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {5172#true} ~__retres1~1 := 0; {5172#true} is VALID [2022-02-20 19:56:55,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {5172#true} #res := ~__retres1~1; {5172#true} is VALID [2022-02-20 19:56:55,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,224 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5172#true} {5173#false} #903#return; {5173#false} is VALID [2022-02-20 19:56:55,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {5173#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5173#false} is VALID [2022-02-20 19:56:55,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {5173#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5173#false} is VALID [2022-02-20 19:56:55,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {5173#false} assume true; {5173#false} is VALID [2022-02-20 19:56:55,225 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5173#false} {5172#true} #909#return; {5173#false} is VALID [2022-02-20 19:56:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {5212#(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); {5172#true} is VALID [2022-02-20 19:56:55,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5172#true} is VALID [2022-02-20 19:56:55,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5173#false} #911#return; {5173#false} is VALID [2022-02-20 19:56:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {5172#true} havoc ~__retres1~2; {5172#true} is VALID [2022-02-20 19:56:55,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5172#true} is VALID [2022-02-20 19:56:55,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} #res := ~__retres1~2; {5172#true} is VALID [2022-02-20 19:56:55,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,234 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5172#true} {5173#false} #913#return; {5173#false} is VALID [2022-02-20 19:56:55,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {5172#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {5172#true} is VALID [2022-02-20 19:56:55,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {5172#true} is VALID [2022-02-20 19:56:55,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {5172#true} is VALID [2022-02-20 19:56:55,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {5172#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {5172#true} is VALID [2022-02-20 19:56:55,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#true} call update_channels1(); {5211#(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 19:56:55,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {5211#(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); {5172#true} is VALID [2022-02-20 19:56:55,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,236 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5172#true} {5172#true} #905#return; {5172#true} is VALID [2022-02-20 19:56:55,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {5172#true} assume { :begin_inline_init_threads1 } true; {5172#true} is VALID [2022-02-20 19:56:55,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {5172#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5172#true} is VALID [2022-02-20 19:56:55,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {5172#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5172#true} is VALID [2022-02-20 19:56:55,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {5172#true} assume { :end_inline_init_threads1 } true; {5172#true} is VALID [2022-02-20 19:56:55,237 INFO L272 TraceCheckUtils]: 12: Hoare triple {5172#true} call fire_delta_events1(); {5212#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {5212#(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); {5172#true} is VALID [2022-02-20 19:56:55,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {5172#true} assume !(0 == ~q_write_ev~0); {5172#true} is VALID [2022-02-20 19:56:55,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,238 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5172#true} {5172#true} #907#return; {5172#true} is VALID [2022-02-20 19:56:55,238 INFO L272 TraceCheckUtils]: 17: Hoare triple {5172#true} call activate_threads1(); {5213#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:55,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {5213#(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; {5172#true} is VALID [2022-02-20 19:56:55,239 INFO L272 TraceCheckUtils]: 19: Hoare triple {5172#true} call #t~ret8 := is_do_write_p_triggered(); {5172#true} is VALID [2022-02-20 19:56:55,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {5172#true} havoc ~__retres1~0; {5172#true} is VALID [2022-02-20 19:56:55,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {5172#true} assume !(1 == ~p_dw_pc~0); {5172#true} is VALID [2022-02-20 19:56:55,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {5172#true} ~__retres1~0 := 0; {5228#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:55,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {5228#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:55,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:55,241 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5229#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5172#true} #901#return; {5220#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:55,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#(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; {5221#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:55,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {5221#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5173#false} is VALID [2022-02-20 19:56:55,242 INFO L272 TraceCheckUtils]: 28: Hoare triple {5173#false} call #t~ret9 := is_do_read_c_triggered(); {5172#true} is VALID [2022-02-20 19:56:55,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {5172#true} havoc ~__retres1~1; {5172#true} is VALID [2022-02-20 19:56:55,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {5172#true} assume !(1 == ~c_dr_pc~0); {5172#true} is VALID [2022-02-20 19:56:55,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {5172#true} ~__retres1~1 := 0; {5172#true} is VALID [2022-02-20 19:56:55,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {5172#true} #res := ~__retres1~1; {5172#true} is VALID [2022-02-20 19:56:55,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,243 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5172#true} {5173#false} #903#return; {5173#false} is VALID [2022-02-20 19:56:55,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {5173#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5173#false} is VALID [2022-02-20 19:56:55,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {5173#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5173#false} is VALID [2022-02-20 19:56:55,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {5173#false} assume true; {5173#false} is VALID [2022-02-20 19:56:55,244 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5173#false} {5172#true} #909#return; {5173#false} is VALID [2022-02-20 19:56:55,244 INFO L272 TraceCheckUtils]: 39: Hoare triple {5173#false} call reset_delta_events1(); {5212#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {5212#(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); {5172#true} is VALID [2022-02-20 19:56:55,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {5172#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5172#true} is VALID [2022-02-20 19:56:55,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,244 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5172#true} {5173#false} #911#return; {5173#false} is VALID [2022-02-20 19:56:55,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2022-02-20 19:56:55,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {5173#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; {5173#false} is VALID [2022-02-20 19:56:55,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2022-02-20 19:56:55,245 INFO L272 TraceCheckUtils]: 47: Hoare triple {5173#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5172#true} is VALID [2022-02-20 19:56:55,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {5172#true} havoc ~__retres1~2; {5172#true} is VALID [2022-02-20 19:56:55,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {5172#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5172#true} is VALID [2022-02-20 19:56:55,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {5172#true} #res := ~__retres1~2; {5172#true} is VALID [2022-02-20 19:56:55,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-02-20 19:56:55,246 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5172#true} {5173#false} #913#return; {5173#false} is VALID [2022-02-20 19:56:55,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {5173#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; {5173#false} is VALID [2022-02-20 19:56:55,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {5173#false} assume 0 != eval1_~tmp___1~0#1; {5173#false} is VALID [2022-02-20 19:56:55,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {5173#false} assume !(0 == ~p_dw_st~0); {5173#false} is VALID [2022-02-20 19:56:55,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {5173#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; {5173#false} is VALID [2022-02-20 19:56:55,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {5173#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; {5173#false} is VALID [2022-02-20 19:56:55,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {5173#false} assume 0 == ~c_dr_pc~0; {5173#false} is VALID [2022-02-20 19:56:55,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2022-02-20 19:56:55,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {5173#false} assume !(1 == ~q_free~0); {5173#false} is VALID [2022-02-20 19:56:55,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {5173#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; {5173#false} is VALID [2022-02-20 19:56:55,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {5173#false} assume !(~p_last_write~0 == ~c_last_read~0); {5173#false} is VALID [2022-02-20 19:56:55,248 INFO L272 TraceCheckUtils]: 63: Hoare triple {5173#false} call error1(); {5173#false} is VALID [2022-02-20 19:56:55,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2022-02-20 19:56:55,248 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 19:56:55,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:55,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117155763] [2022-02-20 19:56:55,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117155763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:55,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:55,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:55,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112239749] [2022-02-20 19:56:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:55,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:55,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:55,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:56:55,290 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 19:56:55,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:55,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:55,292 INFO L87 Difference]: Start difference. First operand 447 states and 636 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:56:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:57,566 INFO L93 Difference]: Finished difference Result 748 states and 1050 transitions. [2022-02-20 19:56:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:56:57,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:56:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 526 transitions. [2022-02-20 19:56:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:56:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 526 transitions. [2022-02-20 19:56:57,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 526 transitions. [2022-02-20 19:56:57,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:57,985 INFO L225 Difference]: With dead ends: 748 [2022-02-20 19:56:57,985 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 19:56:57,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:56:57,987 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 431 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:57,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 1471 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:56:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 19:56:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 452. [2022-02-20 19:56:58,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:58,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:58,016 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:58,017 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,033 INFO L93 Difference]: Finished difference Result 481 states and 680 transitions. [2022-02-20 19:56:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2022-02-20 19:56:58,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:58,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:58,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) Second operand 481 states. [2022-02-20 19:56:58,037 INFO L87 Difference]: Start difference. First operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) Second operand 481 states. [2022-02-20 19:56:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,054 INFO L93 Difference]: Finished difference Result 481 states and 680 transitions. [2022-02-20 19:56:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2022-02-20 19:56:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:58,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:58,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 639 transitions. [2022-02-20 19:56:58,074 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 639 transitions. Word has length 65 [2022-02-20 19:56:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:58,074 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 639 transitions. [2022-02-20 19:56:58,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:56:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 639 transitions. [2022-02-20 19:56:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:58,078 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:58,078 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 19:56:58,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:56:58,078 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1171288519, now seen corresponding path program 1 times [2022-02-20 19:56:58,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:58,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751161642] [2022-02-20 19:56:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {7879#(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); {7840#true} is VALID [2022-02-20 19:56:58,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7840#true} {7840#true} #905#return; {7840#true} is VALID [2022-02-20 19:56:58,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {7880#(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); {7840#true} is VALID [2022-02-20 19:56:58,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume !(0 == ~q_write_ev~0); {7840#true} is VALID [2022-02-20 19:56:58,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7840#true} {7840#true} #907#return; {7840#true} is VALID [2022-02-20 19:56:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {7840#true} havoc ~__retres1~0; {7840#true} is VALID [2022-02-20 19:56:58,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume !(1 == ~p_dw_pc~0); {7840#true} is VALID [2022-02-20 19:56:58,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} ~__retres1~0 := 0; {7840#true} is VALID [2022-02-20 19:56:58,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {7840#true} #res := ~__retres1~0; {7840#true} is VALID [2022-02-20 19:56:58,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,237 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7840#true} {7840#true} #901#return; {7840#true} is VALID [2022-02-20 19:56:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {7840#true} havoc ~__retres1~1; {7840#true} is VALID [2022-02-20 19:56:58,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume !(1 == ~c_dr_pc~0); {7840#true} is VALID [2022-02-20 19:56:58,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} ~__retres1~1 := 0; {7896#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:58,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {7896#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:58,290 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7840#true} #903#return; {7894#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#(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; {7840#true} is VALID [2022-02-20 19:56:58,291 INFO L272 TraceCheckUtils]: 1: Hoare triple {7840#true} call #t~ret8 := is_do_write_p_triggered(); {7840#true} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} havoc ~__retres1~0; {7840#true} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {7840#true} assume !(1 == ~p_dw_pc~0); {7840#true} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {7840#true} ~__retres1~0 := 0; {7840#true} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {7840#true} #res := ~__retres1~0; {7840#true} is VALID [2022-02-20 19:56:58,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,293 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7840#true} {7840#true} #901#return; {7840#true} is VALID [2022-02-20 19:56:58,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {7840#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7840#true} is VALID [2022-02-20 19:56:58,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {7840#true} assume !(0 != ~tmp~1); {7840#true} is VALID [2022-02-20 19:56:58,296 INFO L272 TraceCheckUtils]: 10: Hoare triple {7840#true} call #t~ret9 := is_do_read_c_triggered(); {7840#true} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {7840#true} havoc ~__retres1~1; {7840#true} is VALID [2022-02-20 19:56:58,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {7840#true} assume !(1 == ~c_dr_pc~0); {7840#true} is VALID [2022-02-20 19:56:58,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {7840#true} ~__retres1~1 := 0; {7896#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:58,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {7896#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:58,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:58,301 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7840#true} #903#return; {7894#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:58,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {7894#(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; {7895#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:58,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {7895#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7841#false} is VALID [2022-02-20 19:56:58,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {7841#false} assume true; {7841#false} is VALID [2022-02-20 19:56:58,303 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7841#false} {7840#true} #909#return; {7841#false} is VALID [2022-02-20 19:56:58,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {7880#(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); {7840#true} is VALID [2022-02-20 19:56:58,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7840#true} is VALID [2022-02-20 19:56:58,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7840#true} {7841#false} #911#return; {7841#false} is VALID [2022-02-20 19:56:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {7840#true} havoc ~__retres1~2; {7840#true} is VALID [2022-02-20 19:56:58,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7840#true} is VALID [2022-02-20 19:56:58,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} #res := ~__retres1~2; {7840#true} is VALID [2022-02-20 19:56:58,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,318 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7840#true} {7841#false} #913#return; {7841#false} is VALID [2022-02-20 19:56:58,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {7840#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {7840#true} is VALID [2022-02-20 19:56:58,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {7840#true} is VALID [2022-02-20 19:56:58,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {7840#true} is VALID [2022-02-20 19:56:58,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {7840#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {7840#true} is VALID [2022-02-20 19:56:58,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {7840#true} call update_channels1(); {7879#(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 19:56:58,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {7879#(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); {7840#true} is VALID [2022-02-20 19:56:58,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,323 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7840#true} {7840#true} #905#return; {7840#true} is VALID [2022-02-20 19:56:58,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {7840#true} assume { :begin_inline_init_threads1 } true; {7840#true} is VALID [2022-02-20 19:56:58,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {7840#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7840#true} is VALID [2022-02-20 19:56:58,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {7840#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7840#true} is VALID [2022-02-20 19:56:58,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {7840#true} assume { :end_inline_init_threads1 } true; {7840#true} is VALID [2022-02-20 19:56:58,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {7840#true} call fire_delta_events1(); {7880#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:58,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {7880#(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); {7840#true} is VALID [2022-02-20 19:56:58,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {7840#true} assume !(0 == ~q_write_ev~0); {7840#true} is VALID [2022-02-20 19:56:58,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,325 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7840#true} {7840#true} #907#return; {7840#true} is VALID [2022-02-20 19:56:58,325 INFO L272 TraceCheckUtils]: 17: Hoare triple {7840#true} call activate_threads1(); {7881#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:58,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {7881#(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; {7840#true} is VALID [2022-02-20 19:56:58,325 INFO L272 TraceCheckUtils]: 19: Hoare triple {7840#true} call #t~ret8 := is_do_write_p_triggered(); {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {7840#true} havoc ~__retres1~0; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {7840#true} assume !(1 == ~p_dw_pc~0); {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {7840#true} ~__retres1~0 := 0; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {7840#true} #res := ~__retres1~0; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7840#true} {7840#true} #901#return; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {7840#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {7840#true} assume !(0 != ~tmp~1); {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L272 TraceCheckUtils]: 28: Hoare triple {7840#true} call #t~ret9 := is_do_read_c_triggered(); {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {7840#true} havoc ~__retres1~1; {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {7840#true} assume !(1 == ~c_dr_pc~0); {7840#true} is VALID [2022-02-20 19:56:58,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {7840#true} ~__retres1~1 := 0; {7896#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:58,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {7896#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:58,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:58,328 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7897#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7840#true} #903#return; {7894#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:58,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {7894#(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; {7895#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:58,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {7895#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7841#false} is VALID [2022-02-20 19:56:58,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {7841#false} assume true; {7841#false} is VALID [2022-02-20 19:56:58,330 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7841#false} {7840#true} #909#return; {7841#false} is VALID [2022-02-20 19:56:58,330 INFO L272 TraceCheckUtils]: 39: Hoare triple {7841#false} call reset_delta_events1(); {7880#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:58,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {7880#(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); {7840#true} is VALID [2022-02-20 19:56:58,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {7840#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7840#true} is VALID [2022-02-20 19:56:58,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,332 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7840#true} {7841#false} #911#return; {7841#false} is VALID [2022-02-20 19:56:58,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-02-20 19:56:58,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {7841#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; {7841#false} is VALID [2022-02-20 19:56:58,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-02-20 19:56:58,334 INFO L272 TraceCheckUtils]: 47: Hoare triple {7841#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7840#true} is VALID [2022-02-20 19:56:58,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {7840#true} havoc ~__retres1~2; {7840#true} is VALID [2022-02-20 19:56:58,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {7840#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7840#true} is VALID [2022-02-20 19:56:58,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {7840#true} #res := ~__retres1~2; {7840#true} is VALID [2022-02-20 19:56:58,334 INFO L290 TraceCheckUtils]: 51: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-02-20 19:56:58,334 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7840#true} {7841#false} #913#return; {7841#false} is VALID [2022-02-20 19:56:58,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {7841#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; {7841#false} is VALID [2022-02-20 19:56:58,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {7841#false} assume 0 != eval1_~tmp___1~0#1; {7841#false} is VALID [2022-02-20 19:56:58,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {7841#false} assume !(0 == ~p_dw_st~0); {7841#false} is VALID [2022-02-20 19:56:58,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {7841#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; {7841#false} is VALID [2022-02-20 19:56:58,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {7841#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; {7841#false} is VALID [2022-02-20 19:56:58,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {7841#false} assume 0 == ~c_dr_pc~0; {7841#false} is VALID [2022-02-20 19:56:58,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-02-20 19:56:58,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {7841#false} assume !(1 == ~q_free~0); {7841#false} is VALID [2022-02-20 19:56:58,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {7841#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; {7841#false} is VALID [2022-02-20 19:56:58,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {7841#false} assume !(~p_last_write~0 == ~c_last_read~0); {7841#false} is VALID [2022-02-20 19:56:58,337 INFO L272 TraceCheckUtils]: 63: Hoare triple {7841#false} call error1(); {7841#false} is VALID [2022-02-20 19:56:58,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-02-20 19:56:58,339 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 19:56:58,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:58,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751161642] [2022-02-20 19:56:58,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751161642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:58,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:58,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:58,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064993601] [2022-02-20 19:56:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:58,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:56:58,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:58,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:56:58,381 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 19:56:58,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:58,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:58,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:58,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:58,383 INFO L87 Difference]: Start difference. First operand 452 states and 639 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,807 INFO L93 Difference]: Finished difference Result 770 states and 1072 transitions. [2022-02-20 19:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:00,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 530 transitions. [2022-02-20 19:57:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 530 transitions. [2022-02-20 19:57:00,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 530 transitions. [2022-02-20 19:57:01,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:01,245 INFO L225 Difference]: With dead ends: 770 [2022-02-20 19:57:01,246 INFO L226 Difference]: Without dead ends: 498 [2022-02-20 19:57:01,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:01,248 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 432 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:01,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1468 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-20 19:57:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 467. [2022-02-20 19:57:01,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:01,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:57:01,276 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:57:01,277 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:57:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,293 INFO L93 Difference]: Finished difference Result 498 states and 698 transitions. [2022-02-20 19:57:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 698 transitions. [2022-02-20 19:57:01,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:01,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:01,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) Second operand 498 states. [2022-02-20 19:57:01,298 INFO L87 Difference]: Start difference. First operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) Second operand 498 states. [2022-02-20 19:57:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,315 INFO L93 Difference]: Finished difference Result 498 states and 698 transitions. [2022-02-20 19:57:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 698 transitions. [2022-02-20 19:57:01,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:01,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:01,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:01,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:57:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-02-20 19:57:01,336 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 65 [2022-02-20 19:57:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:01,336 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-02-20 19:57:01,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:57:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-02-20 19:57:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:01,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:01,338 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 19:57:01,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:01,338 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 214914875, now seen corresponding path program 1 times [2022-02-20 19:57:01,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:01,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964717634] [2022-02-20 19:57:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {10628#(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); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #905#return; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {10629#(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); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {10629#(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); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #907#return; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {10588#true} havoc ~__retres1~0; {10588#true} is VALID [2022-02-20 19:57:01,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {10588#true} assume !(1 == ~p_dw_pc~0); {10588#true} is VALID [2022-02-20 19:57:01,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {10588#true} ~__retres1~0 := 0; {10588#true} is VALID [2022-02-20 19:57:01,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {10588#true} #res := ~__retres1~0; {10588#true} is VALID [2022-02-20 19:57:01,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,455 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10588#true} {10588#true} #901#return; {10588#true} is VALID [2022-02-20 19:57:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {10588#true} havoc ~__retres1~1; {10588#true} is VALID [2022-02-20 19:57:01,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {10588#true} assume !(1 == ~c_dr_pc~0); {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {10588#true} ~__retres1~1 := 0; {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {10588#true} #res := ~__retres1~1; {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10588#true} {10588#true} #903#return; {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {10630#(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; {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L272 TraceCheckUtils]: 1: Hoare triple {10588#true} call #t~ret8 := is_do_write_p_triggered(); {10588#true} is VALID [2022-02-20 19:57:01,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {10588#true} havoc ~__retres1~0; {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {10588#true} assume !(1 == ~p_dw_pc~0); {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {10588#true} ~__retres1~0 := 0; {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {10588#true} #res := ~__retres1~0; {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10588#true} {10588#true} #901#return; {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {10588#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10588#true} is VALID [2022-02-20 19:57:01,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {10588#true} assume !(0 != ~tmp~1); {10588#true} is VALID [2022-02-20 19:57:01,461 INFO L272 TraceCheckUtils]: 10: Hoare triple {10588#true} call #t~ret9 := is_do_read_c_triggered(); {10588#true} is VALID [2022-02-20 19:57:01,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {10588#true} havoc ~__retres1~1; {10588#true} is VALID [2022-02-20 19:57:01,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {10588#true} assume !(1 == ~c_dr_pc~0); {10588#true} is VALID [2022-02-20 19:57:01,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {10588#true} ~__retres1~1 := 0; {10588#true} is VALID [2022-02-20 19:57:01,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {10588#true} #res := ~__retres1~1; {10588#true} is VALID [2022-02-20 19:57:01,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,462 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10588#true} {10588#true} #903#return; {10588#true} is VALID [2022-02-20 19:57:01,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {10588#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10588#true} is VALID [2022-02-20 19:57:01,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {10588#true} assume !(0 != ~tmp___0~1); {10588#true} is VALID [2022-02-20 19:57:01,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,463 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10588#true} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #909#return; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {10629#(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); {10643#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:01,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {10643#(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; {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #911#return; {10589#false} is VALID [2022-02-20 19:57:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {10588#true} havoc ~__retres1~2; {10588#true} is VALID [2022-02-20 19:57:01,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {10588#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10588#true} is VALID [2022-02-20 19:57:01,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {10588#true} #res := ~__retres1~2; {10588#true} is VALID [2022-02-20 19:57:01,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,496 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10588#true} {10589#false} #913#return; {10589#false} is VALID [2022-02-20 19:57:01,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {10588#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {10588#true} is VALID [2022-02-20 19:57:01,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {10588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {10588#true} is VALID [2022-02-20 19:57:01,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {10588#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {10590#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {10628#(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 19:57:01,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {10628#(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); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,501 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #905#return; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,503 INFO L272 TraceCheckUtils]: 12: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {10629#(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); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {10629#(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); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #907#return; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,505 INFO L272 TraceCheckUtils]: 17: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {10630#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:01,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {10630#(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; {10588#true} is VALID [2022-02-20 19:57:01,505 INFO L272 TraceCheckUtils]: 19: Hoare triple {10588#true} call #t~ret8 := is_do_write_p_triggered(); {10588#true} is VALID [2022-02-20 19:57:01,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {10588#true} havoc ~__retres1~0; {10588#true} is VALID [2022-02-20 19:57:01,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {10588#true} assume !(1 == ~p_dw_pc~0); {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {10588#true} ~__retres1~0 := 0; {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {10588#true} #res := ~__retres1~0; {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10588#true} {10588#true} #901#return; {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {10588#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {10588#true} assume !(0 != ~tmp~1); {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L272 TraceCheckUtils]: 28: Hoare triple {10588#true} call #t~ret9 := is_do_read_c_triggered(); {10588#true} is VALID [2022-02-20 19:57:01,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {10588#true} havoc ~__retres1~1; {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {10588#true} assume !(1 == ~c_dr_pc~0); {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {10588#true} ~__retres1~1 := 0; {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {10588#true} #res := ~__retres1~1; {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10588#true} {10588#true} #903#return; {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {10588#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10588#true} is VALID [2022-02-20 19:57:01,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {10588#true} assume !(0 != ~tmp___0~1); {10588#true} is VALID [2022-02-20 19:57:01,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,508 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10588#true} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #909#return; {10590#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,509 INFO L272 TraceCheckUtils]: 39: Hoare triple {10590#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {10629#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:01,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {10629#(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); {10643#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:01,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {10643#(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; {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,510 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10644#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {10590#(= ~q_write_ev~0 ~q_read_ev~0)} #911#return; {10589#false} is VALID [2022-02-20 19:57:01,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {10589#false} assume !false; {10589#false} is VALID [2022-02-20 19:57:01,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {10589#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; {10589#false} is VALID [2022-02-20 19:57:01,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {10589#false} assume !false; {10589#false} is VALID [2022-02-20 19:57:01,511 INFO L272 TraceCheckUtils]: 47: Hoare triple {10589#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10588#true} is VALID [2022-02-20 19:57:01,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {10588#true} havoc ~__retres1~2; {10588#true} is VALID [2022-02-20 19:57:01,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {10588#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10588#true} is VALID [2022-02-20 19:57:01,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {10588#true} #res := ~__retres1~2; {10588#true} is VALID [2022-02-20 19:57:01,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {10588#true} assume true; {10588#true} is VALID [2022-02-20 19:57:01,512 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10588#true} {10589#false} #913#return; {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {10589#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; {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {10589#false} assume 0 != eval1_~tmp___1~0#1; {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {10589#false} assume !(0 == ~p_dw_st~0); {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {10589#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; {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {10589#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; {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {10589#false} assume 0 == ~c_dr_pc~0; {10589#false} is VALID [2022-02-20 19:57:01,512 INFO L290 TraceCheckUtils]: 59: Hoare triple {10589#false} assume !false; {10589#false} is VALID [2022-02-20 19:57:01,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {10589#false} assume !(1 == ~q_free~0); {10589#false} is VALID [2022-02-20 19:57:01,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {10589#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; {10589#false} is VALID [2022-02-20 19:57:01,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {10589#false} assume !(~p_last_write~0 == ~c_last_read~0); {10589#false} is VALID [2022-02-20 19:57:01,513 INFO L272 TraceCheckUtils]: 63: Hoare triple {10589#false} call error1(); {10589#false} is VALID [2022-02-20 19:57:01,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {10589#false} assume !false; {10589#false} is VALID [2022-02-20 19:57:01,514 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 19:57:01,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:01,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964717634] [2022-02-20 19:57:01,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964717634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:01,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:01,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:01,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035812474] [2022-02-20 19:57:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:01,517 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 19:57:01,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:01,517 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 19:57:01,555 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 19:57:01,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:01,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:01,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:01,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:01,557 INFO L87 Difference]: Start difference. First operand 467 states and 654 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 19:57:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,190 INFO L93 Difference]: Finished difference Result 859 states and 1165 transitions. [2022-02-20 19:57:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:04,190 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 19:57:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:04,191 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 19:57:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 709 transitions. [2022-02-20 19:57:04,197 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 19:57:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 709 transitions. [2022-02-20 19:57:04,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 709 transitions. [2022-02-20 19:57:04,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:04,804 INFO L225 Difference]: With dead ends: 859 [2022-02-20 19:57:04,804 INFO L226 Difference]: Without dead ends: 574 [2022-02-20 19:57:04,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:57:04,806 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 723 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:04,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 1307 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-02-20 19:57:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 479. [2022-02-20 19:57:04,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:04,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:57:04,838 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:57:04,839 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:57:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,859 INFO L93 Difference]: Finished difference Result 574 states and 785 transitions. [2022-02-20 19:57:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 785 transitions. [2022-02-20 19:57:04,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:04,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) Second operand 574 states. [2022-02-20 19:57:04,863 INFO L87 Difference]: Start difference. First operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) Second operand 574 states. [2022-02-20 19:57:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,883 INFO L93 Difference]: Finished difference Result 574 states and 785 transitions. [2022-02-20 19:57:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 785 transitions. [2022-02-20 19:57:04,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:04,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:04,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:57:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 664 transitions. [2022-02-20 19:57:04,905 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 664 transitions. Word has length 65 [2022-02-20 19:57:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:04,905 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 664 transitions. [2022-02-20 19:57:04,905 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 19:57:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 664 transitions. [2022-02-20 19:57:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:04,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:04,907 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 19:57:04,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:04,907 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash 80901369, now seen corresponding path program 1 times [2022-02-20 19:57:04,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:04,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538237189] [2022-02-20 19:57:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {13661#(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); {13621#true} is VALID [2022-02-20 19:57:04,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:04,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13621#true} {13621#true} #905#return; {13621#true} is VALID [2022-02-20 19:57:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {13662#(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); {13621#true} is VALID [2022-02-20 19:57:04,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume !(0 == ~q_write_ev~0); {13621#true} is VALID [2022-02-20 19:57:04,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:04,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13626#(= ~p_dw_st~0 0)} #907#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {13621#true} havoc ~__retres1~0; {13621#true} is VALID [2022-02-20 19:57:05,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume !(1 == ~p_dw_pc~0); {13621#true} is VALID [2022-02-20 19:57:05,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} ~__retres1~0 := 0; {13621#true} is VALID [2022-02-20 19:57:05,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {13621#true} #res := ~__retres1~0; {13621#true} is VALID [2022-02-20 19:57:05,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,016 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13621#true} {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #901#return; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {13621#true} havoc ~__retres1~1; {13621#true} is VALID [2022-02-20 19:57:05,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume !(1 == ~c_dr_pc~0); {13621#true} is VALID [2022-02-20 19:57:05,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} ~__retres1~1 := 0; {13621#true} is VALID [2022-02-20 19:57:05,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {13621#true} #res := ~__retres1~1; {13621#true} is VALID [2022-02-20 19:57:05,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,024 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13621#true} {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #903#return; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {13663#(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; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,024 INFO L272 TraceCheckUtils]: 1: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {13621#true} is VALID [2022-02-20 19:57:05,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} havoc ~__retres1~0; {13621#true} is VALID [2022-02-20 19:57:05,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {13621#true} assume !(1 == ~p_dw_pc~0); {13621#true} is VALID [2022-02-20 19:57:05,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {13621#true} ~__retres1~0 := 0; {13621#true} is VALID [2022-02-20 19:57:05,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#true} #res := ~__retres1~0; {13621#true} is VALID [2022-02-20 19:57:05,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,026 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13621#true} {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #901#return; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,027 INFO L272 TraceCheckUtils]: 10: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {13621#true} is VALID [2022-02-20 19:57:05,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {13621#true} havoc ~__retres1~1; {13621#true} is VALID [2022-02-20 19:57:05,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {13621#true} assume !(1 == ~c_dr_pc~0); {13621#true} is VALID [2022-02-20 19:57:05,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {13621#true} ~__retres1~1 := 0; {13621#true} is VALID [2022-02-20 19:57:05,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {13621#true} #res := ~__retres1~1; {13621#true} is VALID [2022-02-20 19:57:05,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,028 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13621#true} {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #903#return; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,029 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {13626#(= ~p_dw_st~0 0)} #909#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {13662#(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); {13621#true} is VALID [2022-02-20 19:57:05,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume !(1 == ~q_write_ev~0); {13621#true} is VALID [2022-02-20 19:57:05,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13626#(= ~p_dw_st~0 0)} #911#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {13621#true} havoc ~__retres1~2; {13621#true} is VALID [2022-02-20 19:57:05,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {13626#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {13626#(= ~p_dw_st~0 0)} assume true; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,043 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13626#(= ~p_dw_st~0 0)} {13626#(= ~p_dw_st~0 0)} #913#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {13621#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {13621#true} is VALID [2022-02-20 19:57:05,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {13621#true} is VALID [2022-02-20 19:57:05,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {13621#true} is VALID [2022-02-20 19:57:05,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {13621#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {13621#true} is VALID [2022-02-20 19:57:05,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call update_channels1(); {13661#(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 19:57:05,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {13661#(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); {13621#true} is VALID [2022-02-20 19:57:05,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,045 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13621#true} {13621#true} #905#return; {13621#true} is VALID [2022-02-20 19:57:05,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {13621#true} assume { :begin_inline_init_threads1 } true; {13621#true} is VALID [2022-02-20 19:57:05,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {13621#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {13626#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {13626#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,047 INFO L272 TraceCheckUtils]: 12: Hoare triple {13626#(= ~p_dw_st~0 0)} call fire_delta_events1(); {13662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:05,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {13662#(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); {13621#true} is VALID [2022-02-20 19:57:05,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {13621#true} assume !(0 == ~q_write_ev~0); {13621#true} is VALID [2022-02-20 19:57:05,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,047 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13621#true} {13626#(= ~p_dw_st~0 0)} #907#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,048 INFO L272 TraceCheckUtils]: 17: Hoare triple {13626#(= ~p_dw_st~0 0)} call activate_threads1(); {13663#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:05,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {13663#(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; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {13621#true} is VALID [2022-02-20 19:57:05,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {13621#true} havoc ~__retres1~0; {13621#true} is VALID [2022-02-20 19:57:05,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {13621#true} assume !(1 == ~p_dw_pc~0); {13621#true} is VALID [2022-02-20 19:57:05,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {13621#true} ~__retres1~0 := 0; {13621#true} is VALID [2022-02-20 19:57:05,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {13621#true} #res := ~__retres1~0; {13621#true} is VALID [2022-02-20 19:57:05,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,049 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13621#true} {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #901#return; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,050 INFO L272 TraceCheckUtils]: 28: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {13621#true} is VALID [2022-02-20 19:57:05,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {13621#true} havoc ~__retres1~1; {13621#true} is VALID [2022-02-20 19:57:05,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {13621#true} assume !(1 == ~c_dr_pc~0); {13621#true} is VALID [2022-02-20 19:57:05,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {13621#true} ~__retres1~1 := 0; {13621#true} is VALID [2022-02-20 19:57:05,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {13621#true} #res := ~__retres1~1; {13621#true} is VALID [2022-02-20 19:57:05,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,051 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13621#true} {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #903#return; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:05,056 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13664#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {13626#(= ~p_dw_st~0 0)} #909#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,056 INFO L272 TraceCheckUtils]: 39: Hoare triple {13626#(= ~p_dw_st~0 0)} call reset_delta_events1(); {13662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:05,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {13662#(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); {13621#true} is VALID [2022-02-20 19:57:05,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {13621#true} assume !(1 == ~q_write_ev~0); {13621#true} is VALID [2022-02-20 19:57:05,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-02-20 19:57:05,057 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13621#true} {13626#(= ~p_dw_st~0 0)} #911#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {13626#(= ~p_dw_st~0 0)} assume !false; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {13626#(= ~p_dw_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; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {13626#(= ~p_dw_st~0 0)} assume !false; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,058 INFO L272 TraceCheckUtils]: 47: Hoare triple {13626#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13621#true} is VALID [2022-02-20 19:57:05,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {13621#true} havoc ~__retres1~2; {13621#true} is VALID [2022-02-20 19:57:05,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {13621#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {13626#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {13626#(= ~p_dw_st~0 0)} assume true; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,060 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13626#(= ~p_dw_st~0 0)} {13626#(= ~p_dw_st~0 0)} #913#return; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {13626#(= ~p_dw_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; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {13626#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {13626#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:05,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {13626#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {13622#false} is VALID [2022-02-20 19:57:05,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {13622#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; {13622#false} is VALID [2022-02-20 19:57:05,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {13622#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; {13622#false} is VALID [2022-02-20 19:57:05,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {13622#false} assume 0 == ~c_dr_pc~0; {13622#false} is VALID [2022-02-20 19:57:05,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-02-20 19:57:05,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {13622#false} assume !(1 == ~q_free~0); {13622#false} is VALID [2022-02-20 19:57:05,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {13622#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; {13622#false} is VALID [2022-02-20 19:57:05,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {13622#false} assume !(~p_last_write~0 == ~c_last_read~0); {13622#false} is VALID [2022-02-20 19:57:05,062 INFO L272 TraceCheckUtils]: 63: Hoare triple {13622#false} call error1(); {13622#false} is VALID [2022-02-20 19:57:05,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-02-20 19:57:05,062 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 19:57:05,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:05,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538237189] [2022-02-20 19:57:05,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538237189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:05,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:05,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:05,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275850465] [2022-02-20 19:57:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:05,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:05,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:05,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:05,103 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 19:57:05,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:05,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:05,104 INFO L87 Difference]: Start difference. First operand 479 states and 664 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,671 INFO L93 Difference]: Finished difference Result 1121 states and 1511 transitions. [2022-02-20 19:57:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 652 transitions. [2022-02-20 19:57:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 652 transitions. [2022-02-20 19:57:06,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 652 transitions. [2022-02-20 19:57:07,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 652 edges. 652 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:07,243 INFO L225 Difference]: With dead ends: 1121 [2022-02-20 19:57:07,244 INFO L226 Difference]: Without dead ends: 825 [2022-02-20 19:57:07,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:07,246 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 872 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:07,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 895 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-02-20 19:57:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 769. [2022-02-20 19:57:07,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:07,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 825 states. Second operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2022-02-20 19:57:07,308 INFO L74 IsIncluded]: Start isIncluded. First operand 825 states. Second operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2022-02-20 19:57:07,309 INFO L87 Difference]: Start difference. First operand 825 states. Second operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2022-02-20 19:57:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,346 INFO L93 Difference]: Finished difference Result 825 states and 1117 transitions. [2022-02-20 19:57:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1117 transitions. [2022-02-20 19:57:07,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) Second operand 825 states. [2022-02-20 19:57:07,352 INFO L87 Difference]: Start difference. First operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) Second operand 825 states. [2022-02-20 19:57:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,387 INFO L93 Difference]: Finished difference Result 825 states and 1117 transitions. [2022-02-20 19:57:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1117 transitions. [2022-02-20 19:57:07,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:07,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2022-02-20 19:57:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1043 transitions. [2022-02-20 19:57:07,432 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1043 transitions. Word has length 65 [2022-02-20 19:57:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:07,432 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1043 transitions. [2022-02-20 19:57:07,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:57:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1043 transitions. [2022-02-20 19:57:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:07,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:07,438 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 19:57:07,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:07,439 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1103860140, now seen corresponding path program 1 times [2022-02-20 19:57:07,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:07,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183674018] [2022-02-20 19:57:07,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {17940#(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); {17900#true} is VALID [2022-02-20 19:57:07,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #905#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {17941#(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); {17900#true} is VALID [2022-02-20 19:57:07,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume !(0 == ~q_write_ev~0); {17900#true} is VALID [2022-02-20 19:57:07,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #907#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {17900#true} havoc ~__retres1~0; {17900#true} is VALID [2022-02-20 19:57:07,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume !(1 == ~p_dw_pc~0); {17900#true} is VALID [2022-02-20 19:57:07,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} ~__retres1~0 := 0; {17900#true} is VALID [2022-02-20 19:57:07,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {17900#true} #res := ~__retres1~0; {17900#true} is VALID [2022-02-20 19:57:07,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,511 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17900#true} {17900#true} #901#return; {17900#true} is VALID [2022-02-20 19:57:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {17900#true} havoc ~__retres1~1; {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume !(1 == ~c_dr_pc~0); {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} ~__retres1~1 := 0; {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {17900#true} #res := ~__retres1~1; {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17900#true} {17900#true} #903#return; {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {17942#(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; {17900#true} is VALID [2022-02-20 19:57:07,515 INFO L272 TraceCheckUtils]: 1: Hoare triple {17900#true} call #t~ret8 := is_do_write_p_triggered(); {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} havoc ~__retres1~0; {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {17900#true} assume !(1 == ~p_dw_pc~0); {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {17900#true} ~__retres1~0 := 0; {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {17900#true} #res := ~__retres1~0; {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17900#true} {17900#true} #901#return; {17900#true} is VALID [2022-02-20 19:57:07,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {17900#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {17900#true} assume !(0 != ~tmp~1); {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L272 TraceCheckUtils]: 10: Hoare triple {17900#true} call #t~ret9 := is_do_read_c_triggered(); {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {17900#true} havoc ~__retres1~1; {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {17900#true} assume !(1 == ~c_dr_pc~0); {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {17900#true} ~__retres1~1 := 0; {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {17900#true} #res := ~__retres1~1; {17900#true} is VALID [2022-02-20 19:57:07,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,518 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17900#true} {17900#true} #903#return; {17900#true} is VALID [2022-02-20 19:57:07,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {17900#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17900#true} is VALID [2022-02-20 19:57:07,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {17900#true} assume !(0 != ~tmp___0~1); {17900#true} is VALID [2022-02-20 19:57:07,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,518 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #909#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {17941#(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); {17900#true} is VALID [2022-02-20 19:57:07,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume !(1 == ~q_write_ev~0); {17900#true} is VALID [2022-02-20 19:57:07,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #911#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {17900#true} havoc ~__retres1~2; {17900#true} is VALID [2022-02-20 19:57:07,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17900#true} is VALID [2022-02-20 19:57:07,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} #res := ~__retres1~2; {17900#true} is VALID [2022-02-20 19:57:07,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,528 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #913#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {17900#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {17900#true} is VALID [2022-02-20 19:57:07,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {17900#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {17900#true} is VALID [2022-02-20 19:57:07,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {17900#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {17902#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {17902#(= ~q_free~0 1)} call update_channels1(); {17940#(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 19:57:07,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {17940#(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); {17900#true} is VALID [2022-02-20 19:57:07,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,530 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #905#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {17902#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {17902#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {17902#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {17902#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {17902#(= ~q_free~0 1)} call fire_delta_events1(); {17941#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:07,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {17941#(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); {17900#true} is VALID [2022-02-20 19:57:07,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {17900#true} assume !(0 == ~q_write_ev~0); {17900#true} is VALID [2022-02-20 19:57:07,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,533 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #907#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,533 INFO L272 TraceCheckUtils]: 17: Hoare triple {17902#(= ~q_free~0 1)} call activate_threads1(); {17942#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:07,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {17942#(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; {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L272 TraceCheckUtils]: 19: Hoare triple {17900#true} call #t~ret8 := is_do_write_p_triggered(); {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {17900#true} havoc ~__retres1~0; {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {17900#true} assume !(1 == ~p_dw_pc~0); {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {17900#true} ~__retres1~0 := 0; {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {17900#true} #res := ~__retres1~0; {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,534 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17900#true} {17900#true} #901#return; {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {17900#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {17900#true} assume !(0 != ~tmp~1); {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L272 TraceCheckUtils]: 28: Hoare triple {17900#true} call #t~ret9 := is_do_read_c_triggered(); {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {17900#true} havoc ~__retres1~1; {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {17900#true} assume !(1 == ~c_dr_pc~0); {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {17900#true} ~__retres1~1 := 0; {17900#true} is VALID [2022-02-20 19:57:07,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {17900#true} #res := ~__retres1~1; {17900#true} is VALID [2022-02-20 19:57:07,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,536 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17900#true} {17900#true} #903#return; {17900#true} is VALID [2022-02-20 19:57:07,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {17900#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17900#true} is VALID [2022-02-20 19:57:07,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {17900#true} assume !(0 != ~tmp___0~1); {17900#true} is VALID [2022-02-20 19:57:07,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,537 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #909#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,537 INFO L272 TraceCheckUtils]: 39: Hoare triple {17902#(= ~q_free~0 1)} call reset_delta_events1(); {17941#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:07,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {17941#(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); {17900#true} is VALID [2022-02-20 19:57:07,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {17900#true} assume !(1 == ~q_write_ev~0); {17900#true} is VALID [2022-02-20 19:57:07,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,538 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #911#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {17902#(= ~q_free~0 1)} assume !false; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {17902#(= ~q_free~0 1)} 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; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {17902#(= ~q_free~0 1)} assume !false; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,539 INFO L272 TraceCheckUtils]: 47: Hoare triple {17902#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17900#true} is VALID [2022-02-20 19:57:07,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {17900#true} havoc ~__retres1~2; {17900#true} is VALID [2022-02-20 19:57:07,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {17900#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17900#true} is VALID [2022-02-20 19:57:07,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {17900#true} #res := ~__retres1~2; {17900#true} is VALID [2022-02-20 19:57:07,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {17900#true} assume true; {17900#true} is VALID [2022-02-20 19:57:07,540 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17900#true} {17902#(= ~q_free~0 1)} #913#return; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {17902#(= ~q_free~0 1)} 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; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {17902#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {17902#(= ~q_free~0 1)} 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; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {17902#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {17902#(= ~q_free~0 1)} 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; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {17902#(= ~q_free~0 1)} 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; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {17902#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,543 INFO L290 TraceCheckUtils]: 60: Hoare triple {17902#(= ~q_free~0 1)} assume !false; {17902#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:07,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {17902#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {17901#false} is VALID [2022-02-20 19:57:07,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {17901#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; {17901#false} is VALID [2022-02-20 19:57:07,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {17901#false} assume !(~p_last_write~0 == ~c_last_read~0); {17901#false} is VALID [2022-02-20 19:57:07,544 INFO L272 TraceCheckUtils]: 64: Hoare triple {17901#false} call error1(); {17901#false} is VALID [2022-02-20 19:57:07,544 INFO L290 TraceCheckUtils]: 65: Hoare triple {17901#false} assume !false; {17901#false} is VALID [2022-02-20 19:57:07,544 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 19:57:07,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:07,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183674018] [2022-02-20 19:57:07,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183674018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:07,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:07,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:07,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444955715] [2022-02-20 19:57:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:07,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:07,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:07,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:07,594 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 19:57:07,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:07,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:07,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:07,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:07,596 INFO L87 Difference]: Start difference. First operand 769 states and 1043 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,254 INFO L93 Difference]: Finished difference Result 1972 states and 2614 transitions. [2022-02-20 19:57:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 650 transitions. [2022-02-20 19:57:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 650 transitions. [2022-02-20 19:57:09,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 650 transitions. [2022-02-20 19:57:09,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 650 edges. 650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:09,837 INFO L225 Difference]: With dead ends: 1972 [2022-02-20 19:57:09,837 INFO L226 Difference]: Without dead ends: 1365 [2022-02-20 19:57:09,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:09,839 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 472 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:09,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 1011 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-02-20 19:57:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1250. [2022-02-20 19:57:09,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:09,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1365 states. Second operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2022-02-20 19:57:09,966 INFO L74 IsIncluded]: Start isIncluded. First operand 1365 states. Second operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2022-02-20 19:57:09,972 INFO L87 Difference]: Start difference. First operand 1365 states. Second operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2022-02-20 19:57:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,048 INFO L93 Difference]: Finished difference Result 1365 states and 1776 transitions. [2022-02-20 19:57:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1776 transitions. [2022-02-20 19:57:10,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:10,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:10,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) Second operand 1365 states. [2022-02-20 19:57:10,059 INFO L87 Difference]: Start difference. First operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) Second operand 1365 states. [2022-02-20 19:57:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,125 INFO L93 Difference]: Finished difference Result 1365 states and 1776 transitions. [2022-02-20 19:57:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1776 transitions. [2022-02-20 19:57:10,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:10,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:10,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:10,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2022-02-20 19:57:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1641 transitions. [2022-02-20 19:57:10,198 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1641 transitions. Word has length 66 [2022-02-20 19:57:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:10,199 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1641 transitions. [2022-02-20 19:57:10,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1641 transitions. [2022-02-20 19:57:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:10,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:10,200 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 19:57:10,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:10,201 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash 354379519, now seen corresponding path program 1 times [2022-02-20 19:57:10,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:10,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403837361] [2022-02-20 19:57:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:10,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {25060#(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); {25020#true} is VALID [2022-02-20 19:57:10,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #905#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {25061#(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); {25020#true} is VALID [2022-02-20 19:57:10,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume !(0 == ~q_write_ev~0); {25020#true} is VALID [2022-02-20 19:57:10,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #907#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {25020#true} havoc ~__retres1~0; {25020#true} is VALID [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume !(1 == ~p_dw_pc~0); {25020#true} is VALID [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} ~__retres1~0 := 0; {25020#true} is VALID [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {25020#true} #res := ~__retres1~0; {25020#true} is VALID [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,272 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25020#true} {25020#true} #901#return; {25020#true} is VALID [2022-02-20 19:57:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {25020#true} havoc ~__retres1~1; {25020#true} is VALID [2022-02-20 19:57:10,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume !(1 == ~c_dr_pc~0); {25020#true} is VALID [2022-02-20 19:57:10,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} ~__retres1~1 := 0; {25020#true} is VALID [2022-02-20 19:57:10,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {25020#true} #res := ~__retres1~1; {25020#true} is VALID [2022-02-20 19:57:10,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,277 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25020#true} {25020#true} #903#return; {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {25062#(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; {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L272 TraceCheckUtils]: 1: Hoare triple {25020#true} call #t~ret8 := is_do_write_p_triggered(); {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} havoc ~__retres1~0; {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {25020#true} assume !(1 == ~p_dw_pc~0); {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {25020#true} ~__retres1~0 := 0; {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {25020#true} #res := ~__retres1~0; {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,278 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25020#true} {25020#true} #901#return; {25020#true} is VALID [2022-02-20 19:57:10,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {25020#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25020#true} is VALID [2022-02-20 19:57:10,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {25020#true} assume !(0 != ~tmp~1); {25020#true} is VALID [2022-02-20 19:57:10,279 INFO L272 TraceCheckUtils]: 10: Hoare triple {25020#true} call #t~ret9 := is_do_read_c_triggered(); {25020#true} is VALID [2022-02-20 19:57:10,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {25020#true} havoc ~__retres1~1; {25020#true} is VALID [2022-02-20 19:57:10,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {25020#true} assume !(1 == ~c_dr_pc~0); {25020#true} is VALID [2022-02-20 19:57:10,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {25020#true} ~__retres1~1 := 0; {25020#true} is VALID [2022-02-20 19:57:10,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {25020#true} #res := ~__retres1~1; {25020#true} is VALID [2022-02-20 19:57:10,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,280 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25020#true} {25020#true} #903#return; {25020#true} is VALID [2022-02-20 19:57:10,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {25020#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25020#true} is VALID [2022-02-20 19:57:10,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {25020#true} assume !(0 != ~tmp___0~1); {25020#true} is VALID [2022-02-20 19:57:10,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,281 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #909#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {25061#(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); {25020#true} is VALID [2022-02-20 19:57:10,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume !(1 == ~q_write_ev~0); {25020#true} is VALID [2022-02-20 19:57:10,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #911#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {25020#true} havoc ~__retres1~2; {25020#true} is VALID [2022-02-20 19:57:10,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25020#true} is VALID [2022-02-20 19:57:10,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} #res := ~__retres1~2; {25020#true} is VALID [2022-02-20 19:57:10,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,291 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #913#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {25020#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {25020#true} is VALID [2022-02-20 19:57:10,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {25020#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {25020#true} is VALID [2022-02-20 19:57:10,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {25020#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {25022#(= ~c_dr_pc~0 0)} call update_channels1(); {25060#(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 19:57:10,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {25060#(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); {25020#true} is VALID [2022-02-20 19:57:10,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,293 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #905#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,295 INFO L272 TraceCheckUtils]: 12: Hoare triple {25022#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {25061#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:10,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {25061#(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); {25020#true} is VALID [2022-02-20 19:57:10,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {25020#true} assume !(0 == ~q_write_ev~0); {25020#true} is VALID [2022-02-20 19:57:10,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,296 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #907#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,296 INFO L272 TraceCheckUtils]: 17: Hoare triple {25022#(= ~c_dr_pc~0 0)} call activate_threads1(); {25062#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:10,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {25062#(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; {25020#true} is VALID [2022-02-20 19:57:10,297 INFO L272 TraceCheckUtils]: 19: Hoare triple {25020#true} call #t~ret8 := is_do_write_p_triggered(); {25020#true} is VALID [2022-02-20 19:57:10,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {25020#true} havoc ~__retres1~0; {25020#true} is VALID [2022-02-20 19:57:10,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {25020#true} assume !(1 == ~p_dw_pc~0); {25020#true} is VALID [2022-02-20 19:57:10,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {25020#true} ~__retres1~0 := 0; {25020#true} is VALID [2022-02-20 19:57:10,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {25020#true} #res := ~__retres1~0; {25020#true} is VALID [2022-02-20 19:57:10,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25020#true} {25020#true} #901#return; {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {25020#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {25020#true} assume !(0 != ~tmp~1); {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {25020#true} call #t~ret9 := is_do_read_c_triggered(); {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {25020#true} havoc ~__retres1~1; {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {25020#true} assume !(1 == ~c_dr_pc~0); {25020#true} is VALID [2022-02-20 19:57:10,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {25020#true} ~__retres1~1 := 0; {25020#true} is VALID [2022-02-20 19:57:10,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {25020#true} #res := ~__retres1~1; {25020#true} is VALID [2022-02-20 19:57:10,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,299 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25020#true} {25020#true} #903#return; {25020#true} is VALID [2022-02-20 19:57:10,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {25020#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25020#true} is VALID [2022-02-20 19:57:10,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {25020#true} assume !(0 != ~tmp___0~1); {25020#true} is VALID [2022-02-20 19:57:10,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,300 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #909#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,300 INFO L272 TraceCheckUtils]: 39: Hoare triple {25022#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {25061#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:10,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {25061#(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); {25020#true} is VALID [2022-02-20 19:57:10,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {25020#true} assume !(1 == ~q_write_ev~0); {25020#true} is VALID [2022-02-20 19:57:10,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,301 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #911#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume !false; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {25022#(= ~c_dr_pc~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; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume !false; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,302 INFO L272 TraceCheckUtils]: 47: Hoare triple {25022#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {25020#true} is VALID [2022-02-20 19:57:10,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {25020#true} havoc ~__retres1~2; {25020#true} is VALID [2022-02-20 19:57:10,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {25020#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25020#true} is VALID [2022-02-20 19:57:10,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {25020#true} #res := ~__retres1~2; {25020#true} is VALID [2022-02-20 19:57:10,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {25020#true} assume true; {25020#true} is VALID [2022-02-20 19:57:10,303 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25020#true} {25022#(= ~c_dr_pc~0 0)} #913#return; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {25022#(= ~c_dr_pc~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; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {25022#(= ~c_dr_pc~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; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {25022#(= ~c_dr_pc~0 0)} 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; {25022#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:10,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {25022#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {25021#false} is VALID [2022-02-20 19:57:10,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {25021#false} assume 1 == ~c_dr_pc~0; {25021#false} is VALID [2022-02-20 19:57:10,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {25021#false} do_read_c_~a~0#1 := ~a_t~0; {25021#false} is VALID [2022-02-20 19:57:10,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {25021#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; {25021#false} is VALID [2022-02-20 19:57:10,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {25021#false} assume !(~p_last_write~0 == ~c_last_read~0); {25021#false} is VALID [2022-02-20 19:57:10,306 INFO L272 TraceCheckUtils]: 64: Hoare triple {25021#false} call error1(); {25021#false} is VALID [2022-02-20 19:57:10,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {25021#false} assume !false; {25021#false} is VALID [2022-02-20 19:57:10,307 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 19:57:10,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:10,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403837361] [2022-02-20 19:57:10,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403837361] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:10,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:10,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:10,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88739538] [2022-02-20 19:57:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:10,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:10,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:10,356 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 19:57:10,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:10,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:10,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:10,358 INFO L87 Difference]: Start difference. First operand 1250 states and 1641 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,020 INFO L93 Difference]: Finished difference Result 3438 states and 4447 transitions. [2022-02-20 19:57:12,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:12,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 648 transitions. [2022-02-20 19:57:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 648 transitions. [2022-02-20 19:57:12,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 648 transitions. [2022-02-20 19:57:12,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:12,815 INFO L225 Difference]: With dead ends: 3438 [2022-02-20 19:57:12,815 INFO L226 Difference]: Without dead ends: 2370 [2022-02-20 19:57:12,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:57:12,818 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 873 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:12,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 728 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2022-02-20 19:57:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2112. [2022-02-20 19:57:12,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:13,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2370 states. Second operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2022-02-20 19:57:13,010 INFO L74 IsIncluded]: Start isIncluded. First operand 2370 states. Second operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2022-02-20 19:57:13,015 INFO L87 Difference]: Start difference. First operand 2370 states. Second operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2022-02-20 19:57:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,199 INFO L93 Difference]: Finished difference Result 2370 states and 3002 transitions. [2022-02-20 19:57:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3002 transitions. [2022-02-20 19:57:13,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) Second operand 2370 states. [2022-02-20 19:57:13,213 INFO L87 Difference]: Start difference. First operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) Second operand 2370 states. [2022-02-20 19:57:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,448 INFO L93 Difference]: Finished difference Result 2370 states and 3002 transitions. [2022-02-20 19:57:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3002 transitions. [2022-02-20 19:57:13,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:13,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2022-02-20 19:57:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2702 transitions. [2022-02-20 19:57:13,679 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2702 transitions. Word has length 66 [2022-02-20 19:57:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:13,679 INFO L470 AbstractCegarLoop]: Abstraction has 2112 states and 2702 transitions. [2022-02-20 19:57:13,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2702 transitions. [2022-02-20 19:57:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:13,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:13,683 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:13,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:13,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1353227277, now seen corresponding path program 1 times [2022-02-20 19:57:13,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:13,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30474171] [2022-02-20 19:57:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {37299#(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); {37259#true} is VALID [2022-02-20 19:57:13,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #905#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {37300#(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); {37259#true} is VALID [2022-02-20 19:57:13,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume !(0 == ~q_write_ev~0); {37259#true} is VALID [2022-02-20 19:57:13,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #907#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {37259#true} havoc ~__retres1~0; {37259#true} is VALID [2022-02-20 19:57:13,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume !(1 == ~p_dw_pc~0); {37259#true} is VALID [2022-02-20 19:57:13,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} ~__retres1~0 := 0; {37259#true} is VALID [2022-02-20 19:57:13,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {37259#true} #res := ~__retres1~0; {37259#true} is VALID [2022-02-20 19:57:13,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,747 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {37259#true} {37259#true} #901#return; {37259#true} is VALID [2022-02-20 19:57:13,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {37259#true} havoc ~__retres1~1; {37259#true} is VALID [2022-02-20 19:57:13,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume !(1 == ~c_dr_pc~0); {37259#true} is VALID [2022-02-20 19:57:13,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} ~__retres1~1 := 0; {37259#true} is VALID [2022-02-20 19:57:13,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {37259#true} #res := ~__retres1~1; {37259#true} is VALID [2022-02-20 19:57:13,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,750 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {37259#true} {37259#true} #903#return; {37259#true} is VALID [2022-02-20 19:57:13,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {37301#(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; {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L272 TraceCheckUtils]: 1: Hoare triple {37259#true} call #t~ret8 := is_do_write_p_triggered(); {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} havoc ~__retres1~0; {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {37259#true} assume !(1 == ~p_dw_pc~0); {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {37259#true} ~__retres1~0 := 0; {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {37259#true} #res := ~__retres1~0; {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,751 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37259#true} {37259#true} #901#return; {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {37259#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {37259#true} assume !(0 != ~tmp~1); {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L272 TraceCheckUtils]: 10: Hoare triple {37259#true} call #t~ret9 := is_do_read_c_triggered(); {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {37259#true} havoc ~__retres1~1; {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {37259#true} assume !(1 == ~c_dr_pc~0); {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {37259#true} ~__retres1~1 := 0; {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {37259#true} #res := ~__retres1~1; {37259#true} is VALID [2022-02-20 19:57:13,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,753 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37259#true} {37259#true} #903#return; {37259#true} is VALID [2022-02-20 19:57:13,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {37259#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {37259#true} is VALID [2022-02-20 19:57:13,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {37259#true} assume !(0 != ~tmp___0~1); {37259#true} is VALID [2022-02-20 19:57:13,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,753 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #909#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {37300#(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); {37259#true} is VALID [2022-02-20 19:57:13,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume !(1 == ~q_write_ev~0); {37259#true} is VALID [2022-02-20 19:57:13,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #911#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {37259#true} havoc ~__retres1~2; {37259#true} is VALID [2022-02-20 19:57:13,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {37259#true} is VALID [2022-02-20 19:57:13,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} #res := ~__retres1~2; {37259#true} is VALID [2022-02-20 19:57:13,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,762 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #913#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {37259#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {37259#true} is VALID [2022-02-20 19:57:13,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {37259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {37259#true} is VALID [2022-02-20 19:57:13,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {37259#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {37261#(= ~p_dw_pc~0 0)} call update_channels1(); {37299#(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 19:57:13,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {37299#(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); {37259#true} is VALID [2022-02-20 19:57:13,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,764 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #905#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {37261#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {37300#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:13,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {37300#(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); {37259#true} is VALID [2022-02-20 19:57:13,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {37259#true} assume !(0 == ~q_write_ev~0); {37259#true} is VALID [2022-02-20 19:57:13,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,766 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #907#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,767 INFO L272 TraceCheckUtils]: 17: Hoare triple {37261#(= ~p_dw_pc~0 0)} call activate_threads1(); {37301#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:13,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {37301#(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; {37259#true} is VALID [2022-02-20 19:57:13,767 INFO L272 TraceCheckUtils]: 19: Hoare triple {37259#true} call #t~ret8 := is_do_write_p_triggered(); {37259#true} is VALID [2022-02-20 19:57:13,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {37259#true} havoc ~__retres1~0; {37259#true} is VALID [2022-02-20 19:57:13,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {37259#true} assume !(1 == ~p_dw_pc~0); {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {37259#true} ~__retres1~0 := 0; {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {37259#true} #res := ~__retres1~0; {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37259#true} {37259#true} #901#return; {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {37259#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {37259#true} assume !(0 != ~tmp~1); {37259#true} is VALID [2022-02-20 19:57:13,768 INFO L272 TraceCheckUtils]: 28: Hoare triple {37259#true} call #t~ret9 := is_do_read_c_triggered(); {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {37259#true} havoc ~__retres1~1; {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {37259#true} assume !(1 == ~c_dr_pc~0); {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {37259#true} ~__retres1~1 := 0; {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {37259#true} #res := ~__retres1~1; {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {37259#true} {37259#true} #903#return; {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {37259#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {37259#true} is VALID [2022-02-20 19:57:13,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {37259#true} assume !(0 != ~tmp___0~1); {37259#true} is VALID [2022-02-20 19:57:13,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,770 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #909#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,770 INFO L272 TraceCheckUtils]: 39: Hoare triple {37261#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {37300#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:13,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {37300#(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); {37259#true} is VALID [2022-02-20 19:57:13,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {37259#true} assume !(1 == ~q_write_ev~0); {37259#true} is VALID [2022-02-20 19:57:13,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,771 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #911#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume !false; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {37261#(= ~p_dw_pc~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; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume !false; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,772 INFO L272 TraceCheckUtils]: 47: Hoare triple {37261#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {37259#true} is VALID [2022-02-20 19:57:13,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {37259#true} havoc ~__retres1~2; {37259#true} is VALID [2022-02-20 19:57:13,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {37259#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {37259#true} is VALID [2022-02-20 19:57:13,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {37259#true} #res := ~__retres1~2; {37259#true} is VALID [2022-02-20 19:57:13,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {37259#true} assume true; {37259#true} is VALID [2022-02-20 19:57:13,773 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37259#true} {37261#(= ~p_dw_pc~0 0)} #913#return; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {37261#(= ~p_dw_pc~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; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {37261#(= ~p_dw_pc~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; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {37261#(= ~p_dw_pc~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; {37261#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:13,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {37261#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {37260#false} is VALID [2022-02-20 19:57:13,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {37260#false} assume 1 == ~p_dw_pc~0; {37260#false} is VALID [2022-02-20 19:57:13,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {37260#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; {37260#false} is VALID [2022-02-20 19:57:13,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {37260#false} assume !false; {37260#false} is VALID [2022-02-20 19:57:13,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {37260#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {37260#false} assume { :end_inline_do_write_p } true; {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {37260#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; {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {37260#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; {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {37260#false} assume 0 == ~c_dr_pc~0; {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 66: Hoare triple {37260#false} assume !false; {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 67: Hoare triple {37260#false} assume !(1 == ~q_free~0); {37260#false} is VALID [2022-02-20 19:57:13,776 INFO L290 TraceCheckUtils]: 68: Hoare triple {37260#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; {37260#false} is VALID [2022-02-20 19:57:13,777 INFO L290 TraceCheckUtils]: 69: Hoare triple {37260#false} assume !(~p_last_write~0 == ~c_last_read~0); {37260#false} is VALID [2022-02-20 19:57:13,777 INFO L272 TraceCheckUtils]: 70: Hoare triple {37260#false} call error1(); {37260#false} is VALID [2022-02-20 19:57:13,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {37260#false} assume !false; {37260#false} is VALID [2022-02-20 19:57:13,777 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 19:57:13,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30474171] [2022-02-20 19:57:13,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30474171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:13,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:13,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:13,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887761189] [2022-02-20 19:57:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:13,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:57:13,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:13,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:13,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:13,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:13,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:13,824 INFO L87 Difference]: Start difference. First operand 2112 states and 2702 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,039 INFO L93 Difference]: Finished difference Result 5022 states and 6352 transitions. [2022-02-20 19:57:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:16,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:57:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 634 transitions. [2022-02-20 19:57:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 634 transitions. [2022-02-20 19:57:16,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 634 transitions. [2022-02-20 19:57:16,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:16,956 INFO L225 Difference]: With dead ends: 5022 [2022-02-20 19:57:16,956 INFO L226 Difference]: Without dead ends: 3092 [2022-02-20 19:57:16,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:16,960 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 854 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:16,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 764 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-02-20 19:57:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2844. [2022-02-20 19:57:17,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:17,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3092 states. Second operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2022-02-20 19:57:17,182 INFO L74 IsIncluded]: Start isIncluded. First operand 3092 states. Second operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2022-02-20 19:57:17,186 INFO L87 Difference]: Start difference. First operand 3092 states. Second operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2022-02-20 19:57:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:17,582 INFO L93 Difference]: Finished difference Result 3092 states and 3876 transitions. [2022-02-20 19:57:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3876 transitions. [2022-02-20 19:57:17,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:17,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:17,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) Second operand 3092 states. [2022-02-20 19:57:17,596 INFO L87 Difference]: Start difference. First operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) Second operand 3092 states. [2022-02-20 19:57:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,011 INFO L93 Difference]: Finished difference Result 3092 states and 3876 transitions. [2022-02-20 19:57:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3876 transitions. [2022-02-20 19:57:18,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:18,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:18,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:18,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2022-02-20 19:57:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3595 transitions. [2022-02-20 19:57:18,485 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3595 transitions. Word has length 72 [2022-02-20 19:57:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:18,485 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 3595 transitions. [2022-02-20 19:57:18,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3595 transitions. [2022-02-20 19:57:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:18,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:18,487 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:18,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:18,488 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:18,488 INFO L85 PathProgramCache]: Analyzing trace with hash 483330199, now seen corresponding path program 1 times [2022-02-20 19:57:18,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:18,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688213829] [2022-02-20 19:57:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {54107#(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); {54066#true} is VALID [2022-02-20 19:57:18,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54066#true} {54066#true} #905#return; {54066#true} is VALID [2022-02-20 19:57:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {54108#(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); {54066#true} is VALID [2022-02-20 19:57:18,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume !(0 == ~q_write_ev~0); {54066#true} is VALID [2022-02-20 19:57:18,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54066#true} {54066#true} #907#return; {54066#true} is VALID [2022-02-20 19:57:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {54066#true} havoc ~__retres1~0; {54066#true} is VALID [2022-02-20 19:57:18,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume !(1 == ~p_dw_pc~0); {54066#true} is VALID [2022-02-20 19:57:18,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} ~__retres1~0 := 0; {54066#true} is VALID [2022-02-20 19:57:18,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {54066#true} #res := ~__retres1~0; {54066#true} is VALID [2022-02-20 19:57:18,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,576 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {54066#true} {54066#true} #901#return; {54066#true} is VALID [2022-02-20 19:57:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {54066#true} havoc ~__retres1~1; {54066#true} is VALID [2022-02-20 19:57:18,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume !(1 == ~c_dr_pc~0); {54066#true} is VALID [2022-02-20 19:57:18,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} ~__retres1~1 := 0; {54066#true} is VALID [2022-02-20 19:57:18,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {54066#true} #res := ~__retres1~1; {54066#true} is VALID [2022-02-20 19:57:18,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,580 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {54066#true} {54066#true} #903#return; {54066#true} is VALID [2022-02-20 19:57:18,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {54109#(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; {54066#true} is VALID [2022-02-20 19:57:18,580 INFO L272 TraceCheckUtils]: 1: Hoare triple {54066#true} call #t~ret8 := is_do_write_p_triggered(); {54066#true} is VALID [2022-02-20 19:57:18,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} havoc ~__retres1~0; {54066#true} is VALID [2022-02-20 19:57:18,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {54066#true} assume !(1 == ~p_dw_pc~0); {54066#true} is VALID [2022-02-20 19:57:18,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {54066#true} ~__retres1~0 := 0; {54066#true} is VALID [2022-02-20 19:57:18,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {54066#true} #res := ~__retres1~0; {54066#true} is VALID [2022-02-20 19:57:18,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,581 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {54066#true} {54066#true} #901#return; {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {54066#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {54066#true} assume !(0 != ~tmp~1); {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L272 TraceCheckUtils]: 10: Hoare triple {54066#true} call #t~ret9 := is_do_read_c_triggered(); {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {54066#true} havoc ~__retres1~1; {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {54066#true} assume !(1 == ~c_dr_pc~0); {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {54066#true} ~__retres1~1 := 0; {54066#true} is VALID [2022-02-20 19:57:18,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {54066#true} #res := ~__retres1~1; {54066#true} is VALID [2022-02-20 19:57:18,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,583 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {54066#true} {54066#true} #903#return; {54066#true} is VALID [2022-02-20 19:57:18,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {54066#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54066#true} is VALID [2022-02-20 19:57:18,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {54066#true} assume !(0 != ~tmp___0~1); {54066#true} is VALID [2022-02-20 19:57:18,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,583 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {54066#true} {54066#true} #909#return; {54066#true} is VALID [2022-02-20 19:57:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {54108#(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); {54066#true} is VALID [2022-02-20 19:57:18,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume !(1 == ~q_write_ev~0); {54066#true} is VALID [2022-02-20 19:57:18,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54066#true} {54066#true} #911#return; {54066#true} is VALID [2022-02-20 19:57:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {54066#true} havoc ~__retres1~2; {54066#true} is VALID [2022-02-20 19:57:18,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54066#true} is VALID [2022-02-20 19:57:18,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} #res := ~__retres1~2; {54066#true} is VALID [2022-02-20 19:57:18,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,602 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {54066#true} {54066#true} #913#return; {54066#true} is VALID [2022-02-20 19:57:18,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {54066#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {54066#true} is VALID [2022-02-20 19:57:18,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {54066#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {54066#true} is VALID [2022-02-20 19:57:18,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {54066#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {54066#true} is VALID [2022-02-20 19:57:18,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {54066#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {54066#true} is VALID [2022-02-20 19:57:18,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {54066#true} call update_channels1(); {54107#(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 19:57:18,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {54107#(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); {54066#true} is VALID [2022-02-20 19:57:18,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,604 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {54066#true} {54066#true} #905#return; {54066#true} is VALID [2022-02-20 19:57:18,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {54066#true} assume { :begin_inline_init_threads1 } true; {54066#true} is VALID [2022-02-20 19:57:18,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {54066#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {54066#true} is VALID [2022-02-20 19:57:18,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {54066#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {54066#true} is VALID [2022-02-20 19:57:18,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {54066#true} assume { :end_inline_init_threads1 } true; {54066#true} is VALID [2022-02-20 19:57:18,605 INFO L272 TraceCheckUtils]: 12: Hoare triple {54066#true} call fire_delta_events1(); {54108#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:18,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {54108#(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); {54066#true} is VALID [2022-02-20 19:57:18,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {54066#true} assume !(0 == ~q_write_ev~0); {54066#true} is VALID [2022-02-20 19:57:18,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,606 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {54066#true} {54066#true} #907#return; {54066#true} is VALID [2022-02-20 19:57:18,606 INFO L272 TraceCheckUtils]: 17: Hoare triple {54066#true} call activate_threads1(); {54109#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:18,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {54109#(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; {54066#true} is VALID [2022-02-20 19:57:18,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {54066#true} call #t~ret8 := is_do_write_p_triggered(); {54066#true} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {54066#true} havoc ~__retres1~0; {54066#true} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {54066#true} assume !(1 == ~p_dw_pc~0); {54066#true} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {54066#true} ~__retres1~0 := 0; {54066#true} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {54066#true} #res := ~__retres1~0; {54066#true} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {54066#true} {54066#true} #901#return; {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {54066#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {54066#true} assume !(0 != ~tmp~1); {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L272 TraceCheckUtils]: 28: Hoare triple {54066#true} call #t~ret9 := is_do_read_c_triggered(); {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {54066#true} havoc ~__retres1~1; {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {54066#true} assume !(1 == ~c_dr_pc~0); {54066#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {54066#true} ~__retres1~1 := 0; {54066#true} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {54066#true} #res := ~__retres1~1; {54066#true} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,609 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {54066#true} {54066#true} #903#return; {54066#true} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {54066#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54066#true} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {54066#true} assume !(0 != ~tmp___0~1); {54066#true} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,610 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {54066#true} {54066#true} #909#return; {54066#true} is VALID [2022-02-20 19:57:18,610 INFO L272 TraceCheckUtils]: 39: Hoare triple {54066#true} call reset_delta_events1(); {54108#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:18,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {54108#(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); {54066#true} is VALID [2022-02-20 19:57:18,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {54066#true} assume !(1 == ~q_write_ev~0); {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {54066#true} {54066#true} #911#return; {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {54066#true} assume !false; {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {54066#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {54066#true} assume !false; {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L272 TraceCheckUtils]: 47: Hoare triple {54066#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {54066#true} is VALID [2022-02-20 19:57:18,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {54066#true} havoc ~__retres1~2; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {54066#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {54066#true} #res := ~__retres1~2; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {54066#true} assume true; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {54066#true} {54066#true} #913#return; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {54066#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {54066#true} assume 0 != eval1_~tmp___1~0#1; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {54066#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {54066#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {54066#true} assume 0 == ~p_dw_pc~0; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {54066#true} assume !false; {54066#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {54066#true} assume !(0 == ~q_free~0); {54066#true} is VALID [2022-02-20 19:57:18,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {54066#true} 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; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 65: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} 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; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 67: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {54105#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 69: Hoare triple {54105#(= ~p_last_write~0 ~q_buf_0~0)} 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; {54106#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {54106#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {54067#false} is VALID [2022-02-20 19:57:18,616 INFO L272 TraceCheckUtils]: 71: Hoare triple {54067#false} call error1(); {54067#false} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {54067#false} assume !false; {54067#false} is VALID [2022-02-20 19:57:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:18,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:18,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688213829] [2022-02-20 19:57:18,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688213829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:18,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:18,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:18,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837629668] [2022-02-20 19:57:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:57:18,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:18,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:18,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:18,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:18,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:18,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:18,663 INFO L87 Difference]: Start difference. First operand 2844 states and 3595 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,031 INFO L93 Difference]: Finished difference Result 3618 states and 4526 transitions. [2022-02-20 19:57:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:57:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 517 transitions. [2022-02-20 19:57:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 517 transitions. [2022-02-20 19:57:21,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 517 transitions. [2022-02-20 19:57:21,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:21,904 INFO L225 Difference]: With dead ends: 3618 [2022-02-20 19:57:21,904 INFO L226 Difference]: Without dead ends: 3615 [2022-02-20 19:57:21,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:21,906 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 1051 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:21,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 913 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:57:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2022-02-20 19:57:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3338. [2022-02-20 19:57:22,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:22,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3615 states. Second operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2022-02-20 19:57:22,171 INFO L74 IsIncluded]: Start isIncluded. First operand 3615 states. Second operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2022-02-20 19:57:22,175 INFO L87 Difference]: Start difference. First operand 3615 states. Second operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2022-02-20 19:57:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,637 INFO L93 Difference]: Finished difference Result 3615 states and 4512 transitions. [2022-02-20 19:57:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4512 transitions. [2022-02-20 19:57:22,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:22,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:22,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) Second operand 3615 states. [2022-02-20 19:57:22,652 INFO L87 Difference]: Start difference. First operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) Second operand 3615 states. [2022-02-20 19:57:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,188 INFO L93 Difference]: Finished difference Result 3615 states and 4512 transitions. [2022-02-20 19:57:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4512 transitions. [2022-02-20 19:57:23,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:23,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:23,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:23,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2022-02-20 19:57:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4196 transitions. [2022-02-20 19:57:23,696 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4196 transitions. Word has length 73 [2022-02-20 19:57:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:23,696 INFO L470 AbstractCegarLoop]: Abstraction has 3338 states and 4196 transitions. [2022-02-20 19:57:23,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4196 transitions. [2022-02-20 19:57:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:57:23,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:23,699 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:23,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:23,699 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2097533117, now seen corresponding path program 1 times [2022-02-20 19:57:23,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:23,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693740531] [2022-02-20 19:57:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {70728#(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); {70686#true} is VALID [2022-02-20 19:57:23,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #905#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {70729#(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); {70686#true} is VALID [2022-02-20 19:57:23,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume !(0 == ~q_write_ev~0); {70686#true} is VALID [2022-02-20 19:57:23,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #907#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {70686#true} havoc ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:23,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume !(1 == ~p_dw_pc~0); {70686#true} is VALID [2022-02-20 19:57:23,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} ~__retres1~0 := 0; {70686#true} is VALID [2022-02-20 19:57:23,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {70686#true} #res := ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:23,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,835 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {70686#true} {70686#true} #901#return; {70686#true} is VALID [2022-02-20 19:57:23,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {70686#true} havoc ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:23,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume !(1 == ~c_dr_pc~0); {70686#true} is VALID [2022-02-20 19:57:23,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} ~__retres1~1 := 0; {70686#true} is VALID [2022-02-20 19:57:23,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {70686#true} #res := ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:23,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,842 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {70686#true} {70686#true} #903#return; {70686#true} is VALID [2022-02-20 19:57:23,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {70730#(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; {70686#true} is VALID [2022-02-20 19:57:23,842 INFO L272 TraceCheckUtils]: 1: Hoare triple {70686#true} call #t~ret8 := is_do_write_p_triggered(); {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} havoc ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {70686#true} assume !(1 == ~p_dw_pc~0); {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {70686#true} ~__retres1~0 := 0; {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {70686#true} #res := ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70686#true} {70686#true} #901#return; {70686#true} is VALID [2022-02-20 19:57:23,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {70686#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70686#true} is VALID [2022-02-20 19:57:23,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {70686#true} assume !(0 != ~tmp~1); {70686#true} is VALID [2022-02-20 19:57:23,844 INFO L272 TraceCheckUtils]: 10: Hoare triple {70686#true} call #t~ret9 := is_do_read_c_triggered(); {70686#true} is VALID [2022-02-20 19:57:23,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {70686#true} havoc ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:23,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {70686#true} assume !(1 == ~c_dr_pc~0); {70686#true} is VALID [2022-02-20 19:57:23,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {70686#true} ~__retres1~1 := 0; {70686#true} is VALID [2022-02-20 19:57:23,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {70686#true} #res := ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:23,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,845 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70686#true} {70686#true} #903#return; {70686#true} is VALID [2022-02-20 19:57:23,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {70686#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70686#true} is VALID [2022-02-20 19:57:23,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {70686#true} assume !(0 != ~tmp___0~1); {70686#true} is VALID [2022-02-20 19:57:23,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,846 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #909#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {70729#(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); {70686#true} is VALID [2022-02-20 19:57:23,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume !(1 == ~q_write_ev~0); {70686#true} is VALID [2022-02-20 19:57:23,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #911#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {70686#true} havoc ~__retres1~2; {70686#true} is VALID [2022-02-20 19:57:23,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70686#true} is VALID [2022-02-20 19:57:23,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} #res := ~__retres1~2; {70686#true} is VALID [2022-02-20 19:57:23,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,859 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #913#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {70686#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {70686#true} is VALID [2022-02-20 19:57:23,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {70686#true} is VALID [2022-02-20 19:57:23,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {70728#(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 19:57:23,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {70728#(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); {70686#true} is VALID [2022-02-20 19:57:23,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,862 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #905#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {70729#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {70729#(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); {70686#true} is VALID [2022-02-20 19:57:23,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {70686#true} assume !(0 == ~q_write_ev~0); {70686#true} is VALID [2022-02-20 19:57:23,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,866 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #907#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,866 INFO L272 TraceCheckUtils]: 17: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {70730#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:23,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {70730#(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; {70686#true} is VALID [2022-02-20 19:57:23,866 INFO L272 TraceCheckUtils]: 19: Hoare triple {70686#true} call #t~ret8 := is_do_write_p_triggered(); {70686#true} is VALID [2022-02-20 19:57:23,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {70686#true} havoc ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:23,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {70686#true} assume !(1 == ~p_dw_pc~0); {70686#true} is VALID [2022-02-20 19:57:23,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {70686#true} ~__retres1~0 := 0; {70686#true} is VALID [2022-02-20 19:57:23,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {70686#true} #res := ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:23,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70686#true} {70686#true} #901#return; {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {70686#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {70686#true} assume !(0 != ~tmp~1); {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {70686#true} call #t~ret9 := is_do_read_c_triggered(); {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {70686#true} havoc ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {70686#true} assume !(1 == ~c_dr_pc~0); {70686#true} is VALID [2022-02-20 19:57:23,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {70686#true} ~__retres1~1 := 0; {70686#true} is VALID [2022-02-20 19:57:23,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {70686#true} #res := ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:23,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,869 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {70686#true} {70686#true} #903#return; {70686#true} is VALID [2022-02-20 19:57:23,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {70686#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70686#true} is VALID [2022-02-20 19:57:23,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {70686#true} assume !(0 != ~tmp___0~1); {70686#true} is VALID [2022-02-20 19:57:23,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,870 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #909#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,871 INFO L272 TraceCheckUtils]: 39: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {70729#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:23,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {70729#(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); {70686#true} is VALID [2022-02-20 19:57:23,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {70686#true} assume !(1 == ~q_write_ev~0); {70686#true} is VALID [2022-02-20 19:57:23,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,871 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #911#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,873 INFO L272 TraceCheckUtils]: 47: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70686#true} is VALID [2022-02-20 19:57:23,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {70686#true} havoc ~__retres1~2; {70686#true} is VALID [2022-02-20 19:57:23,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {70686#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70686#true} is VALID [2022-02-20 19:57:23,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {70686#true} #res := ~__retres1~2; {70686#true} is VALID [2022-02-20 19:57:23,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:23,874 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {70686#true} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #913#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:23,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:23,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:23,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:23,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {70687#false} is VALID [2022-02-20 19:57:23,883 INFO L272 TraceCheckUtils]: 72: Hoare triple {70687#false} call error1(); {70687#false} is VALID [2022-02-20 19:57:23,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {70687#false} assume !false; {70687#false} is VALID [2022-02-20 19:57:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:23,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:23,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693740531] [2022-02-20 19:57:23,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693740531] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:57:23,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209654568] [2022-02-20 19:57:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:57:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:23,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:57:23,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:57:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:57:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:57:24,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {70686#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {70686#true} is VALID [2022-02-20 19:57:24,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {70686#true} is VALID [2022-02-20 19:57:24,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,732 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #905#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,734 INFO L272 TraceCheckUtils]: 12: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,736 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #907#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,736 INFO L272 TraceCheckUtils]: 17: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,737 INFO L272 TraceCheckUtils]: 19: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,740 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #901#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,741 INFO L272 TraceCheckUtils]: 28: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,744 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #903#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,745 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #909#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,746 INFO L272 TraceCheckUtils]: 39: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,747 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #911#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,749 INFO L272 TraceCheckUtils]: 47: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,751 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #913#return; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,754 INFO L290 TraceCheckUtils]: 58: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,754 INFO L290 TraceCheckUtils]: 59: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:24,755 INFO L290 TraceCheckUtils]: 60: Hoare triple {70688#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,756 INFO L290 TraceCheckUtils]: 62: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {70726#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {70953#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {70953#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume ~p_last_write~0 == ~c_last_read~0; {70953#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:24,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {70953#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(~p_num_write~0 == ~c_num_read~0); {70687#false} is VALID [2022-02-20 19:57:24,760 INFO L272 TraceCheckUtils]: 72: Hoare triple {70687#false} call error1(); {70687#false} is VALID [2022-02-20 19:57:24,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {70687#false} assume !false; {70687#false} is VALID [2022-02-20 19:57:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:24,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:57:25,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {70687#false} assume !false; {70687#false} is VALID [2022-02-20 19:57:25,175 INFO L272 TraceCheckUtils]: 72: Hoare triple {70687#false} call error1(); {70687#false} is VALID [2022-02-20 19:57:25,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {70687#false} is VALID [2022-02-20 19:57:25,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,177 INFO L290 TraceCheckUtils]: 68: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,177 INFO L290 TraceCheckUtils]: 67: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume { :end_inline_do_write_p } true; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {70978#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:25,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp___1~0#1; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,184 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {70686#true} {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #913#return; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {70686#true} #res := ~__retres1~2; {70686#true} is VALID [2022-02-20 19:57:25,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {70686#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70686#true} is VALID [2022-02-20 19:57:25,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {70686#true} havoc ~__retres1~2; {70686#true} is VALID [2022-02-20 19:57:25,185 INFO L272 TraceCheckUtils]: 47: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70686#true} is VALID [2022-02-20 19:57:25,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,187 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70686#true} {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #911#return; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {70686#true} assume !(1 == ~q_write_ev~0); {70686#true} is VALID [2022-02-20 19:57:25,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {70686#true} assume !(1 == ~q_read_ev~0); {70686#true} is VALID [2022-02-20 19:57:25,187 INFO L272 TraceCheckUtils]: 39: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {70686#true} is VALID [2022-02-20 19:57:25,187 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70686#true} {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #909#return; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {70686#true} assume !(0 != ~tmp___0~1); {70686#true} is VALID [2022-02-20 19:57:25,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {70686#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70686#true} is VALID [2022-02-20 19:57:25,188 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {70686#true} {70686#true} #903#return; {70686#true} is VALID [2022-02-20 19:57:25,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {70686#true} #res := ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:25,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {70686#true} ~__retres1~1 := 0; {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {70686#true} assume !(1 == ~c_dr_pc~0); {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {70686#true} havoc ~__retres1~1; {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L272 TraceCheckUtils]: 28: Hoare triple {70686#true} call #t~ret9 := is_do_read_c_triggered(); {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {70686#true} assume !(0 != ~tmp~1); {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {70686#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70686#true} {70686#true} #901#return; {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {70686#true} #res := ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:25,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {70686#true} ~__retres1~0 := 0; {70686#true} is VALID [2022-02-20 19:57:25,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {70686#true} assume !(1 == ~p_dw_pc~0); {70686#true} is VALID [2022-02-20 19:57:25,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {70686#true} havoc ~__retres1~0; {70686#true} is VALID [2022-02-20 19:57:25,190 INFO L272 TraceCheckUtils]: 19: Hoare triple {70686#true} call #t~ret8 := is_do_write_p_triggered(); {70686#true} is VALID [2022-02-20 19:57:25,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {70686#true} havoc ~tmp~1;havoc ~tmp___0~1; {70686#true} is VALID [2022-02-20 19:57:25,190 INFO L272 TraceCheckUtils]: 17: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {70686#true} is VALID [2022-02-20 19:57:25,191 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70686#true} {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #907#return; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {70686#true} assume !(0 == ~q_write_ev~0); {70686#true} is VALID [2022-02-20 19:57:25,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {70686#true} assume !(0 == ~q_read_ev~0); {70686#true} is VALID [2022-02-20 19:57:25,191 INFO L272 TraceCheckUtils]: 12: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {70686#true} is VALID [2022-02-20 19:57:25,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,205 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70686#true} {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #905#return; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-02-20 19:57:25,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {70686#true} assume !(1 == ~q_req_up~0); {70686#true} is VALID [2022-02-20 19:57:25,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {70686#true} is VALID [2022-02-20 19:57:25,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#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;~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; {70727#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:25,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {70686#true} is VALID [2022-02-20 19:57:25,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {70686#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {70686#true} is VALID [2022-02-20 19:57:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:25,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209654568] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:57:25,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:57:25,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:57:25,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488732468] [2022-02-20 19:57:25,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:57:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:57:25,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:25,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:25,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:25,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:25,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:25,335 INFO L87 Difference]: Start difference. First operand 3338 states and 4196 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:33,503 INFO L93 Difference]: Finished difference Result 7779 states and 9682 transitions. [2022-02-20 19:57:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:57:33,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:57:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1012 transitions. [2022-02-20 19:57:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1012 transitions. [2022-02-20 19:57:33,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1012 transitions. [2022-02-20 19:57:34,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1012 edges. 1012 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:36,465 INFO L225 Difference]: With dead ends: 7779 [2022-02-20 19:57:36,466 INFO L226 Difference]: Without dead ends: 7776 [2022-02-20 19:57:36,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-02-20 19:57:36,467 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 1360 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:36,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1423 Valid, 1739 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:57:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states.