./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:54,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:54,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:54,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:54,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:54,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:54,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:54,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:54,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:54,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:54,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:54,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:54,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:54,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:54,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:54,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:54,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:54,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:54,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:54,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:54,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:54,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:54,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:54,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:54,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:54,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:54,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:54,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:54,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:54,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:54,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:54,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:54,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:54,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:54,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:54,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:54,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:54,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:54,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:54,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:54,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:54,394 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:54,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:54,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:54,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:54,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:54,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:54,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:54,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:54,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:54,409 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:54,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:54,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:54,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:54,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:54,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:54,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:54,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:54,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:54,411 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:54,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:54,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:54,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:54,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:54,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:54,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:54,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:54,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:54,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:54,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:54,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:54,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:54,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:54,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:54,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:54,414 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 -> a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 [2022-02-20 19:56:54,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:54,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:54,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:54,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:54,618 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:54,619 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.04.cil-2.c [2022-02-20 19:56:54,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f4da205/85d38c788faf491b85108c0f2d1ee6d7/FLAG884a40583 [2022-02-20 19:56:55,094 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:55,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2022-02-20 19:56:55,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f4da205/85d38c788faf491b85108c0f2d1ee6d7/FLAG884a40583 [2022-02-20 19:56:55,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f4da205/85d38c788faf491b85108c0f2d1ee6d7 [2022-02-20 19:56:55,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:55,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:55,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:55,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:55,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:55,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:55" (1/1) ... [2022-02-20 19:56:55,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4ec10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:55, skipping insertion in model container [2022-02-20 19:56:55,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:55" (1/1) ... [2022-02-20 19:56:55,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:55,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:55,624 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.04.cil-2.c[914,927] [2022-02-20 19:56:55,660 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.04.cil-2.c[7115,7128] [2022-02-20 19:56:55,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:55,706 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:55,713 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.04.cil-2.c[914,927] [2022-02-20 19:56:55,729 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.04.cil-2.c[7115,7128] [2022-02-20 19:56:55,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:55,772 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:55,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:55 WrapperNode [2022-02-20 19:56:55,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:55,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:55,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:55,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:55,788 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:55" (1/1) ... [2022-02-20 19:56:55,805 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:55" (1/1) ... [2022-02-20 19:56:55,846 INFO L137 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 581 [2022-02-20 19:56:55,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:55,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:55,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:55,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:55,853 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:55" (1/1) ... [2022-02-20 19:56:55,854 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:55" (1/1) ... [2022-02-20 19:56:55,868 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:55" (1/1) ... [2022-02-20 19:56:55,869 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:55" (1/1) ... [2022-02-20 19:56:55,877 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:55" (1/1) ... [2022-02-20 19:56:55,885 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:55" (1/1) ... [2022-02-20 19:56:55,887 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:55" (1/1) ... [2022-02-20 19:56:55,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:55,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:55,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:55,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:55,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:55" (1/1) ... [2022-02-20 19:56:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:55,941 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:55,950 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:55,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:55,988 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:55,988 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:55,988 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:55,989 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:55,989 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:55,989 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:55,989 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:55,989 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:55,989 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:55,989 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:55,990 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:55,990 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:55,990 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:55,991 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:55,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:55,991 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:56,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:56,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:56,007 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:56:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:56:56,123 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:56,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:56,712 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:56,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:56,727 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 19:56:56,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:56 BoogieIcfgContainer [2022-02-20 19:56:56,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:56,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:56,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:56,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:56,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:55" (1/3) ... [2022-02-20 19:56:56,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f69d5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:56, skipping insertion in model container [2022-02-20 19:56:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:55" (2/3) ... [2022-02-20 19:56:56,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f69d5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:56, skipping insertion in model container [2022-02-20 19:56:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:56" (3/3) ... [2022-02-20 19:56:56,738 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2022-02-20 19:56:56,745 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:56,745 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:56,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:56,801 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:56,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 291 states, 239 states have (on average 1.594142259414226) internal successors, (381), 247 states have internal predecessors, (381), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 19:56:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:56,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:56,846 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:56,846 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash -496845882, now seen corresponding path program 1 times [2022-02-20 19:56:56,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:56,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286254513] [2022-02-20 19:56:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:56,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#(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); {335#(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:57,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {335#(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:57,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {335#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {296#(= ~q_write_ev~0 ~q_read_ev~0)} #1017#return; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#(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); {336#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:57,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(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; {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:57,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:57,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {296#(= ~q_write_ev~0 ~q_read_ev~0)} #1019#return; {295#false} is VALID [2022-02-20 19:56:57,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#true} havoc ~__retres1~0; {294#true} is VALID [2022-02-20 19:56:57,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume !(1 == ~p_dw_pc~0); {294#true} is VALID [2022-02-20 19:56:57,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} ~__retres1~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} #res := ~__retres1~0; {294#true} is VALID [2022-02-20 19:56:57,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,212 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {294#true} {294#true} #1013#return; {294#true} is VALID [2022-02-20 19:56:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#true} havoc ~__retres1~1; {294#true} is VALID [2022-02-20 19:56:57,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume !(1 == ~c_dr_pc~0); {294#true} is VALID [2022-02-20 19:56:57,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} ~__retres1~1 := 0; {294#true} is VALID [2022-02-20 19:56:57,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} #res := ~__retres1~1; {294#true} is VALID [2022-02-20 19:56:57,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,221 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {294#true} {294#true} #1015#return; {294#true} is VALID [2022-02-20 19:56:57,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {338#(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; {294#true} is VALID [2022-02-20 19:56:57,222 INFO L272 TraceCheckUtils]: 1: Hoare triple {294#true} call #t~ret8 := is_do_write_p_triggered(); {294#true} is VALID [2022-02-20 19:56:57,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} havoc ~__retres1~0; {294#true} is VALID [2022-02-20 19:56:57,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} assume !(1 == ~p_dw_pc~0); {294#true} is VALID [2022-02-20 19:56:57,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#true} ~__retres1~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} #res := ~__retres1~0; {294#true} is VALID [2022-02-20 19:56:57,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,223 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {294#true} {294#true} #1013#return; {294#true} is VALID [2022-02-20 19:56:57,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {294#true} is VALID [2022-02-20 19:56:57,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,225 INFO L272 TraceCheckUtils]: 10: Hoare triple {294#true} call #t~ret9 := is_do_read_c_triggered(); {294#true} is VALID [2022-02-20 19:56:57,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#true} havoc ~__retres1~1; {294#true} is VALID [2022-02-20 19:56:57,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#true} assume !(1 == ~c_dr_pc~0); {294#true} is VALID [2022-02-20 19:56:57,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#true} ~__retres1~1 := 0; {294#true} is VALID [2022-02-20 19:56:57,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#true} #res := ~__retres1~1; {294#true} is VALID [2022-02-20 19:56:57,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {294#true} {294#true} #1015#return; {294#true} is VALID [2022-02-20 19:56:57,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {294#true} is VALID [2022-02-20 19:56:57,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {294#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,230 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {294#true} {295#false} #1021#return; {295#false} is VALID [2022-02-20 19:56:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#(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; {294#true} is VALID [2022-02-20 19:56:57,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {294#true} is VALID [2022-02-20 19:56:57,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {295#false} #1023#return; {295#false} is VALID [2022-02-20 19:56:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#true} havoc ~__retres1~2; {294#true} is VALID [2022-02-20 19:56:57,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {294#true} is VALID [2022-02-20 19:56:57,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} #res := ~__retres1~2; {294#true} is VALID [2022-02-20 19:56:57,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,260 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {294#true} {295#false} #1025#return; {295#false} is VALID [2022-02-20 19:56:57,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {294#true} is VALID [2022-02-20 19:56:57,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {296#(= ~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; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {296#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {334#(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:57,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#(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); {335#(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:57,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {335#(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:57,265 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {335#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {296#(= ~q_write_ev~0 ~q_read_ev~0)} #1017#return; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {296#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:57,269 INFO L272 TraceCheckUtils]: 12: Hoare triple {296#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {335#(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:57,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#(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); {336#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:57,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#(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; {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:57,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:57,274 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {337#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {296#(= ~q_write_ev~0 ~q_read_ev~0)} #1019#return; {295#false} is VALID [2022-02-20 19:56:57,274 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#false} call activate_threads1(); {338#(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:57,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {338#(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; {294#true} is VALID [2022-02-20 19:56:57,274 INFO L272 TraceCheckUtils]: 19: Hoare triple {294#true} call #t~ret8 := is_do_write_p_triggered(); {294#true} is VALID [2022-02-20 19:56:57,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {294#true} havoc ~__retres1~0; {294#true} is VALID [2022-02-20 19:56:57,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {294#true} assume !(1 == ~p_dw_pc~0); {294#true} is VALID [2022-02-20 19:56:57,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {294#true} ~__retres1~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {294#true} #res := ~__retres1~0; {294#true} is VALID [2022-02-20 19:56:57,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,276 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {294#true} {294#true} #1013#return; {294#true} is VALID [2022-02-20 19:56:57,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {294#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {294#true} is VALID [2022-02-20 19:56:57,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {294#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,276 INFO L272 TraceCheckUtils]: 28: Hoare triple {294#true} call #t~ret9 := is_do_read_c_triggered(); {294#true} is VALID [2022-02-20 19:56:57,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {294#true} havoc ~__retres1~1; {294#true} is VALID [2022-02-20 19:56:57,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {294#true} assume !(1 == ~c_dr_pc~0); {294#true} is VALID [2022-02-20 19:56:57,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {294#true} ~__retres1~1 := 0; {294#true} is VALID [2022-02-20 19:56:57,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {294#true} #res := ~__retres1~1; {294#true} is VALID [2022-02-20 19:56:57,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,278 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {294#true} {294#true} #1015#return; {294#true} is VALID [2022-02-20 19:56:57,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {294#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {294#true} is VALID [2022-02-20 19:56:57,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {294#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {294#true} is VALID [2022-02-20 19:56:57,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,279 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {294#true} {295#false} #1021#return; {295#false} is VALID [2022-02-20 19:56:57,279 INFO L272 TraceCheckUtils]: 39: Hoare triple {295#false} call reset_delta_events1(); {335#(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:57,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {335#(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; {294#true} is VALID [2022-02-20 19:56:57,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {294#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {294#true} is VALID [2022-02-20 19:56:57,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,280 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {294#true} {295#false} #1023#return; {295#false} is VALID [2022-02-20 19:56:57,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 19:56:57,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {295#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; {295#false} is VALID [2022-02-20 19:56:57,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 19:56:57,281 INFO L272 TraceCheckUtils]: 47: Hoare triple {295#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {294#true} is VALID [2022-02-20 19:56:57,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {294#true} havoc ~__retres1~2; {294#true} is VALID [2022-02-20 19:56:57,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {294#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {294#true} is VALID [2022-02-20 19:56:57,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {294#true} #res := ~__retres1~2; {294#true} is VALID [2022-02-20 19:56:57,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {294#true} assume true; {294#true} is VALID [2022-02-20 19:56:57,284 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {294#true} {295#false} #1025#return; {295#false} is VALID [2022-02-20 19:56:57,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {295#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; {295#false} is VALID [2022-02-20 19:56:57,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {295#false} assume 0 != eval1_~tmp___1~0#1; {295#false} is VALID [2022-02-20 19:56:57,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {295#false} assume !(0 == ~p_dw_st~0); {295#false} is VALID [2022-02-20 19:56:57,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {295#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; {295#false} is VALID [2022-02-20 19:56:57,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {295#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; {295#false} is VALID [2022-02-20 19:56:57,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {295#false} assume 0 == ~c_dr_pc~0; {295#false} is VALID [2022-02-20 19:56:57,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 19:56:57,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {295#false} assume !(1 == ~q_free~0); {295#false} is VALID [2022-02-20 19:56:57,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {295#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; {295#false} is VALID [2022-02-20 19:56:57,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {295#false} assume !(~p_last_write~0 == ~c_last_read~0); {295#false} is VALID [2022-02-20 19:56:57,287 INFO L272 TraceCheckUtils]: 63: Hoare triple {295#false} call error1(); {295#false} is VALID [2022-02-20 19:56:57,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 19:56:57,289 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:57,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:57,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286254513] [2022-02-20 19:56:57,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286254513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:57,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:57,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:57,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822895636] [2022-02-20 19:56:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:57,298 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:57,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:57,301 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:57,354 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:57,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:57,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:57,371 INFO L87 Difference]: Start difference. First operand has 291 states, 239 states have (on average 1.594142259414226) internal successors, (381), 247 states have internal predecessors, (381), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,200 INFO L93 Difference]: Finished difference Result 727 states and 1118 transitions. [2022-02-20 19:57:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:00,200 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:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:00,201 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:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1118 transitions. [2022-02-20 19:57:00,221 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:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1118 transitions. [2022-02-20 19:57:00,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1118 transitions. [2022-02-20 19:57:01,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1118 edges. 1118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:01,090 INFO L225 Difference]: With dead ends: 727 [2022-02-20 19:57:01,090 INFO L226 Difference]: Without dead ends: 446 [2022-02-20 19:57:01,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:57:01,096 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 804 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:01,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1752 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-02-20 19:57:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 380. [2022-02-20 19:57:01,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:01,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 446 states. Second operand has 380 states, 310 states have (on average 1.4806451612903226) internal successors, (459), 318 states have internal predecessors, (459), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:57:01,144 INFO L74 IsIncluded]: Start isIncluded. First operand 446 states. Second operand has 380 states, 310 states have (on average 1.4806451612903226) internal successors, (459), 318 states have internal predecessors, (459), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:57:01,146 INFO L87 Difference]: Start difference. First operand 446 states. Second operand has 380 states, 310 states have (on average 1.4806451612903226) internal successors, (459), 318 states have internal predecessors, (459), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:57:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,165 INFO L93 Difference]: Finished difference Result 446 states and 650 transitions. [2022-02-20 19:57:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 650 transitions. [2022-02-20 19:57:01,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:01,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:01,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 310 states have (on average 1.4806451612903226) internal successors, (459), 318 states have internal predecessors, (459), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) Second operand 446 states. [2022-02-20 19:57:01,171 INFO L87 Difference]: Start difference. First operand has 380 states, 310 states have (on average 1.4806451612903226) internal successors, (459), 318 states have internal predecessors, (459), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) Second operand 446 states. [2022-02-20 19:57:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,189 INFO L93 Difference]: Finished difference Result 446 states and 650 transitions. [2022-02-20 19:57:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 650 transitions. [2022-02-20 19:57:01,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:01,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:01,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:01,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 310 states have (on average 1.4806451612903226) internal successors, (459), 318 states have internal predecessors, (459), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:57:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 556 transitions. [2022-02-20 19:57:01,208 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 556 transitions. Word has length 65 [2022-02-20 19:57:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:01,208 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 556 transitions. [2022-02-20 19:57:01,209 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:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 556 transitions. [2022-02-20 19:57:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:01,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:01,210 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,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:01,211 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1769535304, now seen corresponding path program 1 times [2022-02-20 19:57:01,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:01,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68656125] [2022-02-20 19:57:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {2806#(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); {2767#true} is VALID [2022-02-20 19:57:01,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2767#true} {2767#true} #1017#return; {2767#true} is VALID [2022-02-20 19:57:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2807#(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); {2767#true} is VALID [2022-02-20 19:57:01,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume !(0 == ~q_write_ev~0); {2767#true} is VALID [2022-02-20 19:57:01,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2767#true} {2767#true} #1019#return; {2767#true} is VALID [2022-02-20 19:57:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#true} havoc ~__retres1~0; {2767#true} is VALID [2022-02-20 19:57:01,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume !(1 == ~p_dw_pc~0); {2767#true} is VALID [2022-02-20 19:57:01,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} ~__retres1~0 := 0; {2823#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:01,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {2823#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:01,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:01,345 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {2767#true} #1013#return; {2815#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#true} havoc ~__retres1~1; {2767#true} is VALID [2022-02-20 19:57:01,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume !(1 == ~c_dr_pc~0); {2767#true} is VALID [2022-02-20 19:57:01,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} ~__retres1~1 := 0; {2767#true} is VALID [2022-02-20 19:57:01,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {2767#true} #res := ~__retres1~1; {2767#true} is VALID [2022-02-20 19:57:01,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,349 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2767#true} {2768#false} #1015#return; {2768#false} is VALID [2022-02-20 19:57:01,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {2808#(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; {2767#true} is VALID [2022-02-20 19:57:01,350 INFO L272 TraceCheckUtils]: 1: Hoare triple {2767#true} call #t~ret8 := is_do_write_p_triggered(); {2767#true} is VALID [2022-02-20 19:57:01,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} havoc ~__retres1~0; {2767#true} is VALID [2022-02-20 19:57:01,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {2767#true} assume !(1 == ~p_dw_pc~0); {2767#true} is VALID [2022-02-20 19:57:01,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {2767#true} ~__retres1~0 := 0; {2823#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:01,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {2823#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:01,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:01,352 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {2767#true} #1013#return; {2815#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:01,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {2815#(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; {2816#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:01,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {2816#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2768#false} is VALID [2022-02-20 19:57:01,353 INFO L272 TraceCheckUtils]: 10: Hoare triple {2768#false} call #t~ret9 := is_do_read_c_triggered(); {2767#true} is VALID [2022-02-20 19:57:01,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {2767#true} havoc ~__retres1~1; {2767#true} is VALID [2022-02-20 19:57:01,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {2767#true} assume !(1 == ~c_dr_pc~0); {2767#true} is VALID [2022-02-20 19:57:01,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {2767#true} ~__retres1~1 := 0; {2767#true} is VALID [2022-02-20 19:57:01,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {2767#true} #res := ~__retres1~1; {2767#true} is VALID [2022-02-20 19:57:01,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,354 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2767#true} {2768#false} #1015#return; {2768#false} is VALID [2022-02-20 19:57:01,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {2768#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2768#false} is VALID [2022-02-20 19:57:01,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {2768#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2768#false} is VALID [2022-02-20 19:57:01,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2768#false} assume true; {2768#false} is VALID [2022-02-20 19:57:01,355 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2768#false} {2767#true} #1021#return; {2768#false} is VALID [2022-02-20 19:57:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {2807#(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; {2767#true} is VALID [2022-02-20 19:57:01,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2767#true} is VALID [2022-02-20 19:57:01,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2767#true} {2768#false} #1023#return; {2768#false} is VALID [2022-02-20 19:57:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#true} havoc ~__retres1~2; {2767#true} is VALID [2022-02-20 19:57:01,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2767#true} is VALID [2022-02-20 19:57:01,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} #res := ~__retres1~2; {2767#true} is VALID [2022-02-20 19:57:01,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,364 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2767#true} {2768#false} #1025#return; {2768#false} is VALID [2022-02-20 19:57:01,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {2767#true} is VALID [2022-02-20 19:57:01,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {2767#true} is VALID [2022-02-20 19:57:01,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {2767#true} is VALID [2022-02-20 19:57:01,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {2767#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; {2767#true} is VALID [2022-02-20 19:57:01,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {2767#true} call update_channels1(); {2806#(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,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {2806#(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); {2767#true} is VALID [2022-02-20 19:57:01,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,365 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2767#true} {2767#true} #1017#return; {2767#true} is VALID [2022-02-20 19:57:01,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#true} assume { :begin_inline_init_threads1 } true; {2767#true} is VALID [2022-02-20 19:57:01,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {2767#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2767#true} is VALID [2022-02-20 19:57:01,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {2767#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2767#true} is VALID [2022-02-20 19:57:01,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {2767#true} assume { :end_inline_init_threads1 } true; {2767#true} is VALID [2022-02-20 19:57:01,366 INFO L272 TraceCheckUtils]: 12: Hoare triple {2767#true} call fire_delta_events1(); {2807#(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,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {2807#(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); {2767#true} is VALID [2022-02-20 19:57:01,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {2767#true} assume !(0 == ~q_write_ev~0); {2767#true} is VALID [2022-02-20 19:57:01,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,367 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2767#true} {2767#true} #1019#return; {2767#true} is VALID [2022-02-20 19:57:01,368 INFO L272 TraceCheckUtils]: 17: Hoare triple {2767#true} call activate_threads1(); {2808#(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,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {2808#(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; {2767#true} is VALID [2022-02-20 19:57:01,368 INFO L272 TraceCheckUtils]: 19: Hoare triple {2767#true} call #t~ret8 := is_do_write_p_triggered(); {2767#true} is VALID [2022-02-20 19:57:01,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {2767#true} havoc ~__retres1~0; {2767#true} is VALID [2022-02-20 19:57:01,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {2767#true} assume !(1 == ~p_dw_pc~0); {2767#true} is VALID [2022-02-20 19:57:01,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {2767#true} ~__retres1~0 := 0; {2823#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:01,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {2823#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:01,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:01,370 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2824#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {2767#true} #1013#return; {2815#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:01,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {2815#(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; {2816#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:01,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {2816#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2768#false} is VALID [2022-02-20 19:57:01,371 INFO L272 TraceCheckUtils]: 28: Hoare triple {2768#false} call #t~ret9 := is_do_read_c_triggered(); {2767#true} is VALID [2022-02-20 19:57:01,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {2767#true} havoc ~__retres1~1; {2767#true} is VALID [2022-02-20 19:57:01,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {2767#true} assume !(1 == ~c_dr_pc~0); {2767#true} is VALID [2022-02-20 19:57:01,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {2767#true} ~__retres1~1 := 0; {2767#true} is VALID [2022-02-20 19:57:01,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {2767#true} #res := ~__retres1~1; {2767#true} is VALID [2022-02-20 19:57:01,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,372 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2767#true} {2768#false} #1015#return; {2768#false} is VALID [2022-02-20 19:57:01,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {2768#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2768#false} is VALID [2022-02-20 19:57:01,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {2768#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2768#false} is VALID [2022-02-20 19:57:01,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {2768#false} assume true; {2768#false} is VALID [2022-02-20 19:57:01,373 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2768#false} {2767#true} #1021#return; {2768#false} is VALID [2022-02-20 19:57:01,373 INFO L272 TraceCheckUtils]: 39: Hoare triple {2768#false} call reset_delta_events1(); {2807#(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,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {2807#(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; {2767#true} is VALID [2022-02-20 19:57:01,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {2767#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2767#true} is VALID [2022-02-20 19:57:01,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,374 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2767#true} {2768#false} #1023#return; {2768#false} is VALID [2022-02-20 19:57:01,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#false} assume !false; {2768#false} is VALID [2022-02-20 19:57:01,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {2768#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; {2768#false} is VALID [2022-02-20 19:57:01,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {2768#false} assume !false; {2768#false} is VALID [2022-02-20 19:57:01,374 INFO L272 TraceCheckUtils]: 47: Hoare triple {2768#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2767#true} is VALID [2022-02-20 19:57:01,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {2767#true} havoc ~__retres1~2; {2767#true} is VALID [2022-02-20 19:57:01,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {2767#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2767#true} is VALID [2022-02-20 19:57:01,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {2767#true} #res := ~__retres1~2; {2767#true} is VALID [2022-02-20 19:57:01,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {2767#true} assume true; {2767#true} is VALID [2022-02-20 19:57:01,375 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2767#true} {2768#false} #1025#return; {2768#false} is VALID [2022-02-20 19:57:01,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {2768#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; {2768#false} is VALID [2022-02-20 19:57:01,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {2768#false} assume 0 != eval1_~tmp___1~0#1; {2768#false} is VALID [2022-02-20 19:57:01,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {2768#false} assume !(0 == ~p_dw_st~0); {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {2768#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; {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {2768#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; {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {2768#false} assume 0 == ~c_dr_pc~0; {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {2768#false} assume !false; {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {2768#false} assume !(1 == ~q_free~0); {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {2768#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; {2768#false} is VALID [2022-02-20 19:57:01,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {2768#false} assume !(~p_last_write~0 == ~c_last_read~0); {2768#false} is VALID [2022-02-20 19:57:01,377 INFO L272 TraceCheckUtils]: 63: Hoare triple {2768#false} call error1(); {2768#false} is VALID [2022-02-20 19:57:01,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {2768#false} assume !false; {2768#false} is VALID [2022-02-20 19:57:01,377 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,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:01,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68656125] [2022-02-20 19:57:01,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68656125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:01,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:01,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:01,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958960599] [2022-02-20 19:57:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:01,395 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:01,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:01,395 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:57:01,435 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,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:01,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:01,437 INFO L87 Difference]: Start difference. First operand 380 states and 556 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:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,754 INFO L93 Difference]: Finished difference Result 591 states and 851 transitions. [2022-02-20 19:57:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:03,755 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:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:03,755 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:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 567 transitions. [2022-02-20 19:57:03,761 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:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 567 transitions. [2022-02-20 19:57:03,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 567 transitions. [2022-02-20 19:57:04,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:04,106 INFO L225 Difference]: With dead ends: 591 [2022-02-20 19:57:04,106 INFO L226 Difference]: Without dead ends: 410 [2022-02-20 19:57:04,110 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:57:04,112 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 490 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:04,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1633 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-02-20 19:57:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 390. [2022-02-20 19:57:04,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:04,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 390 states, 318 states have (on average 1.4685534591194969) internal successors, (467), 326 states have internal predecessors, (467), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2022-02-20 19:57:04,157 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 390 states, 318 states have (on average 1.4685534591194969) internal successors, (467), 326 states have internal predecessors, (467), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2022-02-20 19:57:04,158 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 390 states, 318 states have (on average 1.4685534591194969) internal successors, (467), 326 states have internal predecessors, (467), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2022-02-20 19:57:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,176 INFO L93 Difference]: Finished difference Result 410 states and 596 transitions. [2022-02-20 19:57:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 596 transitions. [2022-02-20 19:57:04,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:04,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 318 states have (on average 1.4685534591194969) internal successors, (467), 326 states have internal predecessors, (467), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) Second operand 410 states. [2022-02-20 19:57:04,181 INFO L87 Difference]: Start difference. First operand has 390 states, 318 states have (on average 1.4685534591194969) internal successors, (467), 326 states have internal predecessors, (467), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) Second operand 410 states. [2022-02-20 19:57:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,202 INFO L93 Difference]: Finished difference Result 410 states and 596 transitions. [2022-02-20 19:57:04,203 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 596 transitions. [2022-02-20 19:57:04,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:04,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:04,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 318 states have (on average 1.4685534591194969) internal successors, (467), 326 states have internal predecessors, (467), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2022-02-20 19:57:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 566 transitions. [2022-02-20 19:57:04,216 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 566 transitions. Word has length 65 [2022-02-20 19:57:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:04,217 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 566 transitions. [2022-02-20 19:57:04,217 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:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 566 transitions. [2022-02-20 19:57:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:04,218 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:04,218 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,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:04,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:04,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash 740176006, now seen corresponding path program 1 times [2022-02-20 19:57:04,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:04,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714039052] [2022-02-20 19:57:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {5025#(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); {4986#true} is VALID [2022-02-20 19:57:04,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4986#true} {4986#true} #1017#return; {4986#true} is VALID [2022-02-20 19:57:04,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {5026#(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); {4986#true} is VALID [2022-02-20 19:57:04,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume !(0 == ~q_write_ev~0); {4986#true} is VALID [2022-02-20 19:57:04,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4986#true} #1019#return; {4986#true} is VALID [2022-02-20 19:57:04,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#true} havoc ~__retres1~0; {4986#true} is VALID [2022-02-20 19:57:04,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume !(1 == ~p_dw_pc~0); {4986#true} is VALID [2022-02-20 19:57:04,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} ~__retres1~0 := 0; {4986#true} is VALID [2022-02-20 19:57:04,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {4986#true} #res := ~__retres1~0; {4986#true} is VALID [2022-02-20 19:57:04,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,334 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4986#true} {4986#true} #1013#return; {4986#true} is VALID [2022-02-20 19:57:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#true} havoc ~__retres1~1; {4986#true} is VALID [2022-02-20 19:57:04,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume !(1 == ~c_dr_pc~0); {4986#true} is VALID [2022-02-20 19:57:04,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} ~__retres1~1 := 0; {5042#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:04,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {5042#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:04,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:04,361 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {4986#true} #1015#return; {5040#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:04,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {5027#(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; {4986#true} is VALID [2022-02-20 19:57:04,361 INFO L272 TraceCheckUtils]: 1: Hoare triple {4986#true} call #t~ret8 := is_do_write_p_triggered(); {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} havoc ~__retres1~0; {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {4986#true} assume !(1 == ~p_dw_pc~0); {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {4986#true} ~__retres1~0 := 0; {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {4986#true} #res := ~__retres1~0; {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4986#true} {4986#true} #1013#return; {4986#true} is VALID [2022-02-20 19:57:04,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {4986#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4986#true} is VALID [2022-02-20 19:57:04,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {4986#true} assume !(0 != ~tmp~1); {4986#true} is VALID [2022-02-20 19:57:04,363 INFO L272 TraceCheckUtils]: 10: Hoare triple {4986#true} call #t~ret9 := is_do_read_c_triggered(); {4986#true} is VALID [2022-02-20 19:57:04,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {4986#true} havoc ~__retres1~1; {4986#true} is VALID [2022-02-20 19:57:04,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {4986#true} assume !(1 == ~c_dr_pc~0); {4986#true} is VALID [2022-02-20 19:57:04,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {4986#true} ~__retres1~1 := 0; {5042#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:04,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {5042#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:04,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:04,365 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {4986#true} #1015#return; {5040#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:04,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#(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; {5041#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:04,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {5041#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4987#false} is VALID [2022-02-20 19:57:04,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {4987#false} assume true; {4987#false} is VALID [2022-02-20 19:57:04,366 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4987#false} {4986#true} #1021#return; {4987#false} is VALID [2022-02-20 19:57:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {5026#(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; {4986#true} is VALID [2022-02-20 19:57:04,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4986#true} is VALID [2022-02-20 19:57:04,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4987#false} #1023#return; {4987#false} is VALID [2022-02-20 19:57:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#true} havoc ~__retres1~2; {4986#true} is VALID [2022-02-20 19:57:04,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4986#true} is VALID [2022-02-20 19:57:04,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} #res := ~__retres1~2; {4986#true} is VALID [2022-02-20 19:57:04,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,384 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4986#true} {4987#false} #1025#return; {4987#false} is VALID [2022-02-20 19:57:04,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {4986#true} is VALID [2022-02-20 19:57:04,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {4986#true} is VALID [2022-02-20 19:57:04,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {4986#true} is VALID [2022-02-20 19:57:04,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {4986#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; {4986#true} is VALID [2022-02-20 19:57:04,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {4986#true} call update_channels1(); {5025#(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:04,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {5025#(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); {4986#true} is VALID [2022-02-20 19:57:04,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,386 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4986#true} {4986#true} #1017#return; {4986#true} is VALID [2022-02-20 19:57:04,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {4986#true} assume { :begin_inline_init_threads1 } true; {4986#true} is VALID [2022-02-20 19:57:04,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {4986#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4986#true} is VALID [2022-02-20 19:57:04,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {4986#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4986#true} is VALID [2022-02-20 19:57:04,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {4986#true} assume { :end_inline_init_threads1 } true; {4986#true} is VALID [2022-02-20 19:57:04,400 INFO L272 TraceCheckUtils]: 12: Hoare triple {4986#true} call fire_delta_events1(); {5026#(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:04,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {5026#(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); {4986#true} is VALID [2022-02-20 19:57:04,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {4986#true} assume !(0 == ~q_write_ev~0); {4986#true} is VALID [2022-02-20 19:57:04,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,400 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4986#true} {4986#true} #1019#return; {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L272 TraceCheckUtils]: 17: Hoare triple {4986#true} call activate_threads1(); {5027#(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:04,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {5027#(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; {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L272 TraceCheckUtils]: 19: Hoare triple {4986#true} call #t~ret8 := is_do_write_p_triggered(); {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {4986#true} havoc ~__retres1~0; {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {4986#true} assume !(1 == ~p_dw_pc~0); {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {4986#true} ~__retres1~0 := 0; {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {4986#true} #res := ~__retres1~0; {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,401 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4986#true} {4986#true} #1013#return; {4986#true} is VALID [2022-02-20 19:57:04,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {4986#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4986#true} is VALID [2022-02-20 19:57:04,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {4986#true} assume !(0 != ~tmp~1); {4986#true} is VALID [2022-02-20 19:57:04,402 INFO L272 TraceCheckUtils]: 28: Hoare triple {4986#true} call #t~ret9 := is_do_read_c_triggered(); {4986#true} is VALID [2022-02-20 19:57:04,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {4986#true} havoc ~__retres1~1; {4986#true} is VALID [2022-02-20 19:57:04,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {4986#true} assume !(1 == ~c_dr_pc~0); {4986#true} is VALID [2022-02-20 19:57:04,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {4986#true} ~__retres1~1 := 0; {5042#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:04,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {5042#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:04,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:04,404 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5043#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {4986#true} #1015#return; {5040#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:04,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {5040#(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; {5041#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:04,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {5041#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4987#false} is VALID [2022-02-20 19:57:04,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {4987#false} assume true; {4987#false} is VALID [2022-02-20 19:57:04,405 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4987#false} {4986#true} #1021#return; {4987#false} is VALID [2022-02-20 19:57:04,405 INFO L272 TraceCheckUtils]: 39: Hoare triple {4987#false} call reset_delta_events1(); {5026#(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:04,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {5026#(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; {4986#true} is VALID [2022-02-20 19:57:04,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {4986#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4986#true} is VALID [2022-02-20 19:57:04,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,405 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4986#true} {4987#false} #1023#return; {4987#false} is VALID [2022-02-20 19:57:04,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {4987#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; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L272 TraceCheckUtils]: 47: Hoare triple {4987#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4986#true} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {4986#true} havoc ~__retres1~2; {4986#true} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {4986#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4986#true} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {4986#true} #res := ~__retres1~2; {4986#true} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-02-20 19:57:04,406 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4986#true} {4987#false} #1025#return; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {4987#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; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#false} assume 0 != eval1_~tmp___1~0#1; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#false} assume !(0 == ~p_dw_st~0); {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#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; {4987#false} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {4987#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; {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {4987#false} assume 0 == ~c_dr_pc~0; {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {4987#false} assume !(1 == ~q_free~0); {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {4987#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; {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {4987#false} assume !(~p_last_write~0 == ~c_last_read~0); {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L272 TraceCheckUtils]: 63: Hoare triple {4987#false} call error1(); {4987#false} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-02-20 19:57:04,408 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:04,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:04,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714039052] [2022-02-20 19:57:04,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714039052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:04,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:04,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:04,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097341244] [2022-02-20 19:57:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:04,409 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:04,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:04,410 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:57:04,458 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:04,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:04,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:04,459 INFO L87 Difference]: Start difference. First operand 390 states and 566 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:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,749 INFO L93 Difference]: Finished difference Result 615 states and 879 transitions. [2022-02-20 19:57:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:06,750 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:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:06,751 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:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 571 transitions. [2022-02-20 19:57:06,756 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:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 571 transitions. [2022-02-20 19:57:06,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 571 transitions. [2022-02-20 19:57:07,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 571 edges. 571 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:07,121 INFO L225 Difference]: With dead ends: 615 [2022-02-20 19:57:07,121 INFO L226 Difference]: Without dead ends: 424 [2022-02-20 19:57:07,124 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:07,128 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 332 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:07,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 1812 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-02-20 19:57:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 400. [2022-02-20 19:57:07,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:07,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand has 400 states, 326 states have (on average 1.4570552147239264) internal successors, (475), 334 states have internal predecessors, (475), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-02-20 19:57:07,151 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand has 400 states, 326 states have (on average 1.4570552147239264) internal successors, (475), 334 states have internal predecessors, (475), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-02-20 19:57:07,152 INFO L87 Difference]: Start difference. First operand 424 states. Second operand has 400 states, 326 states have (on average 1.4570552147239264) internal successors, (475), 334 states have internal predecessors, (475), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-02-20 19:57:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,164 INFO L93 Difference]: Finished difference Result 424 states and 612 transitions. [2022-02-20 19:57:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 612 transitions. [2022-02-20 19:57:07,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 326 states have (on average 1.4570552147239264) internal successors, (475), 334 states have internal predecessors, (475), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) Second operand 424 states. [2022-02-20 19:57:07,167 INFO L87 Difference]: Start difference. First operand has 400 states, 326 states have (on average 1.4570552147239264) internal successors, (475), 334 states have internal predecessors, (475), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) Second operand 424 states. [2022-02-20 19:57:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,177 INFO L93 Difference]: Finished difference Result 424 states and 612 transitions. [2022-02-20 19:57:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 612 transitions. [2022-02-20 19:57:07,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:07,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 326 states have (on average 1.4570552147239264) internal successors, (475), 334 states have internal predecessors, (475), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-02-20 19:57:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 576 transitions. [2022-02-20 19:57:07,189 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 576 transitions. Word has length 65 [2022-02-20 19:57:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:07,190 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 576 transitions. [2022-02-20 19:57:07,190 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:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 576 transitions. [2022-02-20 19:57:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:07,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:07,192 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:07,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:07,192 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2126379400, now seen corresponding path program 1 times [2022-02-20 19:57:07,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:07,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144846896] [2022-02-20 19:57:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {7315#(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); {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {7277#(= ~q_read_ev~0 2)} #1017#return; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {7317#(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); {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {7277#(= ~q_read_ev~0 2)} #1019#return; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {7275#true} havoc ~__retres1~0; {7275#true} is VALID [2022-02-20 19:57:07,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {7275#true} assume !(1 == ~p_dw_pc~0); {7275#true} is VALID [2022-02-20 19:57:07,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {7275#true} ~__retres1~0 := 0; {7275#true} is VALID [2022-02-20 19:57:07,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {7275#true} #res := ~__retres1~0; {7275#true} is VALID [2022-02-20 19:57:07,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,308 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7275#true} {7275#true} #1013#return; {7275#true} is VALID [2022-02-20 19:57:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {7275#true} havoc ~__retres1~1; {7275#true} is VALID [2022-02-20 19:57:07,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {7275#true} assume !(1 == ~c_dr_pc~0); {7275#true} is VALID [2022-02-20 19:57:07,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {7275#true} ~__retres1~1 := 0; {7275#true} is VALID [2022-02-20 19:57:07,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {7275#true} #res := ~__retres1~1; {7275#true} is VALID [2022-02-20 19:57:07,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,312 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7275#true} {7275#true} #1015#return; {7275#true} is VALID [2022-02-20 19:57:07,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {7318#(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; {7275#true} is VALID [2022-02-20 19:57:07,313 INFO L272 TraceCheckUtils]: 1: Hoare triple {7275#true} call #t~ret8 := is_do_write_p_triggered(); {7275#true} is VALID [2022-02-20 19:57:07,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {7275#true} havoc ~__retres1~0; {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {7275#true} assume !(1 == ~p_dw_pc~0); {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {7275#true} ~__retres1~0 := 0; {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {7275#true} #res := ~__retres1~0; {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7275#true} {7275#true} #1013#return; {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {7275#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7275#true} is VALID [2022-02-20 19:57:07,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {7275#true} assume !(0 != ~tmp~1); {7275#true} is VALID [2022-02-20 19:57:07,315 INFO L272 TraceCheckUtils]: 10: Hoare triple {7275#true} call #t~ret9 := is_do_read_c_triggered(); {7275#true} is VALID [2022-02-20 19:57:07,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {7275#true} havoc ~__retres1~1; {7275#true} is VALID [2022-02-20 19:57:07,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {7275#true} assume !(1 == ~c_dr_pc~0); {7275#true} is VALID [2022-02-20 19:57:07,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {7275#true} ~__retres1~1 := 0; {7275#true} is VALID [2022-02-20 19:57:07,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {7275#true} #res := ~__retres1~1; {7275#true} is VALID [2022-02-20 19:57:07,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,317 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7275#true} {7275#true} #1015#return; {7275#true} is VALID [2022-02-20 19:57:07,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {7275#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7275#true} is VALID [2022-02-20 19:57:07,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {7275#true} assume !(0 != ~tmp___0~1); {7275#true} is VALID [2022-02-20 19:57:07,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,325 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7275#true} {7277#(= ~q_read_ev~0 2)} #1021#return; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {7317#(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; {7331#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:07,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {7331#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7331#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:07,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {7331#(= |old(~q_read_ev~0)| 1)} assume true; {7331#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:07,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7331#(= |old(~q_read_ev~0)| 1)} {7277#(= ~q_read_ev~0 2)} #1023#return; {7276#false} is VALID [2022-02-20 19:57:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {7275#true} havoc ~__retres1~2; {7275#true} is VALID [2022-02-20 19:57:07,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {7275#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7275#true} is VALID [2022-02-20 19:57:07,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {7275#true} #res := ~__retres1~2; {7275#true} is VALID [2022-02-20 19:57:07,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,343 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7275#true} {7276#false} #1025#return; {7276#false} is VALID [2022-02-20 19:57:07,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {7275#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {7275#true} is VALID [2022-02-20 19:57:07,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {7275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {7275#true} is VALID [2022-02-20 19:57:07,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {7275#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {7277#(= ~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; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {7277#(= ~q_read_ev~0 2)} call update_channels1(); {7315#(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,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#(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); {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,346 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {7277#(= ~q_read_ev~0 2)} #1017#return; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {7277#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {7277#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {7277#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {7277#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,347 INFO L272 TraceCheckUtils]: 12: Hoare triple {7277#(= ~q_read_ev~0 2)} call fire_delta_events1(); {7317#(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,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {7317#(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); {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:07,349 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {7277#(= ~q_read_ev~0 2)} #1019#return; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,349 INFO L272 TraceCheckUtils]: 17: Hoare triple {7277#(= ~q_read_ev~0 2)} call activate_threads1(); {7318#(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,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {7318#(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; {7275#true} is VALID [2022-02-20 19:57:07,350 INFO L272 TraceCheckUtils]: 19: Hoare triple {7275#true} call #t~ret8 := is_do_write_p_triggered(); {7275#true} is VALID [2022-02-20 19:57:07,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {7275#true} havoc ~__retres1~0; {7275#true} is VALID [2022-02-20 19:57:07,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {7275#true} assume !(1 == ~p_dw_pc~0); {7275#true} is VALID [2022-02-20 19:57:07,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {7275#true} ~__retres1~0 := 0; {7275#true} is VALID [2022-02-20 19:57:07,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {7275#true} #res := ~__retres1~0; {7275#true} is VALID [2022-02-20 19:57:07,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,352 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7275#true} {7275#true} #1013#return; {7275#true} is VALID [2022-02-20 19:57:07,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {7275#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7275#true} is VALID [2022-02-20 19:57:07,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {7275#true} assume !(0 != ~tmp~1); {7275#true} is VALID [2022-02-20 19:57:07,352 INFO L272 TraceCheckUtils]: 28: Hoare triple {7275#true} call #t~ret9 := is_do_read_c_triggered(); {7275#true} is VALID [2022-02-20 19:57:07,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {7275#true} havoc ~__retres1~1; {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {7275#true} assume !(1 == ~c_dr_pc~0); {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {7275#true} ~__retres1~1 := 0; {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {7275#true} #res := ~__retres1~1; {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7275#true} {7275#true} #1015#return; {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {7275#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {7275#true} assume !(0 != ~tmp___0~1); {7275#true} is VALID [2022-02-20 19:57:07,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,354 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7275#true} {7277#(= ~q_read_ev~0 2)} #1021#return; {7277#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:07,354 INFO L272 TraceCheckUtils]: 39: Hoare triple {7277#(= ~q_read_ev~0 2)} call reset_delta_events1(); {7317#(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,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {7317#(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; {7331#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:07,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {7331#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7331#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:07,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {7331#(= |old(~q_read_ev~0)| 1)} assume true; {7331#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:07,356 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7331#(= |old(~q_read_ev~0)| 1)} {7277#(= ~q_read_ev~0 2)} #1023#return; {7276#false} is VALID [2022-02-20 19:57:07,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {7276#false} assume !false; {7276#false} is VALID [2022-02-20 19:57:07,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {7276#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; {7276#false} is VALID [2022-02-20 19:57:07,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {7276#false} assume !false; {7276#false} is VALID [2022-02-20 19:57:07,357 INFO L272 TraceCheckUtils]: 47: Hoare triple {7276#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7275#true} is VALID [2022-02-20 19:57:07,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {7275#true} havoc ~__retres1~2; {7275#true} is VALID [2022-02-20 19:57:07,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {7275#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7275#true} is VALID [2022-02-20 19:57:07,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {7275#true} #res := ~__retres1~2; {7275#true} is VALID [2022-02-20 19:57:07,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {7275#true} assume true; {7275#true} is VALID [2022-02-20 19:57:07,357 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7275#true} {7276#false} #1025#return; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {7276#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; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {7276#false} assume 0 != eval1_~tmp___1~0#1; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {7276#false} assume !(0 == ~p_dw_st~0); {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {7276#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; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {7276#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; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {7276#false} assume 0 == ~c_dr_pc~0; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {7276#false} assume !false; {7276#false} is VALID [2022-02-20 19:57:07,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {7276#false} assume !(1 == ~q_free~0); {7276#false} is VALID [2022-02-20 19:57:07,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {7276#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; {7276#false} is VALID [2022-02-20 19:57:07,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {7276#false} assume !(~p_last_write~0 == ~c_last_read~0); {7276#false} is VALID [2022-02-20 19:57:07,359 INFO L272 TraceCheckUtils]: 63: Hoare triple {7276#false} call error1(); {7276#false} is VALID [2022-02-20 19:57:07,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {7276#false} assume !false; {7276#false} is VALID [2022-02-20 19:57:07,359 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,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:07,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144846896] [2022-02-20 19:57:07,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144846896] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:07,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:07,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:07,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512231986] [2022-02-20 19:57:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:07,361 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:57:07,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:07,363 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:57:07,398 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:07,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:07,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:07,400 INFO L87 Difference]: Start difference. First operand 400 states and 576 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,402 INFO L93 Difference]: Finished difference Result 748 states and 1057 transitions. [2022-02-20 19:57:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:57:09,402 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:57:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:09,403 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:57:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 744 transitions. [2022-02-20 19:57:09,431 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:57:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 744 transitions. [2022-02-20 19:57:09,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 744 transitions. [2022-02-20 19:57:09,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 744 edges. 744 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:09,910 INFO L225 Difference]: With dead ends: 748 [2022-02-20 19:57:09,910 INFO L226 Difference]: Without dead ends: 546 [2022-02-20 19:57:09,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:57:09,911 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 544 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:09,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1556 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:57:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-02-20 19:57:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 492. [2022-02-20 19:57:09,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:09,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand has 492 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 408 states have internal predecessors, (570), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2022-02-20 19:57:09,934 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand has 492 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 408 states have internal predecessors, (570), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2022-02-20 19:57:09,935 INFO L87 Difference]: Start difference. First operand 546 states. Second operand has 492 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 408 states have internal predecessors, (570), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2022-02-20 19:57:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,948 INFO L93 Difference]: Finished difference Result 546 states and 766 transitions. [2022-02-20 19:57:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 766 transitions. [2022-02-20 19:57:09,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:09,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:09,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 492 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 408 states have internal predecessors, (570), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) Second operand 546 states. [2022-02-20 19:57:09,951 INFO L87 Difference]: Start difference. First operand has 492 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 408 states have internal predecessors, (570), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) Second operand 546 states. [2022-02-20 19:57:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,965 INFO L93 Difference]: Finished difference Result 546 states and 766 transitions. [2022-02-20 19:57:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 766 transitions. [2022-02-20 19:57:09,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:09,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:09,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:09,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 408 states have internal predecessors, (570), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2022-02-20 19:57:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 695 transitions. [2022-02-20 19:57:09,981 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 695 transitions. Word has length 65 [2022-02-20 19:57:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:09,982 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 695 transitions. [2022-02-20 19:57:09,982 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:57:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 695 transitions. [2022-02-20 19:57:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:09,984 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:09,984 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:09,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:09,984 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2028039286, now seen corresponding path program 1 times [2022-02-20 19:57:09,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:09,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703920664] [2022-02-20 19:57:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {10159#(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); {10160#(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,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10160#(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,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1017#return; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {10160#(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); {10160#(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,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {10160#(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); {10160#(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,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10160#(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,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1019#return; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {10119#true} havoc ~__retres1~0; {10119#true} is VALID [2022-02-20 19:57:10,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} assume !(1 == ~p_dw_pc~0); {10119#true} is VALID [2022-02-20 19:57:10,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} ~__retres1~0 := 0; {10119#true} is VALID [2022-02-20 19:57:10,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {10119#true} #res := ~__retres1~0; {10119#true} is VALID [2022-02-20 19:57:10,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,064 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10119#true} {10119#true} #1013#return; {10119#true} is VALID [2022-02-20 19:57:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {10119#true} havoc ~__retres1~1; {10119#true} is VALID [2022-02-20 19:57:10,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} assume !(1 == ~c_dr_pc~0); {10119#true} is VALID [2022-02-20 19:57:10,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} ~__retres1~1 := 0; {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {10119#true} #res := ~__retres1~1; {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10119#true} {10119#true} #1015#return; {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {10161#(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; {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L272 TraceCheckUtils]: 1: Hoare triple {10119#true} call #t~ret8 := is_do_write_p_triggered(); {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} havoc ~__retres1~0; {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {10119#true} assume !(1 == ~p_dw_pc~0); {10119#true} is VALID [2022-02-20 19:57:10,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {10119#true} ~__retres1~0 := 0; {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {10119#true} #res := ~__retres1~0; {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10119#true} {10119#true} #1013#return; {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume !(0 != ~tmp~1); {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L272 TraceCheckUtils]: 10: Hoare triple {10119#true} call #t~ret9 := is_do_read_c_triggered(); {10119#true} is VALID [2022-02-20 19:57:10,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {10119#true} havoc ~__retres1~1; {10119#true} is VALID [2022-02-20 19:57:10,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} assume !(1 == ~c_dr_pc~0); {10119#true} is VALID [2022-02-20 19:57:10,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} ~__retres1~1 := 0; {10119#true} is VALID [2022-02-20 19:57:10,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} #res := ~__retres1~1; {10119#true} is VALID [2022-02-20 19:57:10,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,072 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10119#true} {10119#true} #1015#return; {10119#true} is VALID [2022-02-20 19:57:10,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {10119#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10119#true} is VALID [2022-02-20 19:57:10,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} assume !(0 != ~tmp___0~1); {10119#true} is VALID [2022-02-20 19:57:10,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,073 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10119#true} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1021#return; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {10160#(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); {10174#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:10,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {10174#(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; {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:10,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:10,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1023#return; {10120#false} is VALID [2022-02-20 19:57:10,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {10119#true} havoc ~__retres1~2; {10119#true} is VALID [2022-02-20 19:57:10,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10119#true} is VALID [2022-02-20 19:57:10,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} #res := ~__retres1~2; {10119#true} is VALID [2022-02-20 19:57:10,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,107 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10119#true} {10120#false} #1025#return; {10120#false} is VALID [2022-02-20 19:57:10,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {10119#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {10119#true} is VALID [2022-02-20 19:57:10,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {10119#true} is VALID [2022-02-20 19:57:10,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {10121#(= ~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; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {10159#(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,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {10159#(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); {10160#(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,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10160#(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,112 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1017#return; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,113 INFO L272 TraceCheckUtils]: 12: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {10160#(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,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {10160#(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); {10160#(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,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {10160#(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); {10160#(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,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10160#(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,115 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10160#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1019#return; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,115 INFO L272 TraceCheckUtils]: 17: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {10161#(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,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {10161#(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; {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L272 TraceCheckUtils]: 19: Hoare triple {10119#true} call #t~ret8 := is_do_write_p_triggered(); {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} havoc ~__retres1~0; {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {10119#true} assume !(1 == ~p_dw_pc~0); {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {10119#true} ~__retres1~0 := 0; {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} #res := ~__retres1~0; {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10119#true} {10119#true} #1013#return; {10119#true} is VALID [2022-02-20 19:57:10,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {10119#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {10119#true} assume !(0 != ~tmp~1); {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L272 TraceCheckUtils]: 28: Hoare triple {10119#true} call #t~ret9 := is_do_read_c_triggered(); {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {10119#true} havoc ~__retres1~1; {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {10119#true} assume !(1 == ~c_dr_pc~0); {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {10119#true} ~__retres1~1 := 0; {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {10119#true} #res := ~__retres1~1; {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10119#true} {10119#true} #1015#return; {10119#true} is VALID [2022-02-20 19:57:10,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10119#true} is VALID [2022-02-20 19:57:10,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {10119#true} assume !(0 != ~tmp___0~1); {10119#true} is VALID [2022-02-20 19:57:10,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,120 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10119#true} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1021#return; {10121#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,120 INFO L272 TraceCheckUtils]: 39: Hoare triple {10121#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {10160#(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,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {10160#(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); {10174#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:10,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {10174#(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; {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:10,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:10,122 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10175#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {10121#(= ~q_write_ev~0 ~q_read_ev~0)} #1023#return; {10120#false} is VALID [2022-02-20 19:57:10,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-02-20 19:57:10,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {10120#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; {10120#false} is VALID [2022-02-20 19:57:10,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-02-20 19:57:10,122 INFO L272 TraceCheckUtils]: 47: Hoare triple {10120#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10119#true} is VALID [2022-02-20 19:57:10,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} havoc ~__retres1~2; {10119#true} is VALID [2022-02-20 19:57:10,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10119#true} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} #res := ~__retres1~2; {10119#true} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-02-20 19:57:10,123 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10119#true} {10120#false} #1025#return; {10120#false} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {10120#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; {10120#false} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {10120#false} assume 0 != eval1_~tmp___1~0#1; {10120#false} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {10120#false} assume !(0 == ~p_dw_st~0); {10120#false} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 56: Hoare triple {10120#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; {10120#false} is VALID [2022-02-20 19:57:10,123 INFO L290 TraceCheckUtils]: 57: Hoare triple {10120#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; {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L290 TraceCheckUtils]: 58: Hoare triple {10120#false} assume 0 == ~c_dr_pc~0; {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {10120#false} assume !(1 == ~q_free~0); {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L290 TraceCheckUtils]: 61: Hoare triple {10120#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; {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L290 TraceCheckUtils]: 62: Hoare triple {10120#false} assume !(~p_last_write~0 == ~c_last_read~0); {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L272 TraceCheckUtils]: 63: Hoare triple {10120#false} call error1(); {10120#false} is VALID [2022-02-20 19:57:10,124 INFO L290 TraceCheckUtils]: 64: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-02-20 19:57:10,124 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,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:10,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703920664] [2022-02-20 19:57:10,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703920664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:10,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:10,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:10,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518395905] [2022-02-20 19:57:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:10,127 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:10,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:10,127 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:10,160 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:10,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:10,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:10,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:10,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:10,162 INFO L87 Difference]: Start difference. First operand 492 states and 695 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:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,590 INFO L93 Difference]: Finished difference Result 884 states and 1206 transitions. [2022-02-20 19:57:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:12,590 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:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:12,591 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:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 750 transitions. [2022-02-20 19:57:12,596 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:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 750 transitions. [2022-02-20 19:57:12,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 750 transitions. [2022-02-20 19:57:13,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:13,181 INFO L225 Difference]: With dead ends: 884 [2022-02-20 19:57:13,181 INFO L226 Difference]: Without dead ends: 599 [2022-02-20 19:57:13,182 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:13,183 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 807 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:13,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [830 Valid, 1441 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-20 19:57:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 504. [2022-02-20 19:57:13,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:13,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 599 states. Second operand has 504 states, 409 states have (on average 1.4180929095354524) internal successors, (580), 418 states have internal predecessors, (580), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2022-02-20 19:57:13,213 INFO L74 IsIncluded]: Start isIncluded. First operand 599 states. Second operand has 504 states, 409 states have (on average 1.4180929095354524) internal successors, (580), 418 states have internal predecessors, (580), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2022-02-20 19:57:13,214 INFO L87 Difference]: Start difference. First operand 599 states. Second operand has 504 states, 409 states have (on average 1.4180929095354524) internal successors, (580), 418 states have internal predecessors, (580), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2022-02-20 19:57:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,229 INFO L93 Difference]: Finished difference Result 599 states and 826 transitions. [2022-02-20 19:57:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 826 transitions. [2022-02-20 19:57:13,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 409 states have (on average 1.4180929095354524) internal successors, (580), 418 states have internal predecessors, (580), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) Second operand 599 states. [2022-02-20 19:57:13,232 INFO L87 Difference]: Start difference. First operand has 504 states, 409 states have (on average 1.4180929095354524) internal successors, (580), 418 states have internal predecessors, (580), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) Second operand 599 states. [2022-02-20 19:57:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,248 INFO L93 Difference]: Finished difference Result 599 states and 826 transitions. [2022-02-20 19:57:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 826 transitions. [2022-02-20 19:57:13,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:13,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 409 states have (on average 1.4180929095354524) internal successors, (580), 418 states have internal predecessors, (580), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2022-02-20 19:57:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 705 transitions. [2022-02-20 19:57:13,265 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 705 transitions. Word has length 65 [2022-02-20 19:57:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:13,265 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 705 transitions. [2022-02-20 19:57:13,265 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:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 705 transitions. [2022-02-20 19:57:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:13,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:13,266 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:13,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:13,267 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2132914504, now seen corresponding path program 1 times [2022-02-20 19:57:13,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:13,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774073036] [2022-02-20 19:57:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {13304#(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); {13264#true} is VALID [2022-02-20 19:57:13,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13264#true} {13264#true} #1017#return; {13264#true} is VALID [2022-02-20 19:57:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {13305#(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); {13264#true} is VALID [2022-02-20 19:57:13,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume !(0 == ~q_write_ev~0); {13264#true} is VALID [2022-02-20 19:57:13,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13264#true} {13269#(= ~p_dw_st~0 0)} #1019#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {13264#true} havoc ~__retres1~0; {13264#true} is VALID [2022-02-20 19:57:13,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume !(1 == ~p_dw_pc~0); {13264#true} is VALID [2022-02-20 19:57:13,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {13264#true} ~__retres1~0 := 0; {13264#true} is VALID [2022-02-20 19:57:13,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {13264#true} #res := ~__retres1~0; {13264#true} is VALID [2022-02-20 19:57:13,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,349 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13264#true} {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1013#return; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {13264#true} havoc ~__retres1~1; {13264#true} is VALID [2022-02-20 19:57:13,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume !(1 == ~c_dr_pc~0); {13264#true} is VALID [2022-02-20 19:57:13,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {13264#true} ~__retres1~1 := 0; {13264#true} is VALID [2022-02-20 19:57:13,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {13264#true} #res := ~__retres1~1; {13264#true} is VALID [2022-02-20 19:57:13,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,355 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13264#true} {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1015#return; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {13306#(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; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,356 INFO L272 TraceCheckUtils]: 1: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {13264#true} is VALID [2022-02-20 19:57:13,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {13264#true} havoc ~__retres1~0; {13264#true} is VALID [2022-02-20 19:57:13,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {13264#true} assume !(1 == ~p_dw_pc~0); {13264#true} is VALID [2022-02-20 19:57:13,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {13264#true} ~__retres1~0 := 0; {13264#true} is VALID [2022-02-20 19:57:13,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {13264#true} #res := ~__retres1~0; {13264#true} is VALID [2022-02-20 19:57:13,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,357 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13264#true} {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1013#return; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,357 INFO L272 TraceCheckUtils]: 10: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {13264#true} is VALID [2022-02-20 19:57:13,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {13264#true} havoc ~__retres1~1; {13264#true} is VALID [2022-02-20 19:57:13,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {13264#true} assume !(1 == ~c_dr_pc~0); {13264#true} is VALID [2022-02-20 19:57:13,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {13264#true} ~__retres1~1 := 0; {13264#true} is VALID [2022-02-20 19:57:13,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {13264#true} #res := ~__retres1~1; {13264#true} is VALID [2022-02-20 19:57:13,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,358 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13264#true} {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1015#return; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,360 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {13269#(= ~p_dw_st~0 0)} #1021#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {13305#(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); {13264#true} is VALID [2022-02-20 19:57:13,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume !(1 == ~q_write_ev~0); {13264#true} is VALID [2022-02-20 19:57:13,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13264#true} {13269#(= ~p_dw_st~0 0)} #1023#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {13264#true} havoc ~__retres1~2; {13264#true} is VALID [2022-02-20 19:57:13,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {13269#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {13269#(= ~p_dw_st~0 0)} assume true; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,371 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13269#(= ~p_dw_st~0 0)} {13269#(= ~p_dw_st~0 0)} #1025#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {13264#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {13264#true} is VALID [2022-02-20 19:57:13,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {13264#true} is VALID [2022-02-20 19:57:13,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {13264#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {13264#true} is VALID [2022-02-20 19:57:13,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {13264#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; {13264#true} is VALID [2022-02-20 19:57:13,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {13264#true} call update_channels1(); {13304#(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,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {13304#(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); {13264#true} is VALID [2022-02-20 19:57:13,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,373 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13264#true} {13264#true} #1017#return; {13264#true} is VALID [2022-02-20 19:57:13,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {13264#true} assume { :begin_inline_init_threads1 } true; {13264#true} is VALID [2022-02-20 19:57:13,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {13264#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {13269#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {13269#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,374 INFO L272 TraceCheckUtils]: 12: Hoare triple {13269#(= ~p_dw_st~0 0)} call fire_delta_events1(); {13305#(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,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {13305#(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); {13264#true} is VALID [2022-02-20 19:57:13,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {13264#true} assume !(0 == ~q_write_ev~0); {13264#true} is VALID [2022-02-20 19:57:13,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,375 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13264#true} {13269#(= ~p_dw_st~0 0)} #1019#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,375 INFO L272 TraceCheckUtils]: 17: Hoare triple {13269#(= ~p_dw_st~0 0)} call activate_threads1(); {13306#(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,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {13306#(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; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,376 INFO L272 TraceCheckUtils]: 19: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {13264#true} is VALID [2022-02-20 19:57:13,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {13264#true} havoc ~__retres1~0; {13264#true} is VALID [2022-02-20 19:57:13,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {13264#true} assume !(1 == ~p_dw_pc~0); {13264#true} is VALID [2022-02-20 19:57:13,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {13264#true} ~__retres1~0 := 0; {13264#true} is VALID [2022-02-20 19:57:13,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {13264#true} #res := ~__retres1~0; {13264#true} is VALID [2022-02-20 19:57:13,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,377 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13264#true} {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1013#return; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,377 INFO L272 TraceCheckUtils]: 28: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {13264#true} is VALID [2022-02-20 19:57:13,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {13264#true} havoc ~__retres1~1; {13264#true} is VALID [2022-02-20 19:57:13,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {13264#true} assume !(1 == ~c_dr_pc~0); {13264#true} is VALID [2022-02-20 19:57:13,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {13264#true} ~__retres1~1 := 0; {13264#true} is VALID [2022-02-20 19:57:13,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {13264#true} #res := ~__retres1~1; {13264#true} is VALID [2022-02-20 19:57:13,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,378 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13264#true} {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1015#return; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:13,380 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13307#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {13269#(= ~p_dw_st~0 0)} #1021#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,380 INFO L272 TraceCheckUtils]: 39: Hoare triple {13269#(= ~p_dw_st~0 0)} call reset_delta_events1(); {13305#(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,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {13305#(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); {13264#true} is VALID [2022-02-20 19:57:13,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {13264#true} assume !(1 == ~q_write_ev~0); {13264#true} is VALID [2022-02-20 19:57:13,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-02-20 19:57:13,381 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13264#true} {13269#(= ~p_dw_st~0 0)} #1023#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {13269#(= ~p_dw_st~0 0)} assume !false; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {13269#(= ~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; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {13269#(= ~p_dw_st~0 0)} assume !false; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,382 INFO L272 TraceCheckUtils]: 47: Hoare triple {13269#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13264#true} is VALID [2022-02-20 19:57:13,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {13264#true} havoc ~__retres1~2; {13264#true} is VALID [2022-02-20 19:57:13,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {13264#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {13269#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {13269#(= ~p_dw_st~0 0)} assume true; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,383 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13269#(= ~p_dw_st~0 0)} {13269#(= ~p_dw_st~0 0)} #1025#return; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {13269#(= ~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; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {13269#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {13269#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:13,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {13269#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {13265#false} is VALID [2022-02-20 19:57:13,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {13265#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; {13265#false} is VALID [2022-02-20 19:57:13,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {13265#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; {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {13265#false} assume 0 == ~c_dr_pc~0; {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L290 TraceCheckUtils]: 60: Hoare triple {13265#false} assume !(1 == ~q_free~0); {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L290 TraceCheckUtils]: 61: Hoare triple {13265#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; {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L290 TraceCheckUtils]: 62: Hoare triple {13265#false} assume !(~p_last_write~0 == ~c_last_read~0); {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L272 TraceCheckUtils]: 63: Hoare triple {13265#false} call error1(); {13265#false} is VALID [2022-02-20 19:57:13,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2022-02-20 19:57:13,386 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,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774073036] [2022-02-20 19:57:13,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774073036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:13,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:13,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:13,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945127938] [2022-02-20 19:57:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:13,387 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:13,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:13,387 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:13,425 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:13,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:13,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:13,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:13,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:13,426 INFO L87 Difference]: Start difference. First operand 504 states and 705 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:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:14,894 INFO L93 Difference]: Finished difference Result 1146 states and 1552 transitions. [2022-02-20 19:57:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:14,894 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:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:14,894 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:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 693 transitions. [2022-02-20 19:57:14,899 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:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 693 transitions. [2022-02-20 19:57:14,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 693 transitions. [2022-02-20 19:57:15,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:15,430 INFO L225 Difference]: With dead ends: 1146 [2022-02-20 19:57:15,430 INFO L226 Difference]: Without dead ends: 850 [2022-02-20 19:57:15,431 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:15,432 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 774 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:15,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [799 Valid, 1167 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-02-20 19:57:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 794. [2022-02-20 19:57:15,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:15,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 850 states. Second operand has 794 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 649 states have internal predecessors, (867), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2022-02-20 19:57:15,475 INFO L74 IsIncluded]: Start isIncluded. First operand 850 states. Second operand has 794 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 649 states have internal predecessors, (867), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2022-02-20 19:57:15,476 INFO L87 Difference]: Start difference. First operand 850 states. Second operand has 794 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 649 states have internal predecessors, (867), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2022-02-20 19:57:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:15,504 INFO L93 Difference]: Finished difference Result 850 states and 1158 transitions. [2022-02-20 19:57:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1158 transitions. [2022-02-20 19:57:15,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:15,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:15,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 794 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 649 states have internal predecessors, (867), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) Second operand 850 states. [2022-02-20 19:57:15,509 INFO L87 Difference]: Start difference. First operand has 794 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 649 states have internal predecessors, (867), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) Second operand 850 states. [2022-02-20 19:57:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:15,538 INFO L93 Difference]: Finished difference Result 850 states and 1158 transitions. [2022-02-20 19:57:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1158 transitions. [2022-02-20 19:57:15,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:15,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:15,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:15,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 649 states have internal predecessors, (867), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2022-02-20 19:57:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1084 transitions. [2022-02-20 19:57:15,571 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1084 transitions. Word has length 65 [2022-02-20 19:57:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:15,571 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1084 transitions. [2022-02-20 19:57:15,571 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:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1084 transitions. [2022-02-20 19:57:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:15,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:15,573 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:15,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:15,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1916035770, now seen corresponding path program 1 times [2022-02-20 19:57:15,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:15,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546476293] [2022-02-20 19:57:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {17695#(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); {17655#true} is VALID [2022-02-20 19:57:15,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1017#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {17696#(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); {17655#true} is VALID [2022-02-20 19:57:15,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume !(0 == ~q_write_ev~0); {17655#true} is VALID [2022-02-20 19:57:15,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1019#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {17655#true} havoc ~__retres1~0; {17655#true} is VALID [2022-02-20 19:57:15,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume !(1 == ~p_dw_pc~0); {17655#true} is VALID [2022-02-20 19:57:15,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} ~__retres1~0 := 0; {17655#true} is VALID [2022-02-20 19:57:15,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {17655#true} #res := ~__retres1~0; {17655#true} is VALID [2022-02-20 19:57:15,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,633 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17655#true} {17655#true} #1013#return; {17655#true} is VALID [2022-02-20 19:57:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {17655#true} havoc ~__retres1~1; {17655#true} is VALID [2022-02-20 19:57:15,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume !(1 == ~c_dr_pc~0); {17655#true} is VALID [2022-02-20 19:57:15,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} ~__retres1~1 := 0; {17655#true} is VALID [2022-02-20 19:57:15,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {17655#true} #res := ~__retres1~1; {17655#true} is VALID [2022-02-20 19:57:15,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,636 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17655#true} {17655#true} #1015#return; {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {17697#(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; {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L272 TraceCheckUtils]: 1: Hoare triple {17655#true} call #t~ret8 := is_do_write_p_triggered(); {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} havoc ~__retres1~0; {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {17655#true} assume !(1 == ~p_dw_pc~0); {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {17655#true} ~__retres1~0 := 0; {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {17655#true} #res := ~__retres1~0; {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,637 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17655#true} {17655#true} #1013#return; {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {17655#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {17655#true} assume !(0 != ~tmp~1); {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L272 TraceCheckUtils]: 10: Hoare triple {17655#true} call #t~ret9 := is_do_read_c_triggered(); {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {17655#true} havoc ~__retres1~1; {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {17655#true} assume !(1 == ~c_dr_pc~0); {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {17655#true} ~__retres1~1 := 0; {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {17655#true} #res := ~__retres1~1; {17655#true} is VALID [2022-02-20 19:57:15,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,639 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17655#true} {17655#true} #1015#return; {17655#true} is VALID [2022-02-20 19:57:15,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {17655#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17655#true} is VALID [2022-02-20 19:57:15,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {17655#true} assume !(0 != ~tmp___0~1); {17655#true} is VALID [2022-02-20 19:57:15,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,639 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1021#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {17696#(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); {17655#true} is VALID [2022-02-20 19:57:15,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume !(1 == ~q_write_ev~0); {17655#true} is VALID [2022-02-20 19:57:15,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1023#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:15,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {17655#true} havoc ~__retres1~2; {17655#true} is VALID [2022-02-20 19:57:15,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17655#true} is VALID [2022-02-20 19:57:15,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} #res := ~__retres1~2; {17655#true} is VALID [2022-02-20 19:57:15,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,650 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1025#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {17655#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {17655#true} is VALID [2022-02-20 19:57:15,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {17655#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {17655#true} is VALID [2022-02-20 19:57:15,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {17655#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {17657#(= ~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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {17657#(= ~q_free~0 1)} call update_channels1(); {17695#(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:15,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {17695#(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); {17655#true} is VALID [2022-02-20 19:57:15,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,652 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1017#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {17657#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {17657#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {17657#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {17657#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,653 INFO L272 TraceCheckUtils]: 12: Hoare triple {17657#(= ~q_free~0 1)} call fire_delta_events1(); {17696#(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:15,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {17696#(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); {17655#true} is VALID [2022-02-20 19:57:15,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {17655#true} assume !(0 == ~q_write_ev~0); {17655#true} is VALID [2022-02-20 19:57:15,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,654 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1019#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,654 INFO L272 TraceCheckUtils]: 17: Hoare triple {17657#(= ~q_free~0 1)} call activate_threads1(); {17697#(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:15,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {17697#(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; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L272 TraceCheckUtils]: 19: Hoare triple {17655#true} call #t~ret8 := is_do_write_p_triggered(); {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {17655#true} havoc ~__retres1~0; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {17655#true} assume !(1 == ~p_dw_pc~0); {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {17655#true} ~__retres1~0 := 0; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {17655#true} #res := ~__retres1~0; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17655#true} {17655#true} #1013#return; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {17655#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17655#true} is VALID [2022-02-20 19:57:15,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {17655#true} assume !(0 != ~tmp~1); {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L272 TraceCheckUtils]: 28: Hoare triple {17655#true} call #t~ret9 := is_do_read_c_triggered(); {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {17655#true} havoc ~__retres1~1; {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {17655#true} assume !(1 == ~c_dr_pc~0); {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {17655#true} ~__retres1~1 := 0; {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {17655#true} #res := ~__retres1~1; {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17655#true} {17655#true} #1015#return; {17655#true} is VALID [2022-02-20 19:57:15,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {17655#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17655#true} is VALID [2022-02-20 19:57:15,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {17655#true} assume !(0 != ~tmp___0~1); {17655#true} is VALID [2022-02-20 19:57:15,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,657 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1021#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,657 INFO L272 TraceCheckUtils]: 39: Hoare triple {17657#(= ~q_free~0 1)} call reset_delta_events1(); {17696#(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:15,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {17696#(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); {17655#true} is VALID [2022-02-20 19:57:15,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {17655#true} assume !(1 == ~q_write_ev~0); {17655#true} is VALID [2022-02-20 19:57:15,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,658 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1023#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {17657#(= ~q_free~0 1)} assume !false; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {17657#(= ~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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {17657#(= ~q_free~0 1)} assume !false; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,659 INFO L272 TraceCheckUtils]: 47: Hoare triple {17657#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17655#true} is VALID [2022-02-20 19:57:15,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {17655#true} havoc ~__retres1~2; {17655#true} is VALID [2022-02-20 19:57:15,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {17655#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17655#true} is VALID [2022-02-20 19:57:15,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {17655#true} #res := ~__retres1~2; {17655#true} is VALID [2022-02-20 19:57:15,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {17655#true} assume true; {17655#true} is VALID [2022-02-20 19:57:15,660 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17655#true} {17657#(= ~q_free~0 1)} #1025#return; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {17657#(= ~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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {17657#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {17657#(= ~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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {17657#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {17657#(= ~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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {17657#(= ~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; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {17657#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {17657#(= ~q_free~0 1)} assume !false; {17657#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:15,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {17657#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {17656#false} is VALID [2022-02-20 19:57:15,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {17656#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; {17656#false} is VALID [2022-02-20 19:57:15,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {17656#false} assume !(~p_last_write~0 == ~c_last_read~0); {17656#false} is VALID [2022-02-20 19:57:15,667 INFO L272 TraceCheckUtils]: 64: Hoare triple {17656#false} call error1(); {17656#false} is VALID [2022-02-20 19:57:15,667 INFO L290 TraceCheckUtils]: 65: Hoare triple {17656#false} assume !false; {17656#false} is VALID [2022-02-20 19:57:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:15,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:15,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546476293] [2022-02-20 19:57:15,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546476293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:15,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:15,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:15,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741337961] [2022-02-20 19:57:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:15,669 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:15,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:15,670 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:15,708 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:15,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:15,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:15,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:15,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:15,710 INFO L87 Difference]: Start difference. First operand 794 states and 1084 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:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:17,142 INFO L93 Difference]: Finished difference Result 1997 states and 2655 transitions. [2022-02-20 19:57:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:17,143 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:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:17,144 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:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 691 transitions. [2022-02-20 19:57:17,148 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:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 691 transitions. [2022-02-20 19:57:17,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 691 transitions. [2022-02-20 19:57:17,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 691 edges. 691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:17,701 INFO L225 Difference]: With dead ends: 1997 [2022-02-20 19:57:17,701 INFO L226 Difference]: Without dead ends: 1390 [2022-02-20 19:57:17,703 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:17,703 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 713 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:17,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 947 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-02-20 19:57:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1275. [2022-02-20 19:57:17,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:17,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1390 states. Second operand has 1275 states, 1012 states have (on average 1.33201581027668) internal successors, (1348), 1031 states have internal predecessors, (1348), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) [2022-02-20 19:57:17,781 INFO L74 IsIncluded]: Start isIncluded. First operand 1390 states. Second operand has 1275 states, 1012 states have (on average 1.33201581027668) internal successors, (1348), 1031 states have internal predecessors, (1348), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) [2022-02-20 19:57:17,782 INFO L87 Difference]: Start difference. First operand 1390 states. Second operand has 1275 states, 1012 states have (on average 1.33201581027668) internal successors, (1348), 1031 states have internal predecessors, (1348), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) [2022-02-20 19:57:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:17,837 INFO L93 Difference]: Finished difference Result 1390 states and 1817 transitions. [2022-02-20 19:57:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1817 transitions. [2022-02-20 19:57:17,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:17,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:17,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 1275 states, 1012 states have (on average 1.33201581027668) internal successors, (1348), 1031 states have internal predecessors, (1348), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) Second operand 1390 states. [2022-02-20 19:57:17,859 INFO L87 Difference]: Start difference. First operand has 1275 states, 1012 states have (on average 1.33201581027668) internal successors, (1348), 1031 states have internal predecessors, (1348), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) Second operand 1390 states. [2022-02-20 19:57:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:17,915 INFO L93 Difference]: Finished difference Result 1390 states and 1817 transitions. [2022-02-20 19:57:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1817 transitions. [2022-02-20 19:57:17,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:17,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:17,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:17,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1012 states have (on average 1.33201581027668) internal successors, (1348), 1031 states have internal predecessors, (1348), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) [2022-02-20 19:57:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1682 transitions. [2022-02-20 19:57:17,984 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1682 transitions. Word has length 66 [2022-02-20 19:57:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:17,985 INFO L470 AbstractCegarLoop]: Abstraction has 1275 states and 1682 transitions. [2022-02-20 19:57:17,985 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:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1682 transitions. [2022-02-20 19:57:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:17,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:17,986 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:17,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:17,987 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -457796111, now seen corresponding path program 1 times [2022-02-20 19:57:17,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:17,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081537539] [2022-02-20 19:57:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {24927#(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); {24887#true} is VALID [2022-02-20 19:57:18,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1017#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {24928#(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); {24887#true} is VALID [2022-02-20 19:57:18,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume !(0 == ~q_write_ev~0); {24887#true} is VALID [2022-02-20 19:57:18,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1019#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {24887#true} havoc ~__retres1~0; {24887#true} is VALID [2022-02-20 19:57:18,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume !(1 == ~p_dw_pc~0); {24887#true} is VALID [2022-02-20 19:57:18,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} ~__retres1~0 := 0; {24887#true} is VALID [2022-02-20 19:57:18,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {24887#true} #res := ~__retres1~0; {24887#true} is VALID [2022-02-20 19:57:18,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,032 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24887#true} {24887#true} #1013#return; {24887#true} is VALID [2022-02-20 19:57:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {24887#true} havoc ~__retres1~1; {24887#true} is VALID [2022-02-20 19:57:18,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume !(1 == ~c_dr_pc~0); {24887#true} is VALID [2022-02-20 19:57:18,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} ~__retres1~1 := 0; {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {24887#true} #res := ~__retres1~1; {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24887#true} {24887#true} #1015#return; {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {24929#(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; {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L272 TraceCheckUtils]: 1: Hoare triple {24887#true} call #t~ret8 := is_do_write_p_triggered(); {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} havoc ~__retres1~0; {24887#true} is VALID [2022-02-20 19:57:18,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {24887#true} assume !(1 == ~p_dw_pc~0); {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {24887#true} ~__retres1~0 := 0; {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {24887#true} #res := ~__retres1~0; {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24887#true} {24887#true} #1013#return; {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {24887#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {24887#true} assume !(0 != ~tmp~1); {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L272 TraceCheckUtils]: 10: Hoare triple {24887#true} call #t~ret9 := is_do_read_c_triggered(); {24887#true} is VALID [2022-02-20 19:57:18,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {24887#true} havoc ~__retres1~1; {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {24887#true} assume !(1 == ~c_dr_pc~0); {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {24887#true} ~__retres1~1 := 0; {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {24887#true} #res := ~__retres1~1; {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {24887#true} {24887#true} #1015#return; {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {24887#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {24887#true} assume !(0 != ~tmp___0~1); {24887#true} is VALID [2022-02-20 19:57:18,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,041 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1021#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {24928#(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); {24887#true} is VALID [2022-02-20 19:57:18,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume !(1 == ~q_write_ev~0); {24887#true} is VALID [2022-02-20 19:57:18,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1023#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {24887#true} havoc ~__retres1~2; {24887#true} is VALID [2022-02-20 19:57:18,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {24887#true} is VALID [2022-02-20 19:57:18,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} #res := ~__retres1~2; {24887#true} is VALID [2022-02-20 19:57:18,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,050 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1025#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {24887#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {24887#true} is VALID [2022-02-20 19:57:18,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {24887#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {24887#true} is VALID [2022-02-20 19:57:18,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {24887#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {24889#(= ~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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {24889#(= ~c_dr_pc~0 0)} call update_channels1(); {24927#(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,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {24927#(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); {24887#true} is VALID [2022-02-20 19:57:18,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,052 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1017#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {24889#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {24928#(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,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {24928#(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); {24887#true} is VALID [2022-02-20 19:57:18,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {24887#true} assume !(0 == ~q_write_ev~0); {24887#true} is VALID [2022-02-20 19:57:18,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,054 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1019#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,054 INFO L272 TraceCheckUtils]: 17: Hoare triple {24889#(= ~c_dr_pc~0 0)} call activate_threads1(); {24929#(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,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {24929#(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; {24887#true} is VALID [2022-02-20 19:57:18,054 INFO L272 TraceCheckUtils]: 19: Hoare triple {24887#true} call #t~ret8 := is_do_write_p_triggered(); {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {24887#true} havoc ~__retres1~0; {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {24887#true} assume !(1 == ~p_dw_pc~0); {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {24887#true} ~__retres1~0 := 0; {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {24887#true} #res := ~__retres1~0; {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24887#true} {24887#true} #1013#return; {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {24887#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {24887#true} assume !(0 != ~tmp~1); {24887#true} is VALID [2022-02-20 19:57:18,055 INFO L272 TraceCheckUtils]: 28: Hoare triple {24887#true} call #t~ret9 := is_do_read_c_triggered(); {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {24887#true} havoc ~__retres1~1; {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {24887#true} assume !(1 == ~c_dr_pc~0); {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {24887#true} ~__retres1~1 := 0; {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {24887#true} #res := ~__retres1~1; {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {24887#true} {24887#true} #1015#return; {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {24887#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {24887#true} is VALID [2022-02-20 19:57:18,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {24887#true} assume !(0 != ~tmp___0~1); {24887#true} is VALID [2022-02-20 19:57:18,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,057 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1021#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,057 INFO L272 TraceCheckUtils]: 39: Hoare triple {24889#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {24928#(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,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {24928#(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); {24887#true} is VALID [2022-02-20 19:57:18,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {24887#true} assume !(1 == ~q_write_ev~0); {24887#true} is VALID [2022-02-20 19:57:18,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,058 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1023#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume !false; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {24889#(= ~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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume !false; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,059 INFO L272 TraceCheckUtils]: 47: Hoare triple {24889#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {24887#true} is VALID [2022-02-20 19:57:18,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {24887#true} havoc ~__retres1~2; {24887#true} is VALID [2022-02-20 19:57:18,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {24887#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {24887#true} is VALID [2022-02-20 19:57:18,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {24887#true} #res := ~__retres1~2; {24887#true} is VALID [2022-02-20 19:57:18,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {24887#true} assume true; {24887#true} is VALID [2022-02-20 19:57:18,060 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {24887#true} {24889#(= ~c_dr_pc~0 0)} #1025#return; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {24889#(= ~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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {24889#(= ~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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {24889#(= ~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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {24889#(= ~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; {24889#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:18,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {24889#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {24888#false} is VALID [2022-02-20 19:57:18,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {24888#false} assume 1 == ~c_dr_pc~0; {24888#false} is VALID [2022-02-20 19:57:18,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {24888#false} do_read_c_~a~0#1 := ~a_t~0; {24888#false} is VALID [2022-02-20 19:57:18,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {24888#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; {24888#false} is VALID [2022-02-20 19:57:18,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {24888#false} assume !(~p_last_write~0 == ~c_last_read~0); {24888#false} is VALID [2022-02-20 19:57:18,062 INFO L272 TraceCheckUtils]: 64: Hoare triple {24888#false} call error1(); {24888#false} is VALID [2022-02-20 19:57:18,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {24888#false} assume !false; {24888#false} is VALID [2022-02-20 19:57:18,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:18,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:18,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081537539] [2022-02-20 19:57:18,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081537539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:18,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:18,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:18,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427556752] [2022-02-20 19:57:18,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:18,064 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:18,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:18,064 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:18,093 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:18,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:18,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:18,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:18,095 INFO L87 Difference]: Start difference. First operand 1275 states and 1682 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:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,865 INFO L93 Difference]: Finished difference Result 3463 states and 4488 transitions. [2022-02-20 19:57:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:19,865 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:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:19,865 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:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 689 transitions. [2022-02-20 19:57:19,869 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:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 689 transitions. [2022-02-20 19:57:19,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 689 transitions. [2022-02-20 19:57:20,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 689 edges. 689 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:20,588 INFO L225 Difference]: With dead ends: 3463 [2022-02-20 19:57:20,588 INFO L226 Difference]: Without dead ends: 2395 [2022-02-20 19:57:20,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:57:20,591 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 775 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:20,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 988 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2022-02-20 19:57:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2137. [2022-02-20 19:57:20,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:20,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2395 states. Second operand has 2137 states, 1678 states have (on average 1.296185935637664) internal successors, (2175), 1707 states have internal predecessors, (2175), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2022-02-20 19:57:20,761 INFO L74 IsIncluded]: Start isIncluded. First operand 2395 states. Second operand has 2137 states, 1678 states have (on average 1.296185935637664) internal successors, (2175), 1707 states have internal predecessors, (2175), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2022-02-20 19:57:20,765 INFO L87 Difference]: Start difference. First operand 2395 states. Second operand has 2137 states, 1678 states have (on average 1.296185935637664) internal successors, (2175), 1707 states have internal predecessors, (2175), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2022-02-20 19:57:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:20,956 INFO L93 Difference]: Finished difference Result 2395 states and 3043 transitions. [2022-02-20 19:57:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3043 transitions. [2022-02-20 19:57:20,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:20,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:20,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 2137 states, 1678 states have (on average 1.296185935637664) internal successors, (2175), 1707 states have internal predecessors, (2175), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) Second operand 2395 states. [2022-02-20 19:57:20,965 INFO L87 Difference]: Start difference. First operand has 2137 states, 1678 states have (on average 1.296185935637664) internal successors, (2175), 1707 states have internal predecessors, (2175), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) Second operand 2395 states. [2022-02-20 19:57:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,125 INFO L93 Difference]: Finished difference Result 2395 states and 3043 transitions. [2022-02-20 19:57:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3043 transitions. [2022-02-20 19:57:21,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:21,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 1678 states have (on average 1.296185935637664) internal successors, (2175), 1707 states have internal predecessors, (2175), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2022-02-20 19:57:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2743 transitions. [2022-02-20 19:57:21,333 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2743 transitions. Word has length 66 [2022-02-20 19:57:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:21,333 INFO L470 AbstractCegarLoop]: Abstraction has 2137 states and 2743 transitions. [2022-02-20 19:57:21,333 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:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2743 transitions. [2022-02-20 19:57:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:21,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:21,336 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:21,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:21,337 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash 721355205, now seen corresponding path program 1 times [2022-02-20 19:57:21,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:21,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294974068] [2022-02-20 19:57:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {37278#(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); {37238#true} is VALID [2022-02-20 19:57:21,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1017#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {37279#(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); {37238#true} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume !(0 == ~q_write_ev~0); {37238#true} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1019#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {37238#true} havoc ~__retres1~0; {37238#true} is VALID [2022-02-20 19:57:21,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume !(1 == ~p_dw_pc~0); {37238#true} is VALID [2022-02-20 19:57:21,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} ~__retres1~0 := 0; {37238#true} is VALID [2022-02-20 19:57:21,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {37238#true} #res := ~__retres1~0; {37238#true} is VALID [2022-02-20 19:57:21,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,392 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {37238#true} {37238#true} #1013#return; {37238#true} is VALID [2022-02-20 19:57:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {37238#true} havoc ~__retres1~1; {37238#true} is VALID [2022-02-20 19:57:21,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume !(1 == ~c_dr_pc~0); {37238#true} is VALID [2022-02-20 19:57:21,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} ~__retres1~1 := 0; {37238#true} is VALID [2022-02-20 19:57:21,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {37238#true} #res := ~__retres1~1; {37238#true} is VALID [2022-02-20 19:57:21,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,395 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {37238#true} {37238#true} #1015#return; {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {37280#(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; {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L272 TraceCheckUtils]: 1: Hoare triple {37238#true} call #t~ret8 := is_do_write_p_triggered(); {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} havoc ~__retres1~0; {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {37238#true} assume !(1 == ~p_dw_pc~0); {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {37238#true} ~__retres1~0 := 0; {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {37238#true} #res := ~__retres1~0; {37238#true} is VALID [2022-02-20 19:57:21,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37238#true} {37238#true} #1013#return; {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {37238#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {37238#true} assume !(0 != ~tmp~1); {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L272 TraceCheckUtils]: 10: Hoare triple {37238#true} call #t~ret9 := is_do_read_c_triggered(); {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {37238#true} havoc ~__retres1~1; {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {37238#true} assume !(1 == ~c_dr_pc~0); {37238#true} is VALID [2022-02-20 19:57:21,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {37238#true} ~__retres1~1 := 0; {37238#true} is VALID [2022-02-20 19:57:21,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {37238#true} #res := ~__retres1~1; {37238#true} is VALID [2022-02-20 19:57:21,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,398 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37238#true} {37238#true} #1015#return; {37238#true} is VALID [2022-02-20 19:57:21,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {37238#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {37238#true} is VALID [2022-02-20 19:57:21,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {37238#true} assume !(0 != ~tmp___0~1); {37238#true} is VALID [2022-02-20 19:57:21,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,399 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1021#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {37279#(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); {37238#true} is VALID [2022-02-20 19:57:21,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume !(1 == ~q_write_ev~0); {37238#true} is VALID [2022-02-20 19:57:21,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1023#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {37238#true} havoc ~__retres1~2; {37238#true} is VALID [2022-02-20 19:57:21,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {37238#true} is VALID [2022-02-20 19:57:21,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} #res := ~__retres1~2; {37238#true} is VALID [2022-02-20 19:57:21,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,406 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1025#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {37238#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {37238#true} is VALID [2022-02-20 19:57:21,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {37238#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {37238#true} is VALID [2022-02-20 19:57:21,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {37238#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {37240#(= ~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; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {37240#(= ~p_dw_pc~0 0)} call update_channels1(); {37278#(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:21,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {37278#(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); {37238#true} is VALID [2022-02-20 19:57:21,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,408 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1017#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,410 INFO L272 TraceCheckUtils]: 12: Hoare triple {37240#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {37279#(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:21,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {37279#(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); {37238#true} is VALID [2022-02-20 19:57:21,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {37238#true} assume !(0 == ~q_write_ev~0); {37238#true} is VALID [2022-02-20 19:57:21,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,411 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1019#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,411 INFO L272 TraceCheckUtils]: 17: Hoare triple {37240#(= ~p_dw_pc~0 0)} call activate_threads1(); {37280#(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:21,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {37280#(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; {37238#true} is VALID [2022-02-20 19:57:21,412 INFO L272 TraceCheckUtils]: 19: Hoare triple {37238#true} call #t~ret8 := is_do_write_p_triggered(); {37238#true} is VALID [2022-02-20 19:57:21,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {37238#true} havoc ~__retres1~0; {37238#true} is VALID [2022-02-20 19:57:21,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {37238#true} assume !(1 == ~p_dw_pc~0); {37238#true} is VALID [2022-02-20 19:57:21,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {37238#true} ~__retres1~0 := 0; {37238#true} is VALID [2022-02-20 19:57:21,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {37238#true} #res := ~__retres1~0; {37238#true} is VALID [2022-02-20 19:57:21,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37238#true} {37238#true} #1013#return; {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {37238#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {37238#true} assume !(0 != ~tmp~1); {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L272 TraceCheckUtils]: 28: Hoare triple {37238#true} call #t~ret9 := is_do_read_c_triggered(); {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {37238#true} havoc ~__retres1~1; {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {37238#true} assume !(1 == ~c_dr_pc~0); {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {37238#true} ~__retres1~1 := 0; {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {37238#true} #res := ~__retres1~1; {37238#true} is VALID [2022-02-20 19:57:21,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,414 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {37238#true} {37238#true} #1015#return; {37238#true} is VALID [2022-02-20 19:57:21,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {37238#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {37238#true} is VALID [2022-02-20 19:57:21,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {37238#true} assume !(0 != ~tmp___0~1); {37238#true} is VALID [2022-02-20 19:57:21,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,414 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1021#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,415 INFO L272 TraceCheckUtils]: 39: Hoare triple {37240#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {37279#(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:21,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {37279#(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); {37238#true} is VALID [2022-02-20 19:57:21,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {37238#true} assume !(1 == ~q_write_ev~0); {37238#true} is VALID [2022-02-20 19:57:21,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,415 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1023#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume !false; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {37240#(= ~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; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume !false; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,416 INFO L272 TraceCheckUtils]: 47: Hoare triple {37240#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {37238#true} is VALID [2022-02-20 19:57:21,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {37238#true} havoc ~__retres1~2; {37238#true} is VALID [2022-02-20 19:57:21,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {37238#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {37238#true} is VALID [2022-02-20 19:57:21,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {37238#true} #res := ~__retres1~2; {37238#true} is VALID [2022-02-20 19:57:21,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {37238#true} assume true; {37238#true} is VALID [2022-02-20 19:57:21,417 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37238#true} {37240#(= ~p_dw_pc~0 0)} #1025#return; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {37240#(= ~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; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {37240#(= ~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; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {37240#(= ~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; {37240#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {37240#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {37239#false} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {37239#false} assume 1 == ~p_dw_pc~0; {37239#false} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {37239#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; {37239#false} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 60: Hoare triple {37239#false} assume !false; {37239#false} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {37239#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {37239#false} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {37239#false} assume { :end_inline_do_write_p } true; {37239#false} is VALID [2022-02-20 19:57:21,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {37239#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; {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {37239#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; {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {37239#false} assume 0 == ~c_dr_pc~0; {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {37239#false} assume !false; {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {37239#false} assume !(1 == ~q_free~0); {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {37239#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; {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {37239#false} assume !(~p_last_write~0 == ~c_last_read~0); {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L272 TraceCheckUtils]: 70: Hoare triple {37239#false} call error1(); {37239#false} is VALID [2022-02-20 19:57:21,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {37239#false} assume !false; {37239#false} is VALID [2022-02-20 19:57:21,421 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:21,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:21,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294974068] [2022-02-20 19:57:21,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294974068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:21,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:21,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:21,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12661325] [2022-02-20 19:57:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:21,422 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:21,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:21,422 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:21,464 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:21,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:21,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:21,465 INFO L87 Difference]: Start difference. First operand 2137 states and 2743 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:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,729 INFO L93 Difference]: Finished difference Result 5047 states and 6393 transitions. [2022-02-20 19:57:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:23,730 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:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:23,730 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:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2022-02-20 19:57:23,734 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:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2022-02-20 19:57:23,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 675 transitions. [2022-02-20 19:57:24,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 675 edges. 675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:24,674 INFO L225 Difference]: With dead ends: 5047 [2022-02-20 19:57:24,674 INFO L226 Difference]: Without dead ends: 3117 [2022-02-20 19:57:24,678 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:24,678 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 954 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:24,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 842 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2022-02-20 19:57:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 2869. [2022-02-20 19:57:24,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:24,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3117 states. Second operand has 2869 states, 2246 states have (on average 1.2818343722172751) internal successors, (2879), 2283 states have internal predecessors, (2879), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) [2022-02-20 19:57:24,849 INFO L74 IsIncluded]: Start isIncluded. First operand 3117 states. Second operand has 2869 states, 2246 states have (on average 1.2818343722172751) internal successors, (2879), 2283 states have internal predecessors, (2879), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) [2022-02-20 19:57:24,897 INFO L87 Difference]: Start difference. First operand 3117 states. Second operand has 2869 states, 2246 states have (on average 1.2818343722172751) internal successors, (2879), 2283 states have internal predecessors, (2879), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) [2022-02-20 19:57:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:25,209 INFO L93 Difference]: Finished difference Result 3117 states and 3917 transitions. [2022-02-20 19:57:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 3917 transitions. [2022-02-20 19:57:25,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:25,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:25,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 2869 states, 2246 states have (on average 1.2818343722172751) internal successors, (2879), 2283 states have internal predecessors, (2879), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) Second operand 3117 states. [2022-02-20 19:57:25,221 INFO L87 Difference]: Start difference. First operand has 2869 states, 2246 states have (on average 1.2818343722172751) internal successors, (2879), 2283 states have internal predecessors, (2879), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) Second operand 3117 states. [2022-02-20 19:57:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:25,524 INFO L93 Difference]: Finished difference Result 3117 states and 3917 transitions. [2022-02-20 19:57:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 3917 transitions. [2022-02-20 19:57:25,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:25,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:25,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:25,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2246 states have (on average 1.2818343722172751) internal successors, (2879), 2283 states have internal predecessors, (2879), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) [2022-02-20 19:57:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3636 transitions. [2022-02-20 19:57:25,851 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3636 transitions. Word has length 72 [2022-02-20 19:57:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:25,851 INFO L470 AbstractCegarLoop]: Abstraction has 2869 states and 3636 transitions. [2022-02-20 19:57:25,851 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:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3636 transitions. [2022-02-20 19:57:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:25,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:25,853 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:25,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:25,853 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 370804326, now seen corresponding path program 1 times [2022-02-20 19:57:25,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:25,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367428381] [2022-02-20 19:57:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {54198#(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); {54157#true} is VALID [2022-02-20 19:57:25,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54157#true} {54157#true} #1017#return; {54157#true} is VALID [2022-02-20 19:57:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {54199#(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); {54157#true} is VALID [2022-02-20 19:57:25,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume !(0 == ~q_write_ev~0); {54157#true} is VALID [2022-02-20 19:57:25,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54157#true} {54157#true} #1019#return; {54157#true} is VALID [2022-02-20 19:57:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {54157#true} havoc ~__retres1~0; {54157#true} is VALID [2022-02-20 19:57:25,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume !(1 == ~p_dw_pc~0); {54157#true} is VALID [2022-02-20 19:57:25,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} ~__retres1~0 := 0; {54157#true} is VALID [2022-02-20 19:57:25,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {54157#true} #res := ~__retres1~0; {54157#true} is VALID [2022-02-20 19:57:25,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,925 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {54157#true} {54157#true} #1013#return; {54157#true} is VALID [2022-02-20 19:57:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {54157#true} havoc ~__retres1~1; {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume !(1 == ~c_dr_pc~0); {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} ~__retres1~1 := 0; {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {54157#true} #res := ~__retres1~1; {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {54157#true} {54157#true} #1015#return; {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {54200#(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; {54157#true} is VALID [2022-02-20 19:57:25,927 INFO L272 TraceCheckUtils]: 1: Hoare triple {54157#true} call #t~ret8 := is_do_write_p_triggered(); {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} havoc ~__retres1~0; {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {54157#true} assume !(1 == ~p_dw_pc~0); {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {54157#true} ~__retres1~0 := 0; {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {54157#true} #res := ~__retres1~0; {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {54157#true} {54157#true} #1013#return; {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {54157#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54157#true} is VALID [2022-02-20 19:57:25,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {54157#true} assume !(0 != ~tmp~1); {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L272 TraceCheckUtils]: 10: Hoare triple {54157#true} call #t~ret9 := is_do_read_c_triggered(); {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {54157#true} havoc ~__retres1~1; {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {54157#true} assume !(1 == ~c_dr_pc~0); {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {54157#true} ~__retres1~1 := 0; {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {54157#true} #res := ~__retres1~1; {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {54157#true} {54157#true} #1015#return; {54157#true} is VALID [2022-02-20 19:57:25,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {54157#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54157#true} is VALID [2022-02-20 19:57:25,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {54157#true} assume !(0 != ~tmp___0~1); {54157#true} is VALID [2022-02-20 19:57:25,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,930 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {54157#true} {54157#true} #1021#return; {54157#true} is VALID [2022-02-20 19:57:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {54199#(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); {54157#true} is VALID [2022-02-20 19:57:25,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume !(1 == ~q_write_ev~0); {54157#true} is VALID [2022-02-20 19:57:25,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54157#true} {54157#true} #1023#return; {54157#true} is VALID [2022-02-20 19:57:25,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:25,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {54157#true} havoc ~__retres1~2; {54157#true} is VALID [2022-02-20 19:57:25,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54157#true} is VALID [2022-02-20 19:57:25,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} #res := ~__retres1~2; {54157#true} is VALID [2022-02-20 19:57:25,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,939 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {54157#true} {54157#true} #1025#return; {54157#true} is VALID [2022-02-20 19:57:25,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {54157#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {54157#true} is VALID [2022-02-20 19:57:25,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {54157#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {54157#true} is VALID [2022-02-20 19:57:25,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {54157#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {54157#true} is VALID [2022-02-20 19:57:25,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {54157#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; {54157#true} is VALID [2022-02-20 19:57:25,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {54157#true} call update_channels1(); {54198#(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:25,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {54198#(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); {54157#true} is VALID [2022-02-20 19:57:25,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,940 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {54157#true} {54157#true} #1017#return; {54157#true} is VALID [2022-02-20 19:57:25,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {54157#true} assume { :begin_inline_init_threads1 } true; {54157#true} is VALID [2022-02-20 19:57:25,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {54157#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {54157#true} is VALID [2022-02-20 19:57:25,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {54157#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {54157#true} is VALID [2022-02-20 19:57:25,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {54157#true} assume { :end_inline_init_threads1 } true; {54157#true} is VALID [2022-02-20 19:57:25,941 INFO L272 TraceCheckUtils]: 12: Hoare triple {54157#true} call fire_delta_events1(); {54199#(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:25,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {54199#(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); {54157#true} is VALID [2022-02-20 19:57:25,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {54157#true} assume !(0 == ~q_write_ev~0); {54157#true} is VALID [2022-02-20 19:57:25,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,942 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {54157#true} {54157#true} #1019#return; {54157#true} is VALID [2022-02-20 19:57:25,942 INFO L272 TraceCheckUtils]: 17: Hoare triple {54157#true} call activate_threads1(); {54200#(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:25,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {54200#(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; {54157#true} is VALID [2022-02-20 19:57:25,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {54157#true} call #t~ret8 := is_do_write_p_triggered(); {54157#true} is VALID [2022-02-20 19:57:25,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {54157#true} havoc ~__retres1~0; {54157#true} is VALID [2022-02-20 19:57:25,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {54157#true} assume !(1 == ~p_dw_pc~0); {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {54157#true} ~__retres1~0 := 0; {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {54157#true} #res := ~__retres1~0; {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {54157#true} {54157#true} #1013#return; {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {54157#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {54157#true} assume !(0 != ~tmp~1); {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L272 TraceCheckUtils]: 28: Hoare triple {54157#true} call #t~ret9 := is_do_read_c_triggered(); {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {54157#true} havoc ~__retres1~1; {54157#true} is VALID [2022-02-20 19:57:25,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {54157#true} assume !(1 == ~c_dr_pc~0); {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {54157#true} ~__retres1~1 := 0; {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {54157#true} #res := ~__retres1~1; {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {54157#true} {54157#true} #1015#return; {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {54157#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {54157#true} assume !(0 != ~tmp___0~1); {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,944 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {54157#true} {54157#true} #1021#return; {54157#true} is VALID [2022-02-20 19:57:25,945 INFO L272 TraceCheckUtils]: 39: Hoare triple {54157#true} call reset_delta_events1(); {54199#(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:25,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {54199#(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); {54157#true} is VALID [2022-02-20 19:57:25,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {54157#true} assume !(1 == ~q_write_ev~0); {54157#true} is VALID [2022-02-20 19:57:25,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,945 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {54157#true} {54157#true} #1023#return; {54157#true} is VALID [2022-02-20 19:57:25,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {54157#true} assume !false; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {54157#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; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {54157#true} assume !false; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L272 TraceCheckUtils]: 47: Hoare triple {54157#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {54157#true} havoc ~__retres1~2; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {54157#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {54157#true} #res := ~__retres1~2; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {54157#true} assume true; {54157#true} is VALID [2022-02-20 19:57:25,946 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {54157#true} {54157#true} #1025#return; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {54157#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; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {54157#true} assume 0 != eval1_~tmp___1~0#1; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {54157#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; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {54157#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; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {54157#true} assume 0 == ~p_dw_pc~0; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {54157#true} assume !false; {54157#true} is VALID [2022-02-20 19:57:25,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {54157#true} assume !(0 == ~q_free~0); {54157#true} is VALID [2022-02-20 19:57:25,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {54157#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; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,948 INFO L290 TraceCheckUtils]: 61: Hoare triple {54196#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,948 INFO L290 TraceCheckUtils]: 62: Hoare triple {54196#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {54196#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,949 INFO L290 TraceCheckUtils]: 64: Hoare triple {54196#(= ~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; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {54196#(= ~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; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,950 INFO L290 TraceCheckUtils]: 66: Hoare triple {54196#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,950 INFO L290 TraceCheckUtils]: 67: Hoare triple {54196#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,950 INFO L290 TraceCheckUtils]: 68: Hoare triple {54196#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {54196#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:25,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {54196#(= ~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; {54197#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:25,951 INFO L290 TraceCheckUtils]: 70: Hoare triple {54197#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {54158#false} is VALID [2022-02-20 19:57:25,951 INFO L272 TraceCheckUtils]: 71: Hoare triple {54158#false} call error1(); {54158#false} is VALID [2022-02-20 19:57:25,951 INFO L290 TraceCheckUtils]: 72: Hoare triple {54158#false} assume !false; {54158#false} is VALID [2022-02-20 19:57:25,952 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:25,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:25,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367428381] [2022-02-20 19:57:25,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367428381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:25,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:25,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:25,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979179707] [2022-02-20 19:57:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:25,953 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:25,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:25,953 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:25,995 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:25,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:25,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:25,996 INFO L87 Difference]: Start difference. First operand 2869 states and 3636 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:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,239 INFO L93 Difference]: Finished difference Result 3643 states and 4567 transitions. [2022-02-20 19:57:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:28,239 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:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:28,239 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:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 558 transitions. [2022-02-20 19:57:28,242 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:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 558 transitions. [2022-02-20 19:57:28,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 558 transitions. [2022-02-20 19:57:28,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:29,184 INFO L225 Difference]: With dead ends: 3643 [2022-02-20 19:57:29,184 INFO L226 Difference]: Without dead ends: 3640 [2022-02-20 19:57:29,185 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:29,186 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 1169 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:29,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 1010 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2022-02-20 19:57:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3363. [2022-02-20 19:57:29,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:29,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3640 states. Second operand has 3363 states, 2631 states have (on average 1.273660205245154) internal successors, (3351), 2673 states have internal predecessors, (3351), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) [2022-02-20 19:57:29,403 INFO L74 IsIncluded]: Start isIncluded. First operand 3640 states. Second operand has 3363 states, 2631 states have (on average 1.273660205245154) internal successors, (3351), 2673 states have internal predecessors, (3351), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) [2022-02-20 19:57:29,405 INFO L87 Difference]: Start difference. First operand 3640 states. Second operand has 3363 states, 2631 states have (on average 1.273660205245154) internal successors, (3351), 2673 states have internal predecessors, (3351), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) [2022-02-20 19:57:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:29,784 INFO L93 Difference]: Finished difference Result 3640 states and 4553 transitions. [2022-02-20 19:57:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 4553 transitions. [2022-02-20 19:57:29,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:29,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:29,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 3363 states, 2631 states have (on average 1.273660205245154) internal successors, (3351), 2673 states have internal predecessors, (3351), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) Second operand 3640 states. [2022-02-20 19:57:29,797 INFO L87 Difference]: Start difference. First operand has 3363 states, 2631 states have (on average 1.273660205245154) internal successors, (3351), 2673 states have internal predecessors, (3351), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) Second operand 3640 states. [2022-02-20 19:57:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,177 INFO L93 Difference]: Finished difference Result 3640 states and 4553 transitions. [2022-02-20 19:57:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 4553 transitions. [2022-02-20 19:57:30,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:30,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 2631 states have (on average 1.273660205245154) internal successors, (3351), 2673 states have internal predecessors, (3351), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) [2022-02-20 19:57:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4237 transitions. [2022-02-20 19:57:30,691 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4237 transitions. Word has length 73 [2022-02-20 19:57:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:30,691 INFO L470 AbstractCegarLoop]: Abstraction has 3363 states and 4237 transitions. [2022-02-20 19:57:30,691 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:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4237 transitions. [2022-02-20 19:57:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:57:30,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:30,693 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:30,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:30,693 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1390842321, now seen corresponding path program 1 times [2022-02-20 19:57:30,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:30,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567934869] [2022-02-20 19:57:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {70931#(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); {70889#true} is VALID [2022-02-20 19:57:30,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1017#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {70932#(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); {70889#true} is VALID [2022-02-20 19:57:30,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume !(0 == ~q_write_ev~0); {70889#true} is VALID [2022-02-20 19:57:30,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1019#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {70889#true} havoc ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:30,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume !(1 == ~p_dw_pc~0); {70889#true} is VALID [2022-02-20 19:57:30,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} ~__retres1~0 := 0; {70889#true} is VALID [2022-02-20 19:57:30,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {70889#true} #res := ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:30,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,794 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {70889#true} {70889#true} #1013#return; {70889#true} is VALID [2022-02-20 19:57:30,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {70889#true} havoc ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:30,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume !(1 == ~c_dr_pc~0); {70889#true} is VALID [2022-02-20 19:57:30,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} ~__retres1~1 := 0; {70889#true} is VALID [2022-02-20 19:57:30,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {70889#true} #res := ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:30,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,796 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {70889#true} {70889#true} #1015#return; {70889#true} is VALID [2022-02-20 19:57:30,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {70933#(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; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L272 TraceCheckUtils]: 1: Hoare triple {70889#true} call #t~ret8 := is_do_write_p_triggered(); {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} havoc ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {70889#true} assume !(1 == ~p_dw_pc~0); {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {70889#true} ~__retres1~0 := 0; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {70889#true} #res := ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70889#true} {70889#true} #1013#return; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {70889#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70889#true} is VALID [2022-02-20 19:57:30,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {70889#true} assume !(0 != ~tmp~1); {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L272 TraceCheckUtils]: 10: Hoare triple {70889#true} call #t~ret9 := is_do_read_c_triggered(); {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {70889#true} havoc ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {70889#true} assume !(1 == ~c_dr_pc~0); {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {70889#true} ~__retres1~1 := 0; {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {70889#true} #res := ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70889#true} {70889#true} #1015#return; {70889#true} is VALID [2022-02-20 19:57:30,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {70889#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70889#true} is VALID [2022-02-20 19:57:30,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {70889#true} assume !(0 != ~tmp___0~1); {70889#true} is VALID [2022-02-20 19:57:30,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,799 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1021#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {70932#(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); {70889#true} is VALID [2022-02-20 19:57:30,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume !(1 == ~q_write_ev~0); {70889#true} is VALID [2022-02-20 19:57:30,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1023#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {70889#true} havoc ~__retres1~2; {70889#true} is VALID [2022-02-20 19:57:30,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70889#true} is VALID [2022-02-20 19:57:30,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} #res := ~__retres1~2; {70889#true} is VALID [2022-02-20 19:57:30,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,809 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1025#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {70889#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {70889#true} is VALID [2022-02-20 19:57:30,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {70889#true} is VALID [2022-02-20 19:57:30,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {70931#(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:30,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {70931#(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); {70889#true} is VALID [2022-02-20 19:57:30,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,812 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1017#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,813 INFO L272 TraceCheckUtils]: 12: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {70932#(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:30,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {70932#(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); {70889#true} is VALID [2022-02-20 19:57:30,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {70889#true} assume !(0 == ~q_write_ev~0); {70889#true} is VALID [2022-02-20 19:57:30,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,814 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1019#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,814 INFO L272 TraceCheckUtils]: 17: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {70933#(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:30,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {70933#(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; {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {70889#true} call #t~ret8 := is_do_write_p_triggered(); {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {70889#true} havoc ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {70889#true} assume !(1 == ~p_dw_pc~0); {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {70889#true} ~__retres1~0 := 0; {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {70889#true} #res := ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70889#true} {70889#true} #1013#return; {70889#true} is VALID [2022-02-20 19:57:30,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {70889#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {70889#true} assume !(0 != ~tmp~1); {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L272 TraceCheckUtils]: 28: Hoare triple {70889#true} call #t~ret9 := is_do_read_c_triggered(); {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {70889#true} havoc ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {70889#true} assume !(1 == ~c_dr_pc~0); {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {70889#true} ~__retres1~1 := 0; {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {70889#true} #res := ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,816 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {70889#true} {70889#true} #1015#return; {70889#true} is VALID [2022-02-20 19:57:30,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {70889#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70889#true} is VALID [2022-02-20 19:57:30,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {70889#true} assume !(0 != ~tmp___0~1); {70889#true} is VALID [2022-02-20 19:57:30,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,817 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1021#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,818 INFO L272 TraceCheckUtils]: 39: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {70932#(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:30,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {70932#(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); {70889#true} is VALID [2022-02-20 19:57:30,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {70889#true} assume !(1 == ~q_write_ev~0); {70889#true} is VALID [2022-02-20 19:57:30,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,818 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1023#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,819 INFO L272 TraceCheckUtils]: 47: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70889#true} is VALID [2022-02-20 19:57:30,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {70889#true} havoc ~__retres1~2; {70889#true} is VALID [2022-02-20 19:57:30,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {70889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70889#true} is VALID [2022-02-20 19:57:30,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {70889#true} #res := ~__retres1~2; {70889#true} is VALID [2022-02-20 19:57:30,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:30,820 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {70889#true} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1025#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,823 INFO L290 TraceCheckUtils]: 59: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:30,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {70891#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {70929#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {70929#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {70929#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:30,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {70929#(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; {70930#(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:30,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {70930#(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; {70930#(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:30,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {70930#(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); {70890#false} is VALID [2022-02-20 19:57:30,827 INFO L272 TraceCheckUtils]: 72: Hoare triple {70890#false} call error1(); {70890#false} is VALID [2022-02-20 19:57:30,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {70890#false} assume !false; {70890#false} is VALID [2022-02-20 19:57:30,828 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:30,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:30,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567934869] [2022-02-20 19:57:30,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567934869] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:57:30,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080546274] [2022-02-20 19:57:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:57:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:30,830 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:30,833 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:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:57:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:57:31,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {70889#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {70889#true} is VALID [2022-02-20 19:57:31,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {70889#true} is VALID [2022-02-20 19:57:31,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,472 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1017#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,474 INFO L272 TraceCheckUtils]: 12: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,475 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1019#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,475 INFO L272 TraceCheckUtils]: 17: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,478 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1013#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,479 INFO L272 TraceCheckUtils]: 28: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,481 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1015#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,482 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1021#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,483 INFO L272 TraceCheckUtils]: 39: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,484 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1023#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,485 INFO L272 TraceCheckUtils]: 47: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,487 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1025#return; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {70891#(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; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,489 INFO L290 TraceCheckUtils]: 59: Hoare triple {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {70891#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:31,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {70891#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {70929#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {70929#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {70929#(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; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,492 INFO L290 TraceCheckUtils]: 66: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,492 INFO L290 TraceCheckUtils]: 67: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {70929#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {70929#(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; {71156#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {71156#(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; {71156#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:31,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {71156#(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); {70890#false} is VALID [2022-02-20 19:57:31,494 INFO L272 TraceCheckUtils]: 72: Hoare triple {70890#false} call error1(); {70890#false} is VALID [2022-02-20 19:57:31,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {70890#false} assume !false; {70890#false} is VALID [2022-02-20 19:57:31,494 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:31,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:57:31,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {70890#false} assume !false; {70890#false} is VALID [2022-02-20 19:57:31,842 INFO L272 TraceCheckUtils]: 72: Hoare triple {70890#false} call error1(); {70890#false} is VALID [2022-02-20 19:57:31,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {70930#(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); {70890#false} is VALID [2022-02-20 19:57:31,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {70930#(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; {70930#(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:31,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {71181#(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; {70930#(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:31,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {71181#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {71181#(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:31,844 INFO L290 TraceCheckUtils]: 67: Hoare triple {71181#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {71181#(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:31,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {71181#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {71181#(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:31,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {71181#(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; {71181#(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:31,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {71181#(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; {71181#(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:31,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {71181#(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; {71181#(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:31,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {71181#(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; {71181#(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:31,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {71181#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {71181#(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:31,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {70930#(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; {71181#(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:31,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {70930#(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:31,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {70930#(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:31,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {70930#(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:31,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {70930#(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; {70930#(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:31,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {70930#(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; {70930#(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:31,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {70930#(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; {70930#(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:31,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {70930#(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; {70930#(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:31,849 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {70889#true} {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1025#return; {70930#(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:31,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {70889#true} #res := ~__retres1~2; {70889#true} is VALID [2022-02-20 19:57:31,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {70889#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70889#true} is VALID [2022-02-20 19:57:31,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {70889#true} havoc ~__retres1~2; {70889#true} is VALID [2022-02-20 19:57:31,849 INFO L272 TraceCheckUtils]: 47: Hoare triple {70930#(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(); {70889#true} is VALID [2022-02-20 19:57:31,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {70930#(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:31,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {70930#(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; {70930#(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:31,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {70930#(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:31,851 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70889#true} {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1023#return; {70930#(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:31,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {70889#true} assume !(1 == ~q_write_ev~0); {70889#true} is VALID [2022-02-20 19:57:31,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {70889#true} assume !(1 == ~q_read_ev~0); {70889#true} is VALID [2022-02-20 19:57:31,851 INFO L272 TraceCheckUtils]: 39: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {70889#true} is VALID [2022-02-20 19:57:31,851 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70889#true} {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1021#return; {70930#(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:31,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {70889#true} assume !(0 != ~tmp___0~1); {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {70889#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {70889#true} {70889#true} #1015#return; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {70889#true} #res := ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {70889#true} ~__retres1~1 := 0; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {70889#true} assume !(1 == ~c_dr_pc~0); {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {70889#true} havoc ~__retres1~1; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L272 TraceCheckUtils]: 28: Hoare triple {70889#true} call #t~ret9 := is_do_read_c_triggered(); {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {70889#true} assume !(0 != ~tmp~1); {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {70889#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70889#true} {70889#true} #1013#return; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {70889#true} #res := ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {70889#true} ~__retres1~0 := 0; {70889#true} is VALID [2022-02-20 19:57:31,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {70889#true} assume !(1 == ~p_dw_pc~0); {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {70889#true} havoc ~__retres1~0; {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {70889#true} call #t~ret8 := is_do_write_p_triggered(); {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {70889#true} havoc ~tmp~1;havoc ~tmp___0~1; {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L272 TraceCheckUtils]: 17: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70889#true} {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1019#return; {70930#(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:31,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {70889#true} assume !(0 == ~q_write_ev~0); {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {70889#true} assume !(0 == ~q_read_ev~0); {70889#true} is VALID [2022-02-20 19:57:31,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {70889#true} is VALID [2022-02-20 19:57:31,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {70930#(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:31,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {70930#(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; {70930#(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:31,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {70930#(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; {70930#(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:31,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {70930#(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:31,855 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70889#true} {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1017#return; {70930#(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:31,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {70889#true} assume true; {70889#true} is VALID [2022-02-20 19:57:31,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {70889#true} assume !(1 == ~q_req_up~0); {70889#true} is VALID [2022-02-20 19:57:31,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {70930#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {70889#true} is VALID [2022-02-20 19:57:31,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {70930#(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; {70930#(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:31,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {70889#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {70930#(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:31,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {70889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {70889#true} is VALID [2022-02-20 19:57:31,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {70889#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {70889#true} is VALID [2022-02-20 19:57:31,856 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:31,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080546274] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:57:31,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:57:31,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:57:31,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11407173] [2022-02-20 19:57:31,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:57:31,857 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:31,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:31,859 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:31,984 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:31,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:31,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:31,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:31,985 INFO L87 Difference]: Start difference. First operand 3363 states and 4237 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:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:40,206 INFO L93 Difference]: Finished difference Result 7804 states and 9723 transitions. [2022-02-20 19:57:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:57:40,206 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:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:40,206 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:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1053 transitions. [2022-02-20 19:57:40,212 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:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1053 transitions. [2022-02-20 19:57:40,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1053 transitions. [2022-02-20 19:57:40,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1053 edges. 1053 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:43,227 INFO L225 Difference]: With dead ends: 7804 [2022-02-20 19:57:43,227 INFO L226 Difference]: Without dead ends: 7801 [2022-02-20 19:57:43,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-02-20 19:57:43,229 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1501 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:43,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1565 Valid, 2085 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:57:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7801 states. [2022-02-20 19:57:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7801 to 5153. [2022-02-20 19:57:44,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:44,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7801 states. Second operand has 5153 states, 4035 states have (on average 1.2706319702602231) internal successors, (5127), 4099 states have internal predecessors, (5127), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) [2022-02-20 19:57:44,739 INFO L74 IsIncluded]: Start isIncluded. First operand 7801 states. Second operand has 5153 states, 4035 states have (on average 1.2706319702602231) internal successors, (5127), 4099 states have internal predecessors, (5127), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) [2022-02-20 19:57:44,745 INFO L87 Difference]: Start difference. First operand 7801 states. Second operand has 5153 states, 4035 states have (on average 1.2706319702602231) internal successors, (5127), 4099 states have internal predecessors, (5127), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) [2022-02-20 19:57:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:46,596 INFO L93 Difference]: Finished difference Result 7801 states and 9709 transitions. [2022-02-20 19:57:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 9709 transitions. [2022-02-20 19:57:46,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:46,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:46,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 5153 states, 4035 states have (on average 1.2706319702602231) internal successors, (5127), 4099 states have internal predecessors, (5127), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) Second operand 7801 states. [2022-02-20 19:57:46,619 INFO L87 Difference]: Start difference. First operand has 5153 states, 4035 states have (on average 1.2706319702602231) internal successors, (5127), 4099 states have internal predecessors, (5127), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) Second operand 7801 states. [2022-02-20 19:57:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,424 INFO L93 Difference]: Finished difference Result 7801 states and 9709 transitions. [2022-02-20 19:57:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 9709 transitions. [2022-02-20 19:57:48,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:48,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 4035 states have (on average 1.2706319702602231) internal successors, (5127), 4099 states have internal predecessors, (5127), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) [2022-02-20 19:57:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 6475 transitions. [2022-02-20 19:57:49,537 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 6475 transitions. Word has length 74 [2022-02-20 19:57:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:49,537 INFO L470 AbstractCegarLoop]: Abstraction has 5153 states and 6475 transitions. [2022-02-20 19:57:49,537 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:57:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 6475 transitions. [2022-02-20 19:57:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:57:49,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:49,539 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:49,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:57:49,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 19:57:49,756 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:49,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2100794586, now seen corresponding path program 2 times [2022-02-20 19:57:49,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:49,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215039120] [2022-02-20 19:57:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:49,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {104354#(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); {104314#true} is VALID [2022-02-20 19:57:49,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104314#true} {104314#true} #1017#return; {104314#true} is VALID [2022-02-20 19:57:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {104355#(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); {104314#true} is VALID [2022-02-20 19:57:49,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume !(0 == ~q_write_ev~0); {104314#true} is VALID [2022-02-20 19:57:49,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104314#true} {104314#true} #1019#return; {104314#true} is VALID [2022-02-20 19:57:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {104314#true} havoc ~__retres1~0; {104314#true} is VALID [2022-02-20 19:57:49,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume !(1 == ~p_dw_pc~0); {104314#true} is VALID [2022-02-20 19:57:49,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} ~__retres1~0 := 0; {104314#true} is VALID [2022-02-20 19:57:49,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {104314#true} #res := ~__retres1~0; {104314#true} is VALID [2022-02-20 19:57:49,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,822 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {104314#true} {104314#true} #1013#return; {104314#true} is VALID [2022-02-20 19:57:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {104314#true} havoc ~__retres1~1; {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume !(1 == ~c_dr_pc~0); {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} ~__retres1~1 := 0; {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {104314#true} #res := ~__retres1~1; {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {104314#true} {104314#true} #1015#return; {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {104356#(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; {104314#true} is VALID [2022-02-20 19:57:49,825 INFO L272 TraceCheckUtils]: 1: Hoare triple {104314#true} call #t~ret8 := is_do_write_p_triggered(); {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} havoc ~__retres1~0; {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {104314#true} assume !(1 == ~p_dw_pc~0); {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {104314#true} ~__retres1~0 := 0; {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {104314#true} #res := ~__retres1~0; {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {104314#true} {104314#true} #1013#return; {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {104314#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {104314#true} assume !(0 != ~tmp~1); {104314#true} is VALID [2022-02-20 19:57:49,826 INFO L272 TraceCheckUtils]: 10: Hoare triple {104314#true} call #t~ret9 := is_do_read_c_triggered(); {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {104314#true} havoc ~__retres1~1; {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {104314#true} assume !(1 == ~c_dr_pc~0); {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {104314#true} ~__retres1~1 := 0; {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {104314#true} #res := ~__retres1~1; {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {104314#true} {104314#true} #1015#return; {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {104314#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {104314#true} is VALID [2022-02-20 19:57:49,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {104314#true} assume !(0 != ~tmp___0~1); {104314#true} is VALID [2022-02-20 19:57:49,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,828 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {104314#true} {104314#true} #1021#return; {104314#true} is VALID [2022-02-20 19:57:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {104355#(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); {104314#true} is VALID [2022-02-20 19:57:49,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume !(1 == ~q_write_ev~0); {104314#true} is VALID [2022-02-20 19:57:49,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104314#true} {104314#true} #1023#return; {104314#true} is VALID [2022-02-20 19:57:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {104314#true} havoc ~__retres1~2; {104314#true} is VALID [2022-02-20 19:57:49,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {104314#true} is VALID [2022-02-20 19:57:49,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} #res := ~__retres1~2; {104314#true} is VALID [2022-02-20 19:57:49,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,842 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {104314#true} {104314#true} #1025#return; {104314#true} is VALID [2022-02-20 19:57:49,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {104314#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {104314#true} is VALID [2022-02-20 19:57:49,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {104314#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {104314#true} is VALID [2022-02-20 19:57:49,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {104314#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {104314#true} is VALID [2022-02-20 19:57:49,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {104314#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; {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {104314#true} call update_channels1(); {104354#(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:49,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {104354#(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); {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {104314#true} {104314#true} #1017#return; {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {104314#true} assume { :begin_inline_init_threads1 } true; {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {104314#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {104314#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {104314#true} is VALID [2022-02-20 19:57:49,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {104314#true} assume { :end_inline_init_threads1 } true; {104314#true} is VALID [2022-02-20 19:57:49,845 INFO L272 TraceCheckUtils]: 12: Hoare triple {104314#true} call fire_delta_events1(); {104355#(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:49,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {104355#(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); {104314#true} is VALID [2022-02-20 19:57:49,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {104314#true} assume !(0 == ~q_write_ev~0); {104314#true} is VALID [2022-02-20 19:57:49,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,845 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {104314#true} {104314#true} #1019#return; {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L272 TraceCheckUtils]: 17: Hoare triple {104314#true} call activate_threads1(); {104356#(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:49,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {104356#(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; {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L272 TraceCheckUtils]: 19: Hoare triple {104314#true} call #t~ret8 := is_do_write_p_triggered(); {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {104314#true} havoc ~__retres1~0; {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {104314#true} assume !(1 == ~p_dw_pc~0); {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {104314#true} ~__retres1~0 := 0; {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {104314#true} #res := ~__retres1~0; {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,846 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {104314#true} {104314#true} #1013#return; {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {104314#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {104314#true} assume !(0 != ~tmp~1); {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L272 TraceCheckUtils]: 28: Hoare triple {104314#true} call #t~ret9 := is_do_read_c_triggered(); {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {104314#true} havoc ~__retres1~1; {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {104314#true} assume !(1 == ~c_dr_pc~0); {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {104314#true} ~__retres1~1 := 0; {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {104314#true} #res := ~__retres1~1; {104314#true} is VALID [2022-02-20 19:57:49,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,848 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {104314#true} {104314#true} #1015#return; {104314#true} is VALID [2022-02-20 19:57:49,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {104314#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {104314#true} is VALID [2022-02-20 19:57:49,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {104314#true} assume !(0 != ~tmp___0~1); {104314#true} is VALID [2022-02-20 19:57:49,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,848 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {104314#true} {104314#true} #1021#return; {104314#true} is VALID [2022-02-20 19:57:49,848 INFO L272 TraceCheckUtils]: 39: Hoare triple {104314#true} call reset_delta_events1(); {104355#(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:49,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {104355#(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); {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {104314#true} assume !(1 == ~q_write_ev~0); {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {104314#true} {104314#true} #1023#return; {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {104314#true} assume !false; {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {104314#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; {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {104314#true} assume !false; {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L272 TraceCheckUtils]: 47: Hoare triple {104314#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {104314#true} is VALID [2022-02-20 19:57:49,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {104314#true} havoc ~__retres1~2; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {104314#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {104314#true} #res := ~__retres1~2; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {104314#true} assume true; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {104314#true} {104314#true} #1025#return; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {104314#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; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {104314#true} assume 0 != eval1_~tmp___1~0#1; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {104314#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; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {104314#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; {104314#true} is VALID [2022-02-20 19:57:49,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {104314#true} assume 0 == ~p_dw_pc~0; {104314#true} is VALID [2022-02-20 19:57:49,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {104314#true} assume !false; {104314#true} is VALID [2022-02-20 19:57:49,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {104314#true} assume !(0 == ~q_free~0); {104314#true} is VALID [2022-02-20 19:57:49,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {104314#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; {104353#(= ~q_free~0 0)} is VALID [2022-02-20 19:57:49,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {104353#(= ~q_free~0 0)} assume !false; {104353#(= ~q_free~0 0)} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {104353#(= ~q_free~0 0)} assume !(0 == ~q_free~0); {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {104315#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; {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 64: Hoare triple {104315#false} assume !false; {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 65: Hoare triple {104315#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {104315#false} assume { :end_inline_do_write_p } true; {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {104315#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; {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {104315#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; {104315#false} is VALID [2022-02-20 19:57:49,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {104315#false} assume 0 == ~c_dr_pc~0; {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {104315#false} assume !false; {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {104315#false} assume !(1 == ~q_free~0); {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {104315#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; {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {104315#false} assume ~p_last_write~0 == ~c_last_read~0; {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {104315#false} assume !(~p_num_write~0 == ~c_num_read~0); {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L272 TraceCheckUtils]: 75: Hoare triple {104315#false} call error1(); {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L290 TraceCheckUtils]: 76: Hoare triple {104315#false} assume !false; {104315#false} is VALID [2022-02-20 19:57:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:49,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:49,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215039120] [2022-02-20 19:57:49,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215039120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:49,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:49,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:49,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398340371] [2022-02-20 19:57:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 77 [2022-02-20 19:57:49,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:49,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:49,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:49,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:49,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:49,899 INFO L87 Difference]: Start difference. First operand 5153 states and 6475 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,067 INFO L93 Difference]: Finished difference Result 7835 states and 9848 transitions. [2022-02-20 19:57:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:57:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 77 [2022-02-20 19:57:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 662 transitions. [2022-02-20 19:57:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 662 transitions. [2022-02-20 19:57:54,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 662 transitions. [2022-02-20 19:57:54,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 662 edges. 662 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:55,032 INFO L225 Difference]: With dead ends: 7835 [2022-02-20 19:57:55,033 INFO L226 Difference]: Without dead ends: 3760 [2022-02-20 19:57:55,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:55,051 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 680 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:55,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [708 Valid, 1138 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-02-20 19:57:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3525. [2022-02-20 19:57:56,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:56,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3760 states. Second operand has 3525 states, 2763 states have (on average 1.2547955121245022) internal successors, (3467), 2805 states have internal predecessors, (3467), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) [2022-02-20 19:57:56,251 INFO L74 IsIncluded]: Start isIncluded. First operand 3760 states. Second operand has 3525 states, 2763 states have (on average 1.2547955121245022) internal successors, (3467), 2805 states have internal predecessors, (3467), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) [2022-02-20 19:57:56,253 INFO L87 Difference]: Start difference. First operand 3760 states. Second operand has 3525 states, 2763 states have (on average 1.2547955121245022) internal successors, (3467), 2805 states have internal predecessors, (3467), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) [2022-02-20 19:57:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:56,656 INFO L93 Difference]: Finished difference Result 3760 states and 4637 transitions. [2022-02-20 19:57:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4637 transitions. [2022-02-20 19:57:56,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:56,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:56,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 3525 states, 2763 states have (on average 1.2547955121245022) internal successors, (3467), 2805 states have internal predecessors, (3467), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) Second operand 3760 states. [2022-02-20 19:57:56,666 INFO L87 Difference]: Start difference. First operand has 3525 states, 2763 states have (on average 1.2547955121245022) internal successors, (3467), 2805 states have internal predecessors, (3467), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) Second operand 3760 states. [2022-02-20 19:57:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,067 INFO L93 Difference]: Finished difference Result 3760 states and 4637 transitions. [2022-02-20 19:57:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4637 transitions. [2022-02-20 19:57:57,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:57,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 2763 states have (on average 1.2547955121245022) internal successors, (3467), 2805 states have internal predecessors, (3467), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) [2022-02-20 19:57:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 4373 transitions. [2022-02-20 19:57:57,680 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 4373 transitions. Word has length 77 [2022-02-20 19:57:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:57,681 INFO L470 AbstractCegarLoop]: Abstraction has 3525 states and 4373 transitions. [2022-02-20 19:57:57,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 4373 transitions. [2022-02-20 19:57:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 19:57:57,682 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:57,682 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:57,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 19:57:57,683 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1884573217, now seen corresponding path program 1 times [2022-02-20 19:57:57,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:57,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275256217] [2022-02-20 19:57:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {127168#(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); {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:57,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:57,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {127124#(= ~q_read_ev~0 2)} #1017#return; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {127170#(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); {127122#true} is VALID [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume !(0 == ~q_write_ev~0); {127122#true} is VALID [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127122#true} {127124#(= ~q_read_ev~0 2)} #1019#return; {127122#true} is VALID [2022-02-20 19:57:57,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {127122#true} havoc ~__retres1~0; {127122#true} is VALID [2022-02-20 19:57:57,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume !(1 == ~p_dw_pc~0); {127122#true} is VALID [2022-02-20 19:57:57,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} ~__retres1~0 := 0; {127122#true} is VALID [2022-02-20 19:57:57,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {127122#true} #res := ~__retres1~0; {127122#true} is VALID [2022-02-20 19:57:57,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,744 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {127122#true} {127122#true} #1013#return; {127122#true} is VALID [2022-02-20 19:57:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {127122#true} havoc ~__retres1~1; {127122#true} is VALID [2022-02-20 19:57:57,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume !(1 == ~c_dr_pc~0); {127122#true} is VALID [2022-02-20 19:57:57,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} ~__retres1~1 := 0; {127122#true} is VALID [2022-02-20 19:57:57,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {127122#true} #res := ~__retres1~1; {127122#true} is VALID [2022-02-20 19:57:57,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {127122#true} {127122#true} #1015#return; {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {127171#(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; {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L272 TraceCheckUtils]: 1: Hoare triple {127122#true} call #t~ret8 := is_do_write_p_triggered(); {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} havoc ~__retres1~0; {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {127122#true} assume !(1 == ~p_dw_pc~0); {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {127122#true} ~__retres1~0 := 0; {127122#true} is VALID [2022-02-20 19:57:57,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {127122#true} #res := ~__retres1~0; {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {127122#true} {127122#true} #1013#return; {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {127122#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {127122#true} assume !(0 != ~tmp~1); {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L272 TraceCheckUtils]: 10: Hoare triple {127122#true} call #t~ret9 := is_do_read_c_triggered(); {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {127122#true} havoc ~__retres1~1; {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {127122#true} assume !(1 == ~c_dr_pc~0); {127122#true} is VALID [2022-02-20 19:57:57,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {127122#true} ~__retres1~1 := 0; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {127122#true} #res := ~__retres1~1; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {127122#true} {127122#true} #1015#return; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {127122#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {127122#true} assume !(0 != ~tmp___0~1); {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {127122#true} {127122#true} #1021#return; {127122#true} is VALID [2022-02-20 19:57:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {127170#(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); {127122#true} is VALID [2022-02-20 19:57:57,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume !(1 == ~q_write_ev~0); {127122#true} is VALID [2022-02-20 19:57:57,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127122#true} {127122#true} #1023#return; {127122#true} is VALID [2022-02-20 19:57:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {127122#true} havoc ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {127122#true} is VALID [2022-02-20 19:57:57,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} #res := ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,755 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {127122#true} {127122#true} #1025#return; {127122#true} is VALID [2022-02-20 19:57:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 19:57:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {127122#true} havoc ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {127122#true} is VALID [2022-02-20 19:57:57,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} #res := ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,759 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {127122#true} {127162#(not (= ~c_dr_st~0 0))} #1025#return; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {127122#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;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {127122#true} is VALID [2022-02-20 19:57:57,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {127122#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {127122#true} is VALID [2022-02-20 19:57:57,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {127122#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {127124#(= ~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; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {127124#(= ~q_read_ev~0 2)} call update_channels1(); {127168#(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:57,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {127168#(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); {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:57,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:57,761 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {127169#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {127124#(= ~q_read_ev~0 2)} #1017#return; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {127124#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {127124#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {127124#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {127124#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {127124#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,763 INFO L272 TraceCheckUtils]: 12: Hoare triple {127124#(= ~q_read_ev~0 2)} call fire_delta_events1(); {127170#(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:57,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {127170#(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); {127122#true} is VALID [2022-02-20 19:57:57,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {127122#true} assume !(0 == ~q_write_ev~0); {127122#true} is VALID [2022-02-20 19:57:57,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,763 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {127122#true} {127124#(= ~q_read_ev~0 2)} #1019#return; {127122#true} is VALID [2022-02-20 19:57:57,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {127122#true} call activate_threads1(); {127171#(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:57,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {127171#(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; {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L272 TraceCheckUtils]: 19: Hoare triple {127122#true} call #t~ret8 := is_do_write_p_triggered(); {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {127122#true} havoc ~__retres1~0; {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {127122#true} assume !(1 == ~p_dw_pc~0); {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {127122#true} ~__retres1~0 := 0; {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {127122#true} #res := ~__retres1~0; {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {127122#true} {127122#true} #1013#return; {127122#true} is VALID [2022-02-20 19:57:57,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {127122#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {127122#true} assume !(0 != ~tmp~1); {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L272 TraceCheckUtils]: 28: Hoare triple {127122#true} call #t~ret9 := is_do_read_c_triggered(); {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {127122#true} havoc ~__retres1~1; {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {127122#true} assume !(1 == ~c_dr_pc~0); {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {127122#true} ~__retres1~1 := 0; {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {127122#true} #res := ~__retres1~1; {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {127122#true} {127122#true} #1015#return; {127122#true} is VALID [2022-02-20 19:57:57,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {127122#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {127122#true} is VALID [2022-02-20 19:57:57,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {127122#true} assume !(0 != ~tmp___0~1); {127122#true} is VALID [2022-02-20 19:57:57,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,766 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {127122#true} {127122#true} #1021#return; {127122#true} is VALID [2022-02-20 19:57:57,766 INFO L272 TraceCheckUtils]: 39: Hoare triple {127122#true} call reset_delta_events1(); {127170#(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:57,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {127170#(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); {127122#true} is VALID [2022-02-20 19:57:57,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {127122#true} assume !(1 == ~q_write_ev~0); {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {127122#true} {127122#true} #1023#return; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {127122#true} assume !false; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {127122#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; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {127122#true} assume !false; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L272 TraceCheckUtils]: 47: Hoare triple {127122#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {127122#true} havoc ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {127122#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {127122#true} is VALID [2022-02-20 19:57:57,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {127122#true} #res := ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {127122#true} {127122#true} #1025#return; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {127122#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; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {127122#true} assume 0 != eval1_~tmp___1~0#1; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {127122#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; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {127122#true} assume !(0 != eval1_~tmp~2#1); {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {127122#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {127122#true} is VALID [2022-02-20 19:57:57,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {127122#true} 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; {127122#true} is VALID [2022-02-20 19:57:57,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {127122#true} assume 0 == ~c_dr_pc~0; {127122#true} is VALID [2022-02-20 19:57:57,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {127122#true} assume !false; {127122#true} is VALID [2022-02-20 19:57:57,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {127122#true} assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume { :end_inline_do_read_c } true; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume !false; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,770 INFO L272 TraceCheckUtils]: 64: Hoare triple {127162#(not (= ~c_dr_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {127122#true} is VALID [2022-02-20 19:57:57,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {127122#true} havoc ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {127122#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {127122#true} is VALID [2022-02-20 19:57:57,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {127122#true} #res := ~__retres1~2; {127122#true} is VALID [2022-02-20 19:57:57,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {127122#true} assume true; {127122#true} is VALID [2022-02-20 19:57:57,771 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {127122#true} {127162#(not (= ~c_dr_st~0 0))} #1025#return; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume 0 != eval1_~tmp___1~0#1; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume !(0 != eval1_~tmp~2#1); {127162#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {127162#(not (= ~c_dr_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {127123#false} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {127123#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; {127123#false} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {127123#false} assume !(0 == ~c_dr_pc~0); {127123#false} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {127123#false} assume 1 == ~c_dr_pc~0; {127123#false} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {127123#false} do_read_c_~a~0#1 := ~a_t~0; {127123#false} is VALID [2022-02-20 19:57:57,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {127123#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; {127123#false} is VALID [2022-02-20 19:57:57,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {127123#false} assume ~p_last_write~0 == ~c_last_read~0; {127123#false} is VALID [2022-02-20 19:57:57,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {127123#false} assume !(~p_num_write~0 == ~c_num_read~0); {127123#false} is VALID [2022-02-20 19:57:57,773 INFO L272 TraceCheckUtils]: 82: Hoare triple {127123#false} call error1(); {127123#false} is VALID [2022-02-20 19:57:57,773 INFO L290 TraceCheckUtils]: 83: Hoare triple {127123#false} assume !false; {127123#false} is VALID [2022-02-20 19:57:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 19:57:57,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:57,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275256217] [2022-02-20 19:57:57,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275256217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:57,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:57,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:57,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904085960] [2022-02-20 19:57:57,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:57,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-02-20 19:57:57,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:57,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 19:57:57,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:57,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:57,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:57,821 INFO L87 Difference]: Start difference. First operand 3525 states and 4373 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)