./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.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 20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:25,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:25,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:25,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:25,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:25,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:25,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:25,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:25,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:25,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:25,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:25,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:25,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:25,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:25,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:25,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:25,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:25,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:25,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:25,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:25,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:25,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:25,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:25,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:25,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:25,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:25,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:25,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:25,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:25,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:25,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:25,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:25,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:25,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:25,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:25,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:25,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:25,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:25,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:25,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:25,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:25,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:00:25,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:25,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:25,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:25,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:25,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:25,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:25,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:25,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:25,803 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:25,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:25,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:25,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:25,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:25,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:25,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:25,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:25,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:25,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:25,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:25,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:25,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:25,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:25,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:25,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:25,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:25,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:25,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:25,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:25,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:25,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:25,806 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:25,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:25,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:25,807 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 -> 20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb [2022-02-20 20:00:25,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:26,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:26,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:26,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:26,009 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:26,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c [2022-02-20 20:00:26,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bfcc2b3/4a6defcad4124e5abbfd6e96c5f92ef1/FLAG7fb26aaf3 [2022-02-20 20:00:26,505 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:26,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c [2022-02-20 20:00:26,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bfcc2b3/4a6defcad4124e5abbfd6e96c5f92ef1/FLAG7fb26aaf3 [2022-02-20 20:00:26,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bfcc2b3/4a6defcad4124e5abbfd6e96c5f92ef1 [2022-02-20 20:00:26,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:26,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:26,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:26,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:26,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:26,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:26" (1/1) ... [2022-02-20 20:00:26,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3adb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:26, skipping insertion in model container [2022-02-20 20:00:26,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:26" (1/1) ... [2022-02-20 20:00:26,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:26,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:27,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[911,924] [2022-02-20 20:00:27,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[8416,8429] [2022-02-20 20:00:27,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:27,189 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:27,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[911,924] [2022-02-20 20:00:27,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[8416,8429] [2022-02-20 20:00:27,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:27,270 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:27,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27 WrapperNode [2022-02-20 20:00:27,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:27,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:27,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:27,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:27,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,372 INFO L137 Inliner]: procedures = 73, calls = 89, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 909 [2022-02-20 20:00:27,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:27,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:27,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:27,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:27,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:27,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:27,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:27,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:27,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (1/1) ... [2022-02-20 20:00:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:27,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:00:27,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:00:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:27,536 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:27,536 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:27,541 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:27,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:27,541 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 20:00:27,541 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 20:00:27,662 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:27,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:28,350 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:28,350 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:00:28,411 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:28,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:28,427 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 20:00:28,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:28 BoogieIcfgContainer [2022-02-20 20:00:28,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:28,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:28,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:28,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:28,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:26" (1/3) ... [2022-02-20 20:00:28,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3500ad94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:28, skipping insertion in model container [2022-02-20 20:00:28,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:27" (2/3) ... [2022-02-20 20:00:28,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3500ad94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:28, skipping insertion in model container [2022-02-20 20:00:28,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:28" (3/3) ... [2022-02-20 20:00:28,436 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-2.c [2022-02-20 20:00:28,440 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:28,440 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:28,477 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:28,481 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:00:28,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 432 states, 373 states have (on average 1.6300268096514745) internal successors, (608), 381 states have internal predecessors, (608), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 20:00:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:28,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:28,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:28,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash 140273204, now seen corresponding path program 1 times [2022-02-20 20:00:28,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:28,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809112506] [2022-02-20 20:00:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {475#(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); {435#true} is VALID [2022-02-20 20:00:28,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {435#true} {437#(= ~p_dw_i~0 1)} #1638#return; {437#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {436#false} #1640#return; {436#false} is VALID [2022-02-20 20:00:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#true} havoc ~__retres1~0; {435#true} is VALID [2022-02-20 20:00:28,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume 1 == ~p_dw_pc~0; {435#true} is VALID [2022-02-20 20:00:28,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} #res := ~__retres1~0; {435#true} is VALID [2022-02-20 20:00:28,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,763 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {435#true} {435#true} #1634#return; {435#true} is VALID [2022-02-20 20:00:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#true} havoc ~__retres1~1; {435#true} is VALID [2022-02-20 20:00:28,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume 1 == ~c_dr_pc~0; {435#true} is VALID [2022-02-20 20:00:28,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {435#true} is VALID [2022-02-20 20:00:28,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} #res := ~__retres1~1; {435#true} is VALID [2022-02-20 20:00:28,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,772 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {435#true} {435#true} #1636#return; {435#true} is VALID [2022-02-20 20:00:28,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#(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; {435#true} is VALID [2022-02-20 20:00:28,773 INFO L272 TraceCheckUtils]: 1: Hoare triple {435#true} call #t~ret8 := is_do_write_p_triggered(); {435#true} is VALID [2022-02-20 20:00:28,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} havoc ~__retres1~0; {435#true} is VALID [2022-02-20 20:00:28,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} assume 1 == ~p_dw_pc~0; {435#true} is VALID [2022-02-20 20:00:28,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} #res := ~__retres1~0; {435#true} is VALID [2022-02-20 20:00:28,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,775 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {435#true} {435#true} #1634#return; {435#true} is VALID [2022-02-20 20:00:28,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {435#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {435#true} is VALID [2022-02-20 20:00:28,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {435#true} is VALID [2022-02-20 20:00:28,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {435#true} call #t~ret9 := is_do_read_c_triggered(); {435#true} is VALID [2022-02-20 20:00:28,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#true} havoc ~__retres1~1; {435#true} is VALID [2022-02-20 20:00:28,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#true} assume 1 == ~c_dr_pc~0; {435#true} is VALID [2022-02-20 20:00:28,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {435#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {435#true} is VALID [2022-02-20 20:00:28,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {435#true} #res := ~__retres1~1; {435#true} is VALID [2022-02-20 20:00:28,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,777 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {435#true} {435#true} #1636#return; {435#true} is VALID [2022-02-20 20:00:28,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {435#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {435#true} is VALID [2022-02-20 20:00:28,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {435#true} is VALID [2022-02-20 20:00:28,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,779 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {435#true} {436#false} #1642#return; {436#false} is VALID [2022-02-20 20:00:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#(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; {435#true} is VALID [2022-02-20 20:00:28,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume !(1 == ~q_write_ev~0); {435#true} is VALID [2022-02-20 20:00:28,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {436#false} #1644#return; {436#false} is VALID [2022-02-20 20:00:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:28,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#true} havoc ~__retres1~2; {435#true} is VALID [2022-02-20 20:00:28,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {435#true} is VALID [2022-02-20 20:00:28,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} #res := ~__retres1~2; {435#true} is VALID [2022-02-20 20:00:28,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,804 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {435#true} {436#false} #1646#return; {436#false} is VALID [2022-02-20 20:00:28,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {435#true} is VALID [2022-02-20 20:00:28,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {435#true} is VALID [2022-02-20 20:00:28,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {437#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:28,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#(= ~p_dw_i~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {437#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:28,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {437#(= ~p_dw_i~0 1)} call update_channels1(); {475#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:28,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#(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); {435#true} is VALID [2022-02-20 20:00:28,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,808 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {435#true} {437#(= ~p_dw_i~0 1)} #1638#return; {437#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:28,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {437#(= ~p_dw_i~0 1)} is VALID [2022-02-20 20:00:28,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {436#false} is VALID [2022-02-20 20:00:28,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {436#false} is VALID [2022-02-20 20:00:28,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#false} assume { :end_inline_init_threads1 } true; {436#false} is VALID [2022-02-20 20:00:28,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {436#false} call fire_delta_events1(); {476#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:28,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {476#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {435#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,810 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {435#true} {436#false} #1640#return; {436#false} is VALID [2022-02-20 20:00:28,810 INFO L272 TraceCheckUtils]: 17: Hoare triple {436#false} call activate_threads1(); {477#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:28,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {477#(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; {435#true} is VALID [2022-02-20 20:00:28,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {435#true} call #t~ret8 := is_do_write_p_triggered(); {435#true} is VALID [2022-02-20 20:00:28,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {435#true} havoc ~__retres1~0; {435#true} is VALID [2022-02-20 20:00:28,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {435#true} assume 1 == ~p_dw_pc~0; {435#true} is VALID [2022-02-20 20:00:28,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {435#true} is VALID [2022-02-20 20:00:28,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {435#true} #res := ~__retres1~0; {435#true} is VALID [2022-02-20 20:00:28,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,812 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {435#true} {435#true} #1634#return; {435#true} is VALID [2022-02-20 20:00:28,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {435#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {435#true} is VALID [2022-02-20 20:00:28,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {435#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {435#true} is VALID [2022-02-20 20:00:28,812 INFO L272 TraceCheckUtils]: 28: Hoare triple {435#true} call #t~ret9 := is_do_read_c_triggered(); {435#true} is VALID [2022-02-20 20:00:28,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {435#true} havoc ~__retres1~1; {435#true} is VALID [2022-02-20 20:00:28,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {435#true} assume 1 == ~c_dr_pc~0; {435#true} is VALID [2022-02-20 20:00:28,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {435#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {435#true} is VALID [2022-02-20 20:00:28,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {435#true} #res := ~__retres1~1; {435#true} is VALID [2022-02-20 20:00:28,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,813 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {435#true} {435#true} #1636#return; {435#true} is VALID [2022-02-20 20:00:28,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {435#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {435#true} is VALID [2022-02-20 20:00:28,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {435#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {435#true} is VALID [2022-02-20 20:00:28,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,814 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {435#true} {436#false} #1642#return; {436#false} is VALID [2022-02-20 20:00:28,814 INFO L272 TraceCheckUtils]: 39: Hoare triple {436#false} call reset_delta_events1(); {476#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:28,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {476#(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; {435#true} is VALID [2022-02-20 20:00:28,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {435#true} assume !(1 == ~q_write_ev~0); {435#true} is VALID [2022-02-20 20:00:28,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,815 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {435#true} {436#false} #1644#return; {436#false} is VALID [2022-02-20 20:00:28,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-02-20 20:00:28,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {436#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; {436#false} is VALID [2022-02-20 20:00:28,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-02-20 20:00:28,816 INFO L272 TraceCheckUtils]: 47: Hoare triple {436#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {435#true} is VALID [2022-02-20 20:00:28,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {435#true} havoc ~__retres1~2; {435#true} is VALID [2022-02-20 20:00:28,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {435#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {435#true} is VALID [2022-02-20 20:00:28,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {435#true} #res := ~__retres1~2; {435#true} is VALID [2022-02-20 20:00:28,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 20:00:28,834 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {435#true} {436#false} #1646#return; {436#false} is VALID [2022-02-20 20:00:28,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {436#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; {436#false} is VALID [2022-02-20 20:00:28,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {436#false} assume 0 != eval1_~tmp___1~0#1; {436#false} is VALID [2022-02-20 20:00:28,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {436#false} assume !(0 == ~p_dw_st~0); {436#false} is VALID [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {436#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; {436#false} is VALID [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {436#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; {436#false} is VALID [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {436#false} assume !(0 == ~c_dr_pc~0); {436#false} is VALID [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {436#false} assume 2 == ~c_dr_pc~0; {436#false} is VALID [2022-02-20 20:00:28,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {436#false} do_read_c_~a~0#1 := ~a_t~0; {436#false} is VALID [2022-02-20 20:00:28,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {436#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; {436#false} is VALID [2022-02-20 20:00:28,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {436#false} assume !(~p_last_write~0 == ~c_last_read~0); {436#false} is VALID [2022-02-20 20:00:28,836 INFO L272 TraceCheckUtils]: 63: Hoare triple {436#false} call error1(); {436#false} is VALID [2022-02-20 20:00:28,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-02-20 20:00:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:28,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:28,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809112506] [2022-02-20 20:00:28,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809112506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:28,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:28,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:28,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806462557] [2022-02-20 20:00:28,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:28,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:28,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:28,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:28,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:28,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:28,911 INFO L87 Difference]: Start difference. First operand has 432 states, 373 states have (on average 1.6300268096514745) internal successors, (608), 381 states have internal predecessors, (608), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:30,981 INFO L93 Difference]: Finished difference Result 857 states and 1368 transitions. [2022-02-20 20:00:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1368 transitions. [2022-02-20 20:00:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1368 transitions. [2022-02-20 20:00:31,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1368 transitions. [2022-02-20 20:00:31,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1368 edges. 1368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:31,932 INFO L225 Difference]: With dead ends: 857 [2022-02-20 20:00:31,932 INFO L226 Difference]: Without dead ends: 439 [2022-02-20 20:00:31,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:31,938 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 669 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:31,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 1793 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:00:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-02-20 20:00:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2022-02-20 20:00:31,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:31,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 439 states. Second operand has 421 states, 365 states have (on average 1.5424657534246575) internal successors, (563), 370 states have internal predecessors, (563), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:31,981 INFO L74 IsIncluded]: Start isIncluded. First operand 439 states. Second operand has 421 states, 365 states have (on average 1.5424657534246575) internal successors, (563), 370 states have internal predecessors, (563), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:31,983 INFO L87 Difference]: Start difference. First operand 439 states. Second operand has 421 states, 365 states have (on average 1.5424657534246575) internal successors, (563), 370 states have internal predecessors, (563), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:32,012 INFO L93 Difference]: Finished difference Result 439 states and 670 transitions. [2022-02-20 20:00:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 670 transitions. [2022-02-20 20:00:32,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:32,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:32,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 421 states, 365 states have (on average 1.5424657534246575) internal successors, (563), 370 states have internal predecessors, (563), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 439 states. [2022-02-20 20:00:32,018 INFO L87 Difference]: Start difference. First operand has 421 states, 365 states have (on average 1.5424657534246575) internal successors, (563), 370 states have internal predecessors, (563), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 439 states. [2022-02-20 20:00:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:32,033 INFO L93 Difference]: Finished difference Result 439 states and 670 transitions. [2022-02-20 20:00:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 670 transitions. [2022-02-20 20:00:32,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:32,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:32,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:32,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 365 states have (on average 1.5424657534246575) internal successors, (563), 370 states have internal predecessors, (563), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 20:00:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 641 transitions. [2022-02-20 20:00:32,052 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 641 transitions. Word has length 65 [2022-02-20 20:00:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:32,053 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 641 transitions. [2022-02-20 20:00:32,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 641 transitions. [2022-02-20 20:00:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:32,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:32,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:32,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:32,055 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 99598454, now seen corresponding path program 1 times [2022-02-20 20:00:32,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:32,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085480317] [2022-02-20 20:00:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {3109#(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); {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:32,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:32,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3071#(= ~q_read_ev~0 2)} #1638#return; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {3111#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {3112#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:32,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {3112#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3112#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:32,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {3112#(= |old(~q_read_ev~0)| 0)} assume true; {3112#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:32,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3112#(= |old(~q_read_ev~0)| 0)} {3071#(= ~q_read_ev~0 2)} #1640#return; {3070#false} is VALID [2022-02-20 20:00:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {3069#true} havoc ~__retres1~0; {3069#true} is VALID [2022-02-20 20:00:32,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {3069#true} assume 1 == ~p_dw_pc~0; {3069#true} is VALID [2022-02-20 20:00:32,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {3069#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3069#true} is VALID [2022-02-20 20:00:32,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {3069#true} #res := ~__retres1~0; {3069#true} is VALID [2022-02-20 20:00:32,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,165 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3069#true} {3069#true} #1634#return; {3069#true} is VALID [2022-02-20 20:00:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {3069#true} havoc ~__retres1~1; {3069#true} is VALID [2022-02-20 20:00:32,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3069#true} assume 1 == ~c_dr_pc~0; {3069#true} is VALID [2022-02-20 20:00:32,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {3069#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3069#true} is VALID [2022-02-20 20:00:32,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {3069#true} #res := ~__retres1~1; {3069#true} is VALID [2022-02-20 20:00:32,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,170 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3069#true} {3069#true} #1636#return; {3069#true} is VALID [2022-02-20 20:00:32,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {3113#(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; {3069#true} is VALID [2022-02-20 20:00:32,170 INFO L272 TraceCheckUtils]: 1: Hoare triple {3069#true} call #t~ret8 := is_do_write_p_triggered(); {3069#true} is VALID [2022-02-20 20:00:32,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {3069#true} havoc ~__retres1~0; {3069#true} is VALID [2022-02-20 20:00:32,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {3069#true} assume 1 == ~p_dw_pc~0; {3069#true} is VALID [2022-02-20 20:00:32,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {3069#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3069#true} is VALID [2022-02-20 20:00:32,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {3069#true} #res := ~__retres1~0; {3069#true} is VALID [2022-02-20 20:00:32,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,171 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3069#true} {3069#true} #1634#return; {3069#true} is VALID [2022-02-20 20:00:32,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {3069#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3069#true} is VALID [2022-02-20 20:00:32,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {3069#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3069#true} is VALID [2022-02-20 20:00:32,172 INFO L272 TraceCheckUtils]: 10: Hoare triple {3069#true} call #t~ret9 := is_do_read_c_triggered(); {3069#true} is VALID [2022-02-20 20:00:32,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {3069#true} havoc ~__retres1~1; {3069#true} is VALID [2022-02-20 20:00:32,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {3069#true} assume 1 == ~c_dr_pc~0; {3069#true} is VALID [2022-02-20 20:00:32,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {3069#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3069#true} is VALID [2022-02-20 20:00:32,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {3069#true} #res := ~__retres1~1; {3069#true} is VALID [2022-02-20 20:00:32,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3069#true} {3069#true} #1636#return; {3069#true} is VALID [2022-02-20 20:00:32,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3069#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3069#true} is VALID [2022-02-20 20:00:32,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {3069#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3069#true} is VALID [2022-02-20 20:00:32,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,173 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3069#true} {3070#false} #1642#return; {3070#false} is VALID [2022-02-20 20:00:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {3111#(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; {3069#true} is VALID [2022-02-20 20:00:32,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {3069#true} assume !(1 == ~q_write_ev~0); {3069#true} is VALID [2022-02-20 20:00:32,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3069#true} {3070#false} #1644#return; {3070#false} is VALID [2022-02-20 20:00:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:32,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {3069#true} havoc ~__retres1~2; {3069#true} is VALID [2022-02-20 20:00:32,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {3069#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3069#true} is VALID [2022-02-20 20:00:32,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {3069#true} #res := ~__retres1~2; {3069#true} is VALID [2022-02-20 20:00:32,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,183 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3069#true} {3070#false} #1646#return; {3070#false} is VALID [2022-02-20 20:00:32,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {3069#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {3069#true} is VALID [2022-02-20 20:00:32,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3069#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {3069#true} is VALID [2022-02-20 20:00:32,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3069#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {3071#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {3071#(= ~q_read_ev~0 2)} call update_channels1(); {3109#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:32,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {3109#(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); {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:32,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:32,186 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3110#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3071#(= ~q_read_ev~0 2)} #1638#return; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {3071#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {3071#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {3071#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {3071#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {3071#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:32,188 INFO L272 TraceCheckUtils]: 12: Hoare triple {3071#(= ~q_read_ev~0 2)} call fire_delta_events1(); {3111#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:32,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {3111#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {3112#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:32,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {3112#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3112#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:32,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {3112#(= |old(~q_read_ev~0)| 0)} assume true; {3112#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:32,189 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3112#(= |old(~q_read_ev~0)| 0)} {3071#(= ~q_read_ev~0 2)} #1640#return; {3070#false} is VALID [2022-02-20 20:00:32,190 INFO L272 TraceCheckUtils]: 17: Hoare triple {3070#false} call activate_threads1(); {3113#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:32,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {3113#(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; {3069#true} is VALID [2022-02-20 20:00:32,190 INFO L272 TraceCheckUtils]: 19: Hoare triple {3069#true} call #t~ret8 := is_do_write_p_triggered(); {3069#true} is VALID [2022-02-20 20:00:32,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {3069#true} havoc ~__retres1~0; {3069#true} is VALID [2022-02-20 20:00:32,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {3069#true} assume 1 == ~p_dw_pc~0; {3069#true} is VALID [2022-02-20 20:00:32,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {3069#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3069#true} is VALID [2022-02-20 20:00:32,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {3069#true} #res := ~__retres1~0; {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3069#true} {3069#true} #1634#return; {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {3069#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {3069#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L272 TraceCheckUtils]: 28: Hoare triple {3069#true} call #t~ret9 := is_do_read_c_triggered(); {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {3069#true} havoc ~__retres1~1; {3069#true} is VALID [2022-02-20 20:00:32,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {3069#true} assume 1 == ~c_dr_pc~0; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {3069#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {3069#true} #res := ~__retres1~1; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3069#true} {3069#true} #1636#return; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {3069#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {3069#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3069#true} is VALID [2022-02-20 20:00:32,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,193 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3069#true} {3070#false} #1642#return; {3070#false} is VALID [2022-02-20 20:00:32,193 INFO L272 TraceCheckUtils]: 39: Hoare triple {3070#false} call reset_delta_events1(); {3111#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:32,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {3111#(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; {3069#true} is VALID [2022-02-20 20:00:32,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {3069#true} assume !(1 == ~q_write_ev~0); {3069#true} is VALID [2022-02-20 20:00:32,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,193 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3069#true} {3070#false} #1644#return; {3070#false} is VALID [2022-02-20 20:00:32,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {3070#false} assume !false; {3070#false} is VALID [2022-02-20 20:00:32,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {3070#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; {3070#false} is VALID [2022-02-20 20:00:32,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {3070#false} assume !false; {3070#false} is VALID [2022-02-20 20:00:32,194 INFO L272 TraceCheckUtils]: 47: Hoare triple {3070#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3069#true} is VALID [2022-02-20 20:00:32,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {3069#true} havoc ~__retres1~2; {3069#true} is VALID [2022-02-20 20:00:32,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {3069#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3069#true} is VALID [2022-02-20 20:00:32,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {3069#true} #res := ~__retres1~2; {3069#true} is VALID [2022-02-20 20:00:32,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {3069#true} assume true; {3069#true} is VALID [2022-02-20 20:00:32,195 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3069#true} {3070#false} #1646#return; {3070#false} is VALID [2022-02-20 20:00:32,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {3070#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; {3070#false} is VALID [2022-02-20 20:00:32,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {3070#false} assume 0 != eval1_~tmp___1~0#1; {3070#false} is VALID [2022-02-20 20:00:32,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {3070#false} assume !(0 == ~p_dw_st~0); {3070#false} is VALID [2022-02-20 20:00:32,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {3070#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; {3070#false} is VALID [2022-02-20 20:00:32,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {3070#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; {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {3070#false} assume !(0 == ~c_dr_pc~0); {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {3070#false} assume 2 == ~c_dr_pc~0; {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {3070#false} do_read_c_~a~0#1 := ~a_t~0; {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {3070#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; {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {3070#false} assume !(~p_last_write~0 == ~c_last_read~0); {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L272 TraceCheckUtils]: 63: Hoare triple {3070#false} call error1(); {3070#false} is VALID [2022-02-20 20:00:32,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {3070#false} assume !false; {3070#false} is VALID [2022-02-20 20:00:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:32,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:32,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085480317] [2022-02-20 20:00:32,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085480317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:32,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:32,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:32,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452689007] [2022-02-20 20:00:32,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:32,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:32,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:32,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:32,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:32,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:32,237 INFO L87 Difference]: Start difference. First operand 421 states and 641 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,066 INFO L93 Difference]: Finished difference Result 676 states and 1010 transitions. [2022-02-20 20:00:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:35,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1010 transitions. [2022-02-20 20:00:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1010 transitions. [2022-02-20 20:00:35,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1010 transitions. [2022-02-20 20:00:35,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1010 edges. 1010 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:35,768 INFO L225 Difference]: With dead ends: 676 [2022-02-20 20:00:35,769 INFO L226 Difference]: Without dead ends: 572 [2022-02-20 20:00:35,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:35,774 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 1107 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:35,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 2140 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-02-20 20:00:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 533. [2022-02-20 20:00:35,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:35,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 572 states. Second operand has 533 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 462 states have internal predecessors, (689), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:35,806 INFO L74 IsIncluded]: Start isIncluded. First operand 572 states. Second operand has 533 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 462 states have internal predecessors, (689), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:35,809 INFO L87 Difference]: Start difference. First operand 572 states. Second operand has 533 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 462 states have internal predecessors, (689), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,829 INFO L93 Difference]: Finished difference Result 572 states and 854 transitions. [2022-02-20 20:00:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 854 transitions. [2022-02-20 20:00:35,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:35,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:35,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 533 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 462 states have internal predecessors, (689), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 572 states. [2022-02-20 20:00:35,834 INFO L87 Difference]: Start difference. First operand has 533 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 462 states have internal predecessors, (689), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 572 states. [2022-02-20 20:00:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,850 INFO L93 Difference]: Finished difference Result 572 states and 854 transitions. [2022-02-20 20:00:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 854 transitions. [2022-02-20 20:00:35,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:35,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:35,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:35,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 462 states have internal predecessors, (689), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 798 transitions. [2022-02-20 20:00:35,869 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 798 transitions. Word has length 65 [2022-02-20 20:00:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:35,870 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 798 transitions. [2022-02-20 20:00:35,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 798 transitions. [2022-02-20 20:00:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:35,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:35,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:35,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:35,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1778487094, now seen corresponding path program 1 times [2022-02-20 20:00:35,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:35,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682870072] [2022-02-20 20:00:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {5942#(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); {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:35,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:35,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5904#(= ~q_write_ev~0 ~q_read_ev~0)} #1638#return; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {5943#(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); {5944#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:35,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {5944#(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; {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:35,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:35,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5904#(= ~q_write_ev~0 ~q_read_ev~0)} #1640#return; {5903#false} is VALID [2022-02-20 20:00:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {5902#true} havoc ~__retres1~0; {5902#true} is VALID [2022-02-20 20:00:35,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#true} assume 1 == ~p_dw_pc~0; {5902#true} is VALID [2022-02-20 20:00:35,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5902#true} is VALID [2022-02-20 20:00:35,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {5902#true} #res := ~__retres1~0; {5902#true} is VALID [2022-02-20 20:00:35,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:35,992 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5902#true} {5902#true} #1634#return; {5902#true} is VALID [2022-02-20 20:00:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {5902#true} havoc ~__retres1~1; {5902#true} is VALID [2022-02-20 20:00:35,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#true} assume 1 == ~c_dr_pc~0; {5902#true} is VALID [2022-02-20 20:00:35,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5902#true} is VALID [2022-02-20 20:00:35,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {5902#true} #res := ~__retres1~1; {5902#true} is VALID [2022-02-20 20:00:35,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:35,997 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5902#true} {5902#true} #1636#return; {5902#true} is VALID [2022-02-20 20:00:35,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {5946#(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; {5902#true} is VALID [2022-02-20 20:00:35,997 INFO L272 TraceCheckUtils]: 1: Hoare triple {5902#true} call #t~ret8 := is_do_write_p_triggered(); {5902#true} is VALID [2022-02-20 20:00:35,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} havoc ~__retres1~0; {5902#true} is VALID [2022-02-20 20:00:35,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {5902#true} assume 1 == ~p_dw_pc~0; {5902#true} is VALID [2022-02-20 20:00:35,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {5902#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5902#true} is VALID [2022-02-20 20:00:35,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {5902#true} #res := ~__retres1~0; {5902#true} is VALID [2022-02-20 20:00:35,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:35,998 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5902#true} {5902#true} #1634#return; {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {5902#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {5902#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L272 TraceCheckUtils]: 10: Hoare triple {5902#true} call #t~ret9 := is_do_read_c_triggered(); {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {5902#true} havoc ~__retres1~1; {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {5902#true} assume 1 == ~c_dr_pc~0; {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {5902#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5902#true} is VALID [2022-02-20 20:00:35,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {5902#true} #res := ~__retres1~1; {5902#true} is VALID [2022-02-20 20:00:36,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,000 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5902#true} {5902#true} #1636#return; {5902#true} is VALID [2022-02-20 20:00:36,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {5902#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5902#true} is VALID [2022-02-20 20:00:36,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {5902#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5902#true} is VALID [2022-02-20 20:00:36,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,000 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5902#true} {5903#false} #1642#return; {5903#false} is VALID [2022-02-20 20:00:36,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {5943#(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); {5902#true} is VALID [2022-02-20 20:00:36,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#true} assume !(1 == ~q_write_ev~0); {5902#true} is VALID [2022-02-20 20:00:36,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5902#true} {5903#false} #1644#return; {5903#false} is VALID [2022-02-20 20:00:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {5902#true} havoc ~__retres1~2; {5902#true} is VALID [2022-02-20 20:00:36,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5902#true} is VALID [2022-02-20 20:00:36,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} #res := ~__retres1~2; {5902#true} is VALID [2022-02-20 20:00:36,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,008 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5902#true} {5903#false} #1646#return; {5903#false} is VALID [2022-02-20 20:00:36,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {5902#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {5902#true} is VALID [2022-02-20 20:00:36,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {5902#true} is VALID [2022-02-20 20:00:36,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5942#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:36,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {5942#(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); {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:36,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:36,011 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5904#(= ~q_write_ev~0 ~q_read_ev~0)} #1638#return; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {5904#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:36,013 INFO L272 TraceCheckUtils]: 12: Hoare triple {5904#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:36,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {5943#(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); {5944#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:36,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {5944#(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; {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:36,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:36,014 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5945#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5904#(= ~q_write_ev~0 ~q_read_ev~0)} #1640#return; {5903#false} is VALID [2022-02-20 20:00:36,014 INFO L272 TraceCheckUtils]: 17: Hoare triple {5903#false} call activate_threads1(); {5946#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:36,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {5946#(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; {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {5902#true} call #t~ret8 := is_do_write_p_triggered(); {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {5902#true} havoc ~__retres1~0; {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {5902#true} assume 1 == ~p_dw_pc~0; {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {5902#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {5902#true} #res := ~__retres1~0; {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,015 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5902#true} {5902#true} #1634#return; {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {5902#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {5902#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L272 TraceCheckUtils]: 28: Hoare triple {5902#true} call #t~ret9 := is_do_read_c_triggered(); {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {5902#true} havoc ~__retres1~1; {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {5902#true} assume 1 == ~c_dr_pc~0; {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {5902#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5902#true} is VALID [2022-02-20 20:00:36,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {5902#true} #res := ~__retres1~1; {5902#true} is VALID [2022-02-20 20:00:36,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,017 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5902#true} {5902#true} #1636#return; {5902#true} is VALID [2022-02-20 20:00:36,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {5902#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5902#true} is VALID [2022-02-20 20:00:36,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {5902#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5902#true} is VALID [2022-02-20 20:00:36,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,017 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5902#true} {5903#false} #1642#return; {5903#false} is VALID [2022-02-20 20:00:36,017 INFO L272 TraceCheckUtils]: 39: Hoare triple {5903#false} call reset_delta_events1(); {5943#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:36,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {5943#(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); {5902#true} is VALID [2022-02-20 20:00:36,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {5902#true} assume !(1 == ~q_write_ev~0); {5902#true} is VALID [2022-02-20 20:00:36,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,018 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5902#true} {5903#false} #1644#return; {5903#false} is VALID [2022-02-20 20:00:36,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {5903#false} assume !false; {5903#false} is VALID [2022-02-20 20:00:36,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {5903#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; {5903#false} is VALID [2022-02-20 20:00:36,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {5903#false} assume !false; {5903#false} is VALID [2022-02-20 20:00:36,019 INFO L272 TraceCheckUtils]: 47: Hoare triple {5903#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5902#true} is VALID [2022-02-20 20:00:36,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {5902#true} havoc ~__retres1~2; {5902#true} is VALID [2022-02-20 20:00:36,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {5902#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5902#true} is VALID [2022-02-20 20:00:36,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {5902#true} #res := ~__retres1~2; {5902#true} is VALID [2022-02-20 20:00:36,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-02-20 20:00:36,019 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5902#true} {5903#false} #1646#return; {5903#false} is VALID [2022-02-20 20:00:36,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {5903#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; {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {5903#false} assume 0 != eval1_~tmp___1~0#1; {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {5903#false} assume !(0 == ~p_dw_st~0); {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {5903#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; {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {5903#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; {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {5903#false} assume !(0 == ~c_dr_pc~0); {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {5903#false} assume 2 == ~c_dr_pc~0; {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {5903#false} do_read_c_~a~0#1 := ~a_t~0; {5903#false} is VALID [2022-02-20 20:00:36,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {5903#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; {5903#false} is VALID [2022-02-20 20:00:36,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {5903#false} assume !(~p_last_write~0 == ~c_last_read~0); {5903#false} is VALID [2022-02-20 20:00:36,021 INFO L272 TraceCheckUtils]: 63: Hoare triple {5903#false} call error1(); {5903#false} is VALID [2022-02-20 20:00:36,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {5903#false} assume !false; {5903#false} is VALID [2022-02-20 20:00:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:36,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:36,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682870072] [2022-02-20 20:00:36,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682870072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:36,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:36,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:36,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860453929] [2022-02-20 20:00:36,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:36,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:36,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:36,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:36,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:36,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:36,055 INFO L87 Difference]: Start difference. First operand 533 states and 798 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,218 INFO L93 Difference]: Finished difference Result 930 states and 1363 transitions. [2022-02-20 20:00:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1040 transitions. [2022-02-20 20:00:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1040 transitions. [2022-02-20 20:00:39,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1040 transitions. [2022-02-20 20:00:39,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1040 edges. 1040 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:39,943 INFO L225 Difference]: With dead ends: 930 [2022-02-20 20:00:39,944 INFO L226 Difference]: Without dead ends: 721 [2022-02-20 20:00:39,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:39,949 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 1553 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:39,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1584 Valid, 1995 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-02-20 20:00:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 645. [2022-02-20 20:00:39,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:39,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 645 states, 545 states have (on average 1.4935779816513761) internal successors, (814), 554 states have internal predecessors, (814), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,975 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 645 states, 545 states have (on average 1.4935779816513761) internal successors, (814), 554 states have internal predecessors, (814), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,976 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 645 states, 545 states have (on average 1.4935779816513761) internal successors, (814), 554 states have internal predecessors, (814), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,995 INFO L93 Difference]: Finished difference Result 721 states and 1071 transitions. [2022-02-20 20:00:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1071 transitions. [2022-02-20 20:00:39,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:39,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:40,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 545 states have (on average 1.4935779816513761) internal successors, (814), 554 states have internal predecessors, (814), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) Second operand 721 states. [2022-02-20 20:00:40,001 INFO L87 Difference]: Start difference. First operand has 645 states, 545 states have (on average 1.4935779816513761) internal successors, (814), 554 states have internal predecessors, (814), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) Second operand 721 states. [2022-02-20 20:00:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,040 INFO L93 Difference]: Finished difference Result 721 states and 1071 transitions. [2022-02-20 20:00:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1071 transitions. [2022-02-20 20:00:40,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:40,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:40,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:40,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 545 states have (on average 1.4935779816513761) internal successors, (814), 554 states have internal predecessors, (814), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-02-20 20:00:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 957 transitions. [2022-02-20 20:00:40,065 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 957 transitions. Word has length 65 [2022-02-20 20:00:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:40,065 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 957 transitions. [2022-02-20 20:00:40,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 957 transitions. [2022-02-20 20:00:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:40,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:40,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:40,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:40,068 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash -250099016, now seen corresponding path program 1 times [2022-02-20 20:00:40,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:40,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883716152] [2022-02-20 20:00:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {9569#(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); {9570#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:40,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {9570#(not (= |old(~q_req_up~0)| 1))} assume true; {9570#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:40,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9570#(not (= |old(~q_req_up~0)| 1))} {9530#(= ~q_req_up~0 ~p_dw_pc~0)} #1638#return; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {9571#(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); {9527#true} is VALID [2022-02-20 20:00:40,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#true} assume !(0 == ~q_write_ev~0); {9527#true} is VALID [2022-02-20 20:00:40,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9527#true} {9534#(not (= ~p_dw_pc~0 1))} #1640#return; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {9527#true} havoc ~__retres1~0; {9527#true} is VALID [2022-02-20 20:00:40,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#true} assume 1 == ~p_dw_pc~0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,194 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} {9527#true} #1634#return; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {9527#true} havoc ~__retres1~1; {9527#true} is VALID [2022-02-20 20:00:40,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#true} assume 1 == ~c_dr_pc~0; {9527#true} is VALID [2022-02-20 20:00:40,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9527#true} is VALID [2022-02-20 20:00:40,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#true} #res := ~__retres1~1; {9527#true} is VALID [2022-02-20 20:00:40,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,199 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9527#true} {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} #1636#return; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {9572#(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; {9527#true} is VALID [2022-02-20 20:00:40,199 INFO L272 TraceCheckUtils]: 1: Hoare triple {9527#true} call #t~ret8 := is_do_write_p_triggered(); {9527#true} is VALID [2022-02-20 20:00:40,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#true} havoc ~__retres1~0; {9527#true} is VALID [2022-02-20 20:00:40,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#true} assume 1 == ~p_dw_pc~0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,201 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} {9527#true} #1634#return; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,202 INFO L272 TraceCheckUtils]: 10: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {9527#true} is VALID [2022-02-20 20:00:40,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {9527#true} havoc ~__retres1~1; {9527#true} is VALID [2022-02-20 20:00:40,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#true} assume 1 == ~c_dr_pc~0; {9527#true} is VALID [2022-02-20 20:00:40,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {9527#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9527#true} is VALID [2022-02-20 20:00:40,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {9527#true} #res := ~__retres1~1; {9527#true} is VALID [2022-02-20 20:00:40,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,213 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9527#true} {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} #1636#return; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,217 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} {9534#(not (= ~p_dw_pc~0 1))} #1642#return; {9528#false} is VALID [2022-02-20 20:00:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {9571#(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); {9527#true} is VALID [2022-02-20 20:00:40,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#true} assume !(1 == ~q_write_ev~0); {9527#true} is VALID [2022-02-20 20:00:40,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9527#true} {9528#false} #1644#return; {9528#false} is VALID [2022-02-20 20:00:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {9527#true} havoc ~__retres1~2; {9527#true} is VALID [2022-02-20 20:00:40,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9527#true} is VALID [2022-02-20 20:00:40,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#true} #res := ~__retres1~2; {9527#true} is VALID [2022-02-20 20:00:40,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,234 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9527#true} {9528#false} #1646#return; {9528#false} is VALID [2022-02-20 20:00:40,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {9527#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {9529#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:40,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {9529#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {9529#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:40,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {9529#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {9530#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:40,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {9530#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {9530#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:40,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {9530#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {9569#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:40,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {9569#(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); {9570#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:40,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {9570#(not (= |old(~q_req_up~0)| 1))} assume true; {9570#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:40,238 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9570#(not (= |old(~q_req_up~0)| 1))} {9530#(= ~q_req_up~0 ~p_dw_pc~0)} #1638#return; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {9534#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {9534#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {9534#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {9534#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,239 INFO L272 TraceCheckUtils]: 12: Hoare triple {9534#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {9571#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:40,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {9571#(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); {9527#true} is VALID [2022-02-20 20:00:40,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {9527#true} assume !(0 == ~q_write_ev~0); {9527#true} is VALID [2022-02-20 20:00:40,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,240 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9527#true} {9534#(not (= ~p_dw_pc~0 1))} #1640#return; {9534#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:40,240 INFO L272 TraceCheckUtils]: 17: Hoare triple {9534#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {9572#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:40,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(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; {9527#true} is VALID [2022-02-20 20:00:40,241 INFO L272 TraceCheckUtils]: 19: Hoare triple {9527#true} call #t~ret8 := is_do_write_p_triggered(); {9527#true} is VALID [2022-02-20 20:00:40,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {9527#true} havoc ~__retres1~0; {9527#true} is VALID [2022-02-20 20:00:40,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {9527#true} assume 1 == ~p_dw_pc~0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,242 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} {9527#true} #1634#return; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,243 INFO L272 TraceCheckUtils]: 28: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {9527#true} is VALID [2022-02-20 20:00:40,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {9527#true} havoc ~__retres1~1; {9527#true} is VALID [2022-02-20 20:00:40,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {9527#true} assume 1 == ~c_dr_pc~0; {9527#true} is VALID [2022-02-20 20:00:40,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {9527#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9527#true} is VALID [2022-02-20 20:00:40,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {9527#true} #res := ~__retres1~1; {9527#true} is VALID [2022-02-20 20:00:40,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,244 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9527#true} {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} #1636#return; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:40,245 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9579#(= (+ (- 1) ~p_dw_pc~0) 0)} {9534#(not (= ~p_dw_pc~0 1))} #1642#return; {9528#false} is VALID [2022-02-20 20:00:40,246 INFO L272 TraceCheckUtils]: 39: Hoare triple {9528#false} call reset_delta_events1(); {9571#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:40,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {9571#(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); {9527#true} is VALID [2022-02-20 20:00:40,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {9527#true} assume !(1 == ~q_write_ev~0); {9527#true} is VALID [2022-02-20 20:00:40,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,246 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9527#true} {9528#false} #1644#return; {9528#false} is VALID [2022-02-20 20:00:40,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {9528#false} assume !false; {9528#false} is VALID [2022-02-20 20:00:40,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {9528#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; {9528#false} is VALID [2022-02-20 20:00:40,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {9528#false} assume !false; {9528#false} is VALID [2022-02-20 20:00:40,247 INFO L272 TraceCheckUtils]: 47: Hoare triple {9528#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {9527#true} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {9527#true} havoc ~__retres1~2; {9527#true} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {9527#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9527#true} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {9527#true} #res := ~__retres1~2; {9527#true} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {9527#true} assume true; {9527#true} is VALID [2022-02-20 20:00:40,248 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9527#true} {9528#false} #1646#return; {9528#false} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {9528#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; {9528#false} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {9528#false} assume 0 != eval1_~tmp___1~0#1; {9528#false} is VALID [2022-02-20 20:00:40,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {9528#false} assume !(0 == ~p_dw_st~0); {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {9528#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; {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {9528#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; {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {9528#false} assume !(0 == ~c_dr_pc~0); {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {9528#false} assume 2 == ~c_dr_pc~0; {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {9528#false} do_read_c_~a~0#1 := ~a_t~0; {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {9528#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; {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {9528#false} assume !(~p_last_write~0 == ~c_last_read~0); {9528#false} is VALID [2022-02-20 20:00:40,249 INFO L272 TraceCheckUtils]: 63: Hoare triple {9528#false} call error1(); {9528#false} is VALID [2022-02-20 20:00:40,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {9528#false} assume !false; {9528#false} is VALID [2022-02-20 20:00:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:40,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:40,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883716152] [2022-02-20 20:00:40,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883716152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:40,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:40,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:40,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421039454] [2022-02-20 20:00:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:40,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:40,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:40,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:40,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:40,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:40,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:40,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:40,309 INFO L87 Difference]: Start difference. First operand 645 states and 957 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,061 INFO L93 Difference]: Finished difference Result 2191 states and 3154 transitions. [2022-02-20 20:00:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:46,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1445 transitions. [2022-02-20 20:00:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1445 transitions. [2022-02-20 20:00:46,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1445 transitions. [2022-02-20 20:00:47,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1445 edges. 1445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:47,154 INFO L225 Difference]: With dead ends: 2191 [2022-02-20 20:00:47,155 INFO L226 Difference]: Without dead ends: 1858 [2022-02-20 20:00:47,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:47,157 INFO L933 BasicCegarLoop]: 770 mSDtfsCounter, 3353 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3375 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:47,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3375 Valid, 2885 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:00:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2022-02-20 20:00:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1698. [2022-02-20 20:00:47,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:47,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1858 states. Second operand has 1698 states, 1393 states have (on average 1.407035175879397) internal successors, (1960), 1417 states have internal predecessors, (1960), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,229 INFO L74 IsIncluded]: Start isIncluded. First operand 1858 states. Second operand has 1698 states, 1393 states have (on average 1.407035175879397) internal successors, (1960), 1417 states have internal predecessors, (1960), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,232 INFO L87 Difference]: Start difference. First operand 1858 states. Second operand has 1698 states, 1393 states have (on average 1.407035175879397) internal successors, (1960), 1417 states have internal predecessors, (1960), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,339 INFO L93 Difference]: Finished difference Result 1858 states and 2558 transitions. [2022-02-20 20:00:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2558 transitions. [2022-02-20 20:00:47,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 1698 states, 1393 states have (on average 1.407035175879397) internal successors, (1960), 1417 states have internal predecessors, (1960), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) Second operand 1858 states. [2022-02-20 20:00:47,350 INFO L87 Difference]: Start difference. First operand has 1698 states, 1393 states have (on average 1.407035175879397) internal successors, (1960), 1417 states have internal predecessors, (1960), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) Second operand 1858 states. [2022-02-20 20:00:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,452 INFO L93 Difference]: Finished difference Result 1858 states and 2558 transitions. [2022-02-20 20:00:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2558 transitions. [2022-02-20 20:00:47,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:47,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:47,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:47,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1393 states have (on average 1.407035175879397) internal successors, (1960), 1417 states have internal predecessors, (1960), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-02-20 20:00:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2346 transitions. [2022-02-20 20:00:47,591 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2346 transitions. Word has length 65 [2022-02-20 20:00:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:47,591 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 2346 transitions. [2022-02-20 20:00:47,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2346 transitions. [2022-02-20 20:00:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:47,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:47,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:47,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:47,593 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash -515912993, now seen corresponding path program 1 times [2022-02-20 20:00:47,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:47,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759477456] [2022-02-20 20:00:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {18635#(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); {18595#true} is VALID [2022-02-20 20:00:47,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18595#true} {18595#true} #1638#return; {18595#true} is VALID [2022-02-20 20:00:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {18636#(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); {18595#true} is VALID [2022-02-20 20:00:47,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume !(0 == ~q_write_ev~0); {18595#true} is VALID [2022-02-20 20:00:47,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18595#true} {18595#true} #1640#return; {18595#true} is VALID [2022-02-20 20:00:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {18595#true} havoc ~__retres1~0; {18595#true} is VALID [2022-02-20 20:00:47,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume !(1 == ~p_dw_pc~0); {18595#true} is VALID [2022-02-20 20:00:47,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} assume !(2 == ~p_dw_pc~0); {18595#true} is VALID [2022-02-20 20:00:47,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {18595#true} ~__retres1~0 := 0; {18653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:47,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {18653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:47,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:47,714 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {18595#true} #1634#return; {18645#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {18595#true} havoc ~__retres1~1; {18595#true} is VALID [2022-02-20 20:00:47,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume 1 == ~c_dr_pc~0; {18595#true} is VALID [2022-02-20 20:00:47,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {18595#true} is VALID [2022-02-20 20:00:47,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {18595#true} #res := ~__retres1~1; {18595#true} is VALID [2022-02-20 20:00:47,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,723 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18595#true} {18596#false} #1636#return; {18596#false} is VALID [2022-02-20 20:00:47,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {18637#(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; {18595#true} is VALID [2022-02-20 20:00:47,723 INFO L272 TraceCheckUtils]: 1: Hoare triple {18595#true} call #t~ret8 := is_do_write_p_triggered(); {18595#true} is VALID [2022-02-20 20:00:47,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} havoc ~__retres1~0; {18595#true} is VALID [2022-02-20 20:00:47,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {18595#true} assume !(1 == ~p_dw_pc~0); {18595#true} is VALID [2022-02-20 20:00:47,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {18595#true} assume !(2 == ~p_dw_pc~0); {18595#true} is VALID [2022-02-20 20:00:47,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {18595#true} ~__retres1~0 := 0; {18653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:47,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {18653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:47,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:47,725 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {18595#true} #1634#return; {18645#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:47,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {18645#(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; {18646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:47,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {18646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {18596#false} is VALID [2022-02-20 20:00:47,726 INFO L272 TraceCheckUtils]: 11: Hoare triple {18596#false} call #t~ret9 := is_do_read_c_triggered(); {18595#true} is VALID [2022-02-20 20:00:47,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {18595#true} havoc ~__retres1~1; {18595#true} is VALID [2022-02-20 20:00:47,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {18595#true} assume 1 == ~c_dr_pc~0; {18595#true} is VALID [2022-02-20 20:00:47,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {18595#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {18595#true} is VALID [2022-02-20 20:00:47,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {18595#true} #res := ~__retres1~1; {18595#true} is VALID [2022-02-20 20:00:47,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,727 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18595#true} {18596#false} #1636#return; {18596#false} is VALID [2022-02-20 20:00:47,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {18596#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {18596#false} is VALID [2022-02-20 20:00:47,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {18596#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {18596#false} is VALID [2022-02-20 20:00:47,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {18596#false} assume true; {18596#false} is VALID [2022-02-20 20:00:47,727 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18596#false} {18595#true} #1642#return; {18596#false} is VALID [2022-02-20 20:00:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {18636#(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); {18595#true} is VALID [2022-02-20 20:00:47,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume !(1 == ~q_write_ev~0); {18595#true} is VALID [2022-02-20 20:00:47,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18595#true} {18596#false} #1644#return; {18596#false} is VALID [2022-02-20 20:00:47,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:47,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {18595#true} havoc ~__retres1~2; {18595#true} is VALID [2022-02-20 20:00:47,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {18595#true} is VALID [2022-02-20 20:00:47,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} #res := ~__retres1~2; {18595#true} is VALID [2022-02-20 20:00:47,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,738 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18595#true} {18596#false} #1646#return; {18596#false} is VALID [2022-02-20 20:00:47,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {18595#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {18595#true} is VALID [2022-02-20 20:00:47,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {18595#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {18595#true} is VALID [2022-02-20 20:00:47,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {18595#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {18595#true} is VALID [2022-02-20 20:00:47,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {18595#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {18595#true} is VALID [2022-02-20 20:00:47,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {18595#true} call update_channels1(); {18635#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:47,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {18635#(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); {18595#true} is VALID [2022-02-20 20:00:47,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,739 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18595#true} {18595#true} #1638#return; {18595#true} is VALID [2022-02-20 20:00:47,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {18595#true} assume { :begin_inline_init_threads1 } true; {18595#true} is VALID [2022-02-20 20:00:47,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {18595#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {18595#true} is VALID [2022-02-20 20:00:47,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {18595#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {18595#true} is VALID [2022-02-20 20:00:47,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {18595#true} assume { :end_inline_init_threads1 } true; {18595#true} is VALID [2022-02-20 20:00:47,740 INFO L272 TraceCheckUtils]: 12: Hoare triple {18595#true} call fire_delta_events1(); {18636#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:47,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {18636#(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); {18595#true} is VALID [2022-02-20 20:00:47,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {18595#true} assume !(0 == ~q_write_ev~0); {18595#true} is VALID [2022-02-20 20:00:47,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18595#true} {18595#true} #1640#return; {18595#true} is VALID [2022-02-20 20:00:47,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {18595#true} call activate_threads1(); {18637#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:47,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {18637#(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; {18595#true} is VALID [2022-02-20 20:00:47,741 INFO L272 TraceCheckUtils]: 19: Hoare triple {18595#true} call #t~ret8 := is_do_write_p_triggered(); {18595#true} is VALID [2022-02-20 20:00:47,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {18595#true} havoc ~__retres1~0; {18595#true} is VALID [2022-02-20 20:00:47,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {18595#true} assume !(1 == ~p_dw_pc~0); {18595#true} is VALID [2022-02-20 20:00:47,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {18595#true} assume !(2 == ~p_dw_pc~0); {18595#true} is VALID [2022-02-20 20:00:47,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {18595#true} ~__retres1~0 := 0; {18653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:47,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {18653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:47,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:47,743 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {18595#true} #1634#return; {18645#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:47,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {18645#(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; {18646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:47,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {18596#false} is VALID [2022-02-20 20:00:47,744 INFO L272 TraceCheckUtils]: 29: Hoare triple {18596#false} call #t~ret9 := is_do_read_c_triggered(); {18595#true} is VALID [2022-02-20 20:00:47,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {18595#true} havoc ~__retres1~1; {18595#true} is VALID [2022-02-20 20:00:47,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {18595#true} assume 1 == ~c_dr_pc~0; {18595#true} is VALID [2022-02-20 20:00:47,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {18595#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {18595#true} is VALID [2022-02-20 20:00:47,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {18595#true} #res := ~__retres1~1; {18595#true} is VALID [2022-02-20 20:00:47,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,745 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18595#true} {18596#false} #1636#return; {18596#false} is VALID [2022-02-20 20:00:47,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {18596#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {18596#false} is VALID [2022-02-20 20:00:47,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {18596#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {18596#false} is VALID [2022-02-20 20:00:47,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {18596#false} assume true; {18596#false} is VALID [2022-02-20 20:00:47,745 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18596#false} {18595#true} #1642#return; {18596#false} is VALID [2022-02-20 20:00:47,745 INFO L272 TraceCheckUtils]: 40: Hoare triple {18596#false} call reset_delta_events1(); {18636#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:47,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {18636#(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); {18595#true} is VALID [2022-02-20 20:00:47,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {18595#true} assume !(1 == ~q_write_ev~0); {18595#true} is VALID [2022-02-20 20:00:47,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,746 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18595#true} {18596#false} #1644#return; {18596#false} is VALID [2022-02-20 20:00:47,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {18596#false} assume !false; {18596#false} is VALID [2022-02-20 20:00:47,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {18596#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; {18596#false} is VALID [2022-02-20 20:00:47,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {18596#false} assume !false; {18596#false} is VALID [2022-02-20 20:00:47,746 INFO L272 TraceCheckUtils]: 48: Hoare triple {18596#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {18595#true} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {18595#true} havoc ~__retres1~2; {18595#true} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {18595#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {18595#true} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {18595#true} #res := ~__retres1~2; {18595#true} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {18595#true} assume true; {18595#true} is VALID [2022-02-20 20:00:47,747 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18595#true} {18596#false} #1646#return; {18596#false} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {18596#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; {18596#false} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {18596#false} assume 0 != eval1_~tmp___1~0#1; {18596#false} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {18596#false} assume !(0 == ~p_dw_st~0); {18596#false} is VALID [2022-02-20 20:00:47,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {18596#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; {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {18596#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; {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {18596#false} assume !(0 == ~c_dr_pc~0); {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {18596#false} assume 2 == ~c_dr_pc~0; {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {18596#false} do_read_c_~a~0#1 := ~a_t~0; {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {18596#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; {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 63: Hoare triple {18596#false} assume !(~p_last_write~0 == ~c_last_read~0); {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L272 TraceCheckUtils]: 64: Hoare triple {18596#false} call error1(); {18596#false} is VALID [2022-02-20 20:00:47,748 INFO L290 TraceCheckUtils]: 65: Hoare triple {18596#false} assume !false; {18596#false} is VALID [2022-02-20 20:00:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:47,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:47,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759477456] [2022-02-20 20:00:47,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759477456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:47,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:47,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:47,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062877397] [2022-02-20 20:00:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:47,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:47,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:47,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:47,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:47,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:47,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:47,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:47,790 INFO L87 Difference]: Start difference. First operand 1698 states and 2346 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:51,333 INFO L93 Difference]: Finished difference Result 3226 states and 4425 transitions. [2022-02-20 20:00:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 822 transitions. [2022-02-20 20:00:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 822 transitions. [2022-02-20 20:00:51,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 822 transitions. [2022-02-20 20:00:51,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:51,981 INFO L225 Difference]: With dead ends: 3226 [2022-02-20 20:00:51,982 INFO L226 Difference]: Without dead ends: 1846 [2022-02-20 20:00:51,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:00:51,984 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 549 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:51,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 2824 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-02-20 20:00:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1738. [2022-02-20 20:00:52,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:52,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1846 states. Second operand has 1738 states, 1425 states have (on average 1.3936842105263159) internal successors, (1986), 1449 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:52,056 INFO L74 IsIncluded]: Start isIncluded. First operand 1846 states. Second operand has 1738 states, 1425 states have (on average 1.3936842105263159) internal successors, (1986), 1449 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:52,058 INFO L87 Difference]: Start difference. First operand 1846 states. Second operand has 1738 states, 1425 states have (on average 1.3936842105263159) internal successors, (1986), 1449 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,153 INFO L93 Difference]: Finished difference Result 1846 states and 2534 transitions. [2022-02-20 20:00:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2534 transitions. [2022-02-20 20:00:52,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 1738 states, 1425 states have (on average 1.3936842105263159) internal successors, (1986), 1449 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) Second operand 1846 states. [2022-02-20 20:00:52,161 INFO L87 Difference]: Start difference. First operand has 1738 states, 1425 states have (on average 1.3936842105263159) internal successors, (1986), 1449 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) Second operand 1846 states. [2022-02-20 20:00:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,255 INFO L93 Difference]: Finished difference Result 1846 states and 2534 transitions. [2022-02-20 20:00:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2534 transitions. [2022-02-20 20:00:52,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:52,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1425 states have (on average 1.3936842105263159) internal successors, (1986), 1449 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-02-20 20:00:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2380 transitions. [2022-02-20 20:00:52,387 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2380 transitions. Word has length 66 [2022-02-20 20:00:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:52,387 INFO L470 AbstractCegarLoop]: Abstraction has 1738 states and 2380 transitions. [2022-02-20 20:00:52,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2380 transitions. [2022-02-20 20:00:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:52,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:52,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:52,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:52,389 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1545272291, now seen corresponding path program 1 times [2022-02-20 20:00:52,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:52,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367132587] [2022-02-20 20:00:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {29057#(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); {29058#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:52,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {29058#(not (= |old(~q_req_up~0)| 1))} assume true; {29058#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:52,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29058#(not (= |old(~q_req_up~0)| 1))} {29017#(= ~c_dr_pc~0 ~q_req_up~0)} #1638#return; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {29059#(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); {29014#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {29014#true} assume !(0 == ~q_write_ev~0); {29014#true} is VALID [2022-02-20 20:00:52,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29014#true} {29021#(not (= ~c_dr_pc~0 1))} #1640#return; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {29014#true} havoc ~__retres1~0; {29014#true} is VALID [2022-02-20 20:00:52,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {29014#true} assume !(1 == ~p_dw_pc~0); {29014#true} is VALID [2022-02-20 20:00:52,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {29014#true} assume !(2 == ~p_dw_pc~0); {29014#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {29014#true} ~__retres1~0 := 0; {29014#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {29014#true} #res := ~__retres1~0; {29014#true} is VALID [2022-02-20 20:00:52,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,472 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29014#true} {29014#true} #1634#return; {29014#true} is VALID [2022-02-20 20:00:52,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {29014#true} havoc ~__retres1~1; {29014#true} is VALID [2022-02-20 20:00:52,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {29014#true} assume 1 == ~c_dr_pc~0; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,479 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} {29014#true} #1636#return; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {29060#(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; {29014#true} is VALID [2022-02-20 20:00:52,479 INFO L272 TraceCheckUtils]: 1: Hoare triple {29014#true} call #t~ret8 := is_do_write_p_triggered(); {29014#true} is VALID [2022-02-20 20:00:52,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {29014#true} havoc ~__retres1~0; {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {29014#true} assume !(1 == ~p_dw_pc~0); {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {29014#true} assume !(2 == ~p_dw_pc~0); {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {29014#true} ~__retres1~0 := 0; {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {29014#true} #res := ~__retres1~0; {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29014#true} {29014#true} #1634#return; {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {29014#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29014#true} is VALID [2022-02-20 20:00:52,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {29014#true} assume !(0 != ~tmp~1); {29014#true} is VALID [2022-02-20 20:00:52,481 INFO L272 TraceCheckUtils]: 11: Hoare triple {29014#true} call #t~ret9 := is_do_read_c_triggered(); {29014#true} is VALID [2022-02-20 20:00:52,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {29014#true} havoc ~__retres1~1; {29014#true} is VALID [2022-02-20 20:00:52,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {29014#true} assume 1 == ~c_dr_pc~0; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,482 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} {29014#true} #1636#return; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,483 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} {29021#(not (= ~c_dr_pc~0 1))} #1642#return; {29015#false} is VALID [2022-02-20 20:00:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {29059#(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); {29014#true} is VALID [2022-02-20 20:00:52,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {29014#true} assume !(1 == ~q_write_ev~0); {29014#true} is VALID [2022-02-20 20:00:52,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29014#true} {29015#false} #1644#return; {29015#false} is VALID [2022-02-20 20:00:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:52,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {29014#true} havoc ~__retres1~2; {29014#true} is VALID [2022-02-20 20:00:52,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {29014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29014#true} is VALID [2022-02-20 20:00:52,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {29014#true} #res := ~__retres1~2; {29014#true} is VALID [2022-02-20 20:00:52,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,491 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29014#true} {29015#false} #1646#return; {29015#false} is VALID [2022-02-20 20:00:52,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {29014#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {29016#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:52,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {29016#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {29016#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:52,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {29016#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {29017#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:52,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {29017#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {29017#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:52,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {29017#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {29057#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:52,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {29057#(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); {29058#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:52,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {29058#(not (= |old(~q_req_up~0)| 1))} assume true; {29058#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:52,493 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29058#(not (= |old(~q_req_up~0)| 1))} {29017#(= ~c_dr_pc~0 ~q_req_up~0)} #1638#return; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {29021#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {29021#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {29021#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {29021#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,495 INFO L272 TraceCheckUtils]: 12: Hoare triple {29021#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {29059#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:52,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {29059#(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); {29014#true} is VALID [2022-02-20 20:00:52,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {29014#true} assume !(0 == ~q_write_ev~0); {29014#true} is VALID [2022-02-20 20:00:52,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,495 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29014#true} {29021#(not (= ~c_dr_pc~0 1))} #1640#return; {29021#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:52,496 INFO L272 TraceCheckUtils]: 17: Hoare triple {29021#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {29060#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:52,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {29060#(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; {29014#true} is VALID [2022-02-20 20:00:52,496 INFO L272 TraceCheckUtils]: 19: Hoare triple {29014#true} call #t~ret8 := is_do_write_p_triggered(); {29014#true} is VALID [2022-02-20 20:00:52,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {29014#true} havoc ~__retres1~0; {29014#true} is VALID [2022-02-20 20:00:52,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {29014#true} assume !(1 == ~p_dw_pc~0); {29014#true} is VALID [2022-02-20 20:00:52,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {29014#true} assume !(2 == ~p_dw_pc~0); {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {29014#true} ~__retres1~0 := 0; {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {29014#true} #res := ~__retres1~0; {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29014#true} {29014#true} #1634#return; {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {29014#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {29014#true} assume !(0 != ~tmp~1); {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L272 TraceCheckUtils]: 29: Hoare triple {29014#true} call #t~ret9 := is_do_read_c_triggered(); {29014#true} is VALID [2022-02-20 20:00:52,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {29014#true} havoc ~__retres1~1; {29014#true} is VALID [2022-02-20 20:00:52,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {29014#true} assume 1 == ~c_dr_pc~0; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,500 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} {29014#true} #1636#return; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:52,501 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29074#(= (+ (- 1) ~c_dr_pc~0) 0)} {29021#(not (= ~c_dr_pc~0 1))} #1642#return; {29015#false} is VALID [2022-02-20 20:00:52,501 INFO L272 TraceCheckUtils]: 40: Hoare triple {29015#false} call reset_delta_events1(); {29059#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:52,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {29059#(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); {29014#true} is VALID [2022-02-20 20:00:52,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {29014#true} assume !(1 == ~q_write_ev~0); {29014#true} is VALID [2022-02-20 20:00:52,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,501 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {29014#true} {29015#false} #1644#return; {29015#false} is VALID [2022-02-20 20:00:52,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {29015#false} assume !false; {29015#false} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {29015#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; {29015#false} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {29015#false} assume !false; {29015#false} is VALID [2022-02-20 20:00:52,502 INFO L272 TraceCheckUtils]: 48: Hoare triple {29015#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29014#true} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {29014#true} havoc ~__retres1~2; {29014#true} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {29014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29014#true} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {29014#true} #res := ~__retres1~2; {29014#true} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {29014#true} assume true; {29014#true} is VALID [2022-02-20 20:00:52,502 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29014#true} {29015#false} #1646#return; {29015#false} is VALID [2022-02-20 20:00:52,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {29015#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; {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {29015#false} assume 0 != eval1_~tmp___1~0#1; {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {29015#false} assume !(0 == ~p_dw_st~0); {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {29015#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; {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {29015#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; {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {29015#false} assume !(0 == ~c_dr_pc~0); {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {29015#false} assume 2 == ~c_dr_pc~0; {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {29015#false} do_read_c_~a~0#1 := ~a_t~0; {29015#false} is VALID [2022-02-20 20:00:52,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {29015#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; {29015#false} is VALID [2022-02-20 20:00:52,504 INFO L290 TraceCheckUtils]: 63: Hoare triple {29015#false} assume !(~p_last_write~0 == ~c_last_read~0); {29015#false} is VALID [2022-02-20 20:00:52,504 INFO L272 TraceCheckUtils]: 64: Hoare triple {29015#false} call error1(); {29015#false} is VALID [2022-02-20 20:00:52,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {29015#false} assume !false; {29015#false} is VALID [2022-02-20 20:00:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:52,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:52,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367132587] [2022-02-20 20:00:52,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367132587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:52,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:52,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:52,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235222730] [2022-02-20 20:00:52,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:00:52,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:52,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:52,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:52,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:52,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:52,540 INFO L87 Difference]: Start difference. First operand 1738 states and 2380 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,978 INFO L93 Difference]: Finished difference Result 5310 states and 7254 transitions. [2022-02-20 20:00:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:00:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1435 transitions. [2022-02-20 20:00:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1435 transitions. [2022-02-20 20:00:58,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1435 transitions. [2022-02-20 20:00:59,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1435 edges. 1435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:00,119 INFO L225 Difference]: With dead ends: 5310 [2022-02-20 20:01:00,119 INFO L226 Difference]: Without dead ends: 2129 [2022-02-20 20:01:00,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:00,124 INFO L933 BasicCegarLoop]: 761 mSDtfsCounter, 3904 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3926 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:00,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3926 Valid, 2524 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 20:01:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2022-02-20 20:01:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1949. [2022-02-20 20:01:00,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:00,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2129 states. Second operand has 1949 states, 1564 states have (on average 1.350383631713555) internal successors, (2112), 1590 states have internal predecessors, (2112), 217 states have call successors, (217), 140 states have call predecessors, (217), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:00,205 INFO L74 IsIncluded]: Start isIncluded. First operand 2129 states. Second operand has 1949 states, 1564 states have (on average 1.350383631713555) internal successors, (2112), 1590 states have internal predecessors, (2112), 217 states have call successors, (217), 140 states have call predecessors, (217), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:00,207 INFO L87 Difference]: Start difference. First operand 2129 states. Second operand has 1949 states, 1564 states have (on average 1.350383631713555) internal successors, (2112), 1590 states have internal predecessors, (2112), 217 states have call successors, (217), 140 states have call predecessors, (217), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:00,333 INFO L93 Difference]: Finished difference Result 2129 states and 2823 transitions. [2022-02-20 20:01:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2823 transitions. [2022-02-20 20:01:00,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:00,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:00,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 1949 states, 1564 states have (on average 1.350383631713555) internal successors, (2112), 1590 states have internal predecessors, (2112), 217 states have call successors, (217), 140 states have call predecessors, (217), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) Second operand 2129 states. [2022-02-20 20:01:00,342 INFO L87 Difference]: Start difference. First operand has 1949 states, 1564 states have (on average 1.350383631713555) internal successors, (2112), 1590 states have internal predecessors, (2112), 217 states have call successors, (217), 140 states have call predecessors, (217), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) Second operand 2129 states. [2022-02-20 20:01:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:00,463 INFO L93 Difference]: Finished difference Result 2129 states and 2823 transitions. [2022-02-20 20:01:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2823 transitions. [2022-02-20 20:01:00,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:00,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:00,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:00,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1564 states have (on average 1.350383631713555) internal successors, (2112), 1590 states have internal predecessors, (2112), 217 states have call successors, (217), 140 states have call predecessors, (217), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-02-20 20:01:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2592 transitions. [2022-02-20 20:01:00,615 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2592 transitions. Word has length 66 [2022-02-20 20:01:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:00,615 INFO L470 AbstractCegarLoop]: Abstraction has 1949 states and 2592 transitions. [2022-02-20 20:01:00,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2592 transitions. [2022-02-20 20:01:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:00,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:00,617 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:00,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:00,617 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 428939397, now seen corresponding path program 1 times [2022-02-20 20:01:00,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:00,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599181115] [2022-02-20 20:01:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {43204#(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); {43158#true} is VALID [2022-02-20 20:01:00,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43158#true} {43158#true} #1638#return; {43158#true} is VALID [2022-02-20 20:01:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {43205#(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); {43158#true} is VALID [2022-02-20 20:01:00,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume !(0 == ~q_write_ev~0); {43158#true} is VALID [2022-02-20 20:01:00,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43158#true} {43158#true} #1640#return; {43158#true} is VALID [2022-02-20 20:01:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {43158#true} havoc ~__retres1~0; {43158#true} is VALID [2022-02-20 20:01:00,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume !(1 == ~p_dw_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} assume !(2 == ~p_dw_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {43158#true} ~__retres1~0 := 0; {43158#true} is VALID [2022-02-20 20:01:00,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {43158#true} #res := ~__retres1~0; {43158#true} is VALID [2022-02-20 20:01:00,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,688 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {43158#true} {43158#true} #1634#return; {43158#true} is VALID [2022-02-20 20:01:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {43158#true} havoc ~__retres1~1; {43158#true} is VALID [2022-02-20 20:01:00,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume !(1 == ~c_dr_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} assume !(2 == ~c_dr_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {43158#true} ~__retres1~1 := 0; {43223#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:00,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {43223#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:00,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:00,733 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {43158#true} #1636#return; {43221#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:00,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {43206#(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; {43158#true} is VALID [2022-02-20 20:01:00,733 INFO L272 TraceCheckUtils]: 1: Hoare triple {43158#true} call #t~ret8 := is_do_write_p_triggered(); {43158#true} is VALID [2022-02-20 20:01:00,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} havoc ~__retres1~0; {43158#true} is VALID [2022-02-20 20:01:00,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {43158#true} assume !(1 == ~p_dw_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {43158#true} assume !(2 == ~p_dw_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {43158#true} ~__retres1~0 := 0; {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {43158#true} #res := ~__retres1~0; {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {43158#true} {43158#true} #1634#return; {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {43158#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {43158#true} assume !(0 != ~tmp~1); {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {43158#true} call #t~ret9 := is_do_read_c_triggered(); {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {43158#true} havoc ~__retres1~1; {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {43158#true} assume !(1 == ~c_dr_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {43158#true} assume !(2 == ~c_dr_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {43158#true} ~__retres1~1 := 0; {43223#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:00,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {43223#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:00,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:00,736 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {43158#true} #1636#return; {43221#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:00,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {43221#(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; {43222#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:00,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {43222#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {43159#false} is VALID [2022-02-20 20:01:00,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {43159#false} assume true; {43159#false} is VALID [2022-02-20 20:01:00,737 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {43159#false} {43158#true} #1642#return; {43159#false} is VALID [2022-02-20 20:01:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {43205#(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); {43158#true} is VALID [2022-02-20 20:01:00,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume !(1 == ~q_write_ev~0); {43158#true} is VALID [2022-02-20 20:01:00,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43158#true} {43159#false} #1644#return; {43159#false} is VALID [2022-02-20 20:01:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {43158#true} havoc ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43158#true} is VALID [2022-02-20 20:01:00,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} #res := ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,746 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43158#true} {43159#false} #1646#return; {43159#false} is VALID [2022-02-20 20:01:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:00,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {43158#true} havoc ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43158#true} is VALID [2022-02-20 20:01:00,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} #res := ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,751 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43158#true} {43159#false} #1646#return; {43159#false} is VALID [2022-02-20 20:01:00,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {43158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {43158#true} is VALID [2022-02-20 20:01:00,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {43158#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {43158#true} is VALID [2022-02-20 20:01:00,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {43158#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {43158#true} is VALID [2022-02-20 20:01:00,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {43158#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {43158#true} is VALID [2022-02-20 20:01:00,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {43158#true} call update_channels1(); {43204#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:00,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {43204#(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); {43158#true} is VALID [2022-02-20 20:01:00,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,752 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {43158#true} {43158#true} #1638#return; {43158#true} is VALID [2022-02-20 20:01:00,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {43158#true} assume { :begin_inline_init_threads1 } true; {43158#true} is VALID [2022-02-20 20:01:00,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {43158#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {43158#true} is VALID [2022-02-20 20:01:00,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {43158#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {43158#true} is VALID [2022-02-20 20:01:00,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {43158#true} assume { :end_inline_init_threads1 } true; {43158#true} is VALID [2022-02-20 20:01:00,754 INFO L272 TraceCheckUtils]: 12: Hoare triple {43158#true} call fire_delta_events1(); {43205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:00,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {43205#(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); {43158#true} is VALID [2022-02-20 20:01:00,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {43158#true} assume !(0 == ~q_write_ev~0); {43158#true} is VALID [2022-02-20 20:01:00,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,755 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43158#true} {43158#true} #1640#return; {43158#true} is VALID [2022-02-20 20:01:00,755 INFO L272 TraceCheckUtils]: 17: Hoare triple {43158#true} call activate_threads1(); {43206#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:00,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {43206#(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; {43158#true} is VALID [2022-02-20 20:01:00,755 INFO L272 TraceCheckUtils]: 19: Hoare triple {43158#true} call #t~ret8 := is_do_write_p_triggered(); {43158#true} is VALID [2022-02-20 20:01:00,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {43158#true} havoc ~__retres1~0; {43158#true} is VALID [2022-02-20 20:01:00,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {43158#true} assume !(1 == ~p_dw_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {43158#true} assume !(2 == ~p_dw_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {43158#true} ~__retres1~0 := 0; {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {43158#true} #res := ~__retres1~0; {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43158#true} {43158#true} #1634#return; {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {43158#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {43158#true} assume !(0 != ~tmp~1); {43158#true} is VALID [2022-02-20 20:01:00,756 INFO L272 TraceCheckUtils]: 29: Hoare triple {43158#true} call #t~ret9 := is_do_read_c_triggered(); {43158#true} is VALID [2022-02-20 20:01:00,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {43158#true} havoc ~__retres1~1; {43158#true} is VALID [2022-02-20 20:01:00,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {43158#true} assume !(1 == ~c_dr_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {43158#true} assume !(2 == ~c_dr_pc~0); {43158#true} is VALID [2022-02-20 20:01:00,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {43158#true} ~__retres1~1 := 0; {43223#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:00,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {43223#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:00,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:00,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {43224#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {43158#true} #1636#return; {43221#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:00,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {43221#(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; {43222#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:00,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {43222#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {43159#false} is VALID [2022-02-20 20:01:00,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {43159#false} assume true; {43159#false} is VALID [2022-02-20 20:01:00,759 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {43159#false} {43158#true} #1642#return; {43159#false} is VALID [2022-02-20 20:01:00,759 INFO L272 TraceCheckUtils]: 41: Hoare triple {43159#false} call reset_delta_events1(); {43205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:00,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {43205#(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); {43158#true} is VALID [2022-02-20 20:01:00,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {43158#true} assume !(1 == ~q_write_ev~0); {43158#true} is VALID [2022-02-20 20:01:00,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,760 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {43158#true} {43159#false} #1644#return; {43159#false} is VALID [2022-02-20 20:01:00,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {43159#false} assume !false; {43159#false} is VALID [2022-02-20 20:01:00,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,760 INFO L290 TraceCheckUtils]: 48: Hoare triple {43159#false} assume !false; {43159#false} is VALID [2022-02-20 20:01:00,760 INFO L272 TraceCheckUtils]: 49: Hoare triple {43159#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {43158#true} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {43158#true} havoc ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {43158#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43158#true} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {43158#true} #res := ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,761 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {43158#true} {43159#false} #1646#return; {43159#false} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {43159#false} assume 0 != eval1_~tmp___1~0#1; {43159#false} is VALID [2022-02-20 20:01:00,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {43159#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {43159#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 59: Hoare triple {43159#false} assume 0 == ~p_dw_pc~0; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {43159#false} assume !false; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {43159#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {43159#false} assume { :end_inline_do_write_p } true; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {43159#false} assume !(0 == ~c_dr_st~0); {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {43159#false} assume !false; {43159#false} is VALID [2022-02-20 20:01:00,762 INFO L272 TraceCheckUtils]: 65: Hoare triple {43159#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {43158#true} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {43158#true} havoc ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {43158#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43158#true} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {43158#true} #res := ~__retres1~2; {43158#true} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {43158#true} assume true; {43158#true} is VALID [2022-02-20 20:01:00,763 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {43158#true} {43159#false} #1646#return; {43159#false} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {43159#false} assume 0 != eval1_~tmp___1~0#1; {43159#false} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 73: Hoare triple {43159#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {43159#false} is VALID [2022-02-20 20:01:00,763 INFO L290 TraceCheckUtils]: 74: Hoare triple {43159#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {43159#false} assume !(0 == ~p_dw_pc~0); {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 76: Hoare triple {43159#false} assume 1 == ~p_dw_pc~0; {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 77: Hoare triple {43159#false} assume !(0 == ~q_free~0); {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 78: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 79: Hoare triple {43159#false} assume !false; {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {43159#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {43159#false} assume { :end_inline_do_write_p } true; {43159#false} is VALID [2022-02-20 20:01:00,764 INFO L290 TraceCheckUtils]: 82: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 83: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 84: Hoare triple {43159#false} assume !(0 == ~c_dr_pc~0); {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {43159#false} assume 2 == ~c_dr_pc~0; {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {43159#false} do_read_c_~a~0#1 := ~a_t~0; {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 87: Hoare triple {43159#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; {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 88: Hoare triple {43159#false} assume !(~p_last_write~0 == ~c_last_read~0); {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L272 TraceCheckUtils]: 89: Hoare triple {43159#false} call error1(); {43159#false} is VALID [2022-02-20 20:01:00,765 INFO L290 TraceCheckUtils]: 90: Hoare triple {43159#false} assume !false; {43159#false} is VALID [2022-02-20 20:01:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:00,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:00,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599181115] [2022-02-20 20:01:00,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599181115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:00,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:00,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:00,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009813595] [2022-02-20 20:01:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:00,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:00,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:00,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:00,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:00,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:00,805 INFO L87 Difference]: Start difference. First operand 1949 states and 2592 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:04,290 INFO L93 Difference]: Finished difference Result 3774 states and 4994 transitions. [2022-02-20 20:01:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:04,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 807 transitions. [2022-02-20 20:01:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 807 transitions. [2022-02-20 20:01:04,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 807 transitions. [2022-02-20 20:01:04,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 807 edges. 807 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:04,985 INFO L225 Difference]: With dead ends: 3774 [2022-02-20 20:01:04,985 INFO L226 Difference]: Without dead ends: 2143 [2022-02-20 20:01:04,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:01:04,988 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 810 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:04,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [812 Valid, 2487 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:01:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2022-02-20 20:01:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2009. [2022-02-20 20:01:05,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:05,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2143 states. Second operand has 2009 states, 1612 states have (on average 1.336228287841191) internal successors, (2154), 1638 states have internal predecessors, (2154), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:05,090 INFO L74 IsIncluded]: Start isIncluded. First operand 2143 states. Second operand has 2009 states, 1612 states have (on average 1.336228287841191) internal successors, (2154), 1638 states have internal predecessors, (2154), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:05,093 INFO L87 Difference]: Start difference. First operand 2143 states. Second operand has 2009 states, 1612 states have (on average 1.336228287841191) internal successors, (2154), 1638 states have internal predecessors, (2154), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:05,217 INFO L93 Difference]: Finished difference Result 2143 states and 2835 transitions. [2022-02-20 20:01:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2835 transitions. [2022-02-20 20:01:05,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:05,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:05,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 2009 states, 1612 states have (on average 1.336228287841191) internal successors, (2154), 1638 states have internal predecessors, (2154), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) Second operand 2143 states. [2022-02-20 20:01:05,227 INFO L87 Difference]: Start difference. First operand has 2009 states, 1612 states have (on average 1.336228287841191) internal successors, (2154), 1638 states have internal predecessors, (2154), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) Second operand 2143 states. [2022-02-20 20:01:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:05,350 INFO L93 Difference]: Finished difference Result 2143 states and 2835 transitions. [2022-02-20 20:01:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2835 transitions. [2022-02-20 20:01:05,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:05,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:05,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:05,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1612 states have (on average 1.336228287841191) internal successors, (2154), 1638 states have internal predecessors, (2154), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2646 transitions. [2022-02-20 20:01:05,525 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2646 transitions. Word has length 91 [2022-02-20 20:01:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:05,526 INFO L470 AbstractCegarLoop]: Abstraction has 2009 states and 2646 transitions. [2022-02-20 20:01:05,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2646 transitions. [2022-02-20 20:01:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:05,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:05,527 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:05,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:05,528 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 872840071, now seen corresponding path program 1 times [2022-02-20 20:01:05,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:05,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204991497] [2022-02-20 20:01:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {55317#(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); {55270#true} is VALID [2022-02-20 20:01:05,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55270#true} {55270#true} #1638#return; {55270#true} is VALID [2022-02-20 20:01:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {55318#(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); {55270#true} is VALID [2022-02-20 20:01:05,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume !(0 == ~q_write_ev~0); {55270#true} is VALID [2022-02-20 20:01:05,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55270#true} {55275#(= ~c_dr_st~0 0)} #1640#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {55270#true} havoc ~__retres1~0; {55270#true} is VALID [2022-02-20 20:01:05,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume !(1 == ~p_dw_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} assume !(2 == ~p_dw_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {55270#true} ~__retres1~0 := 0; {55270#true} is VALID [2022-02-20 20:01:05,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {55270#true} #res := ~__retres1~0; {55270#true} is VALID [2022-02-20 20:01:05,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,601 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55270#true} {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1634#return; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {55270#true} havoc ~__retres1~1; {55270#true} is VALID [2022-02-20 20:01:05,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume !(1 == ~c_dr_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} assume !(2 == ~c_dr_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {55270#true} ~__retres1~1 := 0; {55270#true} is VALID [2022-02-20 20:01:05,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {55270#true} #res := ~__retres1~1; {55270#true} is VALID [2022-02-20 20:01:05,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,605 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55270#true} {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1636#return; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {55319#(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; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,605 INFO L272 TraceCheckUtils]: 1: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {55270#true} is VALID [2022-02-20 20:01:05,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} havoc ~__retres1~0; {55270#true} is VALID [2022-02-20 20:01:05,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {55270#true} assume !(1 == ~p_dw_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {55270#true} assume !(2 == ~p_dw_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {55270#true} ~__retres1~0 := 0; {55270#true} is VALID [2022-02-20 20:01:05,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {55270#true} #res := ~__retres1~0; {55270#true} is VALID [2022-02-20 20:01:05,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,606 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {55270#true} {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1634#return; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {55270#true} is VALID [2022-02-20 20:01:05,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {55270#true} havoc ~__retres1~1; {55270#true} is VALID [2022-02-20 20:01:05,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {55270#true} assume !(1 == ~c_dr_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {55270#true} assume !(2 == ~c_dr_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {55270#true} ~__retres1~1 := 0; {55270#true} is VALID [2022-02-20 20:01:05,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {55270#true} #res := ~__retres1~1; {55270#true} is VALID [2022-02-20 20:01:05,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,608 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {55270#true} {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1636#return; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,609 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {55275#(= ~c_dr_st~0 0)} #1642#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {55318#(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); {55270#true} is VALID [2022-02-20 20:01:05,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume !(1 == ~q_write_ev~0); {55270#true} is VALID [2022-02-20 20:01:05,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55270#true} {55275#(= ~c_dr_st~0 0)} #1644#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {55270#true} havoc ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55270#true} is VALID [2022-02-20 20:01:05,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} #res := ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,618 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55270#true} {55275#(= ~c_dr_st~0 0)} #1646#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {55270#true} havoc ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55270#true} is VALID [2022-02-20 20:01:05,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} #res := ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,622 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55270#true} {55271#false} #1646#return; {55271#false} is VALID [2022-02-20 20:01:05,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {55270#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {55270#true} is VALID [2022-02-20 20:01:05,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {55270#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {55270#true} is VALID [2022-02-20 20:01:05,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {55270#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {55270#true} is VALID [2022-02-20 20:01:05,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {55270#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {55270#true} is VALID [2022-02-20 20:01:05,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {55270#true} call update_channels1(); {55317#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:05,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {55317#(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); {55270#true} is VALID [2022-02-20 20:01:05,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,623 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {55270#true} {55270#true} #1638#return; {55270#true} is VALID [2022-02-20 20:01:05,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {55270#true} assume { :begin_inline_init_threads1 } true; {55270#true} is VALID [2022-02-20 20:01:05,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {55270#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {55270#true} is VALID [2022-02-20 20:01:05,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {55270#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {55275#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,624 INFO L272 TraceCheckUtils]: 12: Hoare triple {55275#(= ~c_dr_st~0 0)} call fire_delta_events1(); {55318#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:05,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {55318#(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); {55270#true} is VALID [2022-02-20 20:01:05,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {55270#true} assume !(0 == ~q_write_ev~0); {55270#true} is VALID [2022-02-20 20:01:05,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,625 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {55270#true} {55275#(= ~c_dr_st~0 0)} #1640#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,626 INFO L272 TraceCheckUtils]: 17: Hoare triple {55275#(= ~c_dr_st~0 0)} call activate_threads1(); {55319#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:05,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {55319#(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; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {55270#true} is VALID [2022-02-20 20:01:05,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {55270#true} havoc ~__retres1~0; {55270#true} is VALID [2022-02-20 20:01:05,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {55270#true} assume !(1 == ~p_dw_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {55270#true} assume !(2 == ~p_dw_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {55270#true} ~__retres1~0 := 0; {55270#true} is VALID [2022-02-20 20:01:05,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {55270#true} #res := ~__retres1~0; {55270#true} is VALID [2022-02-20 20:01:05,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,627 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {55270#true} {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1634#return; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,628 INFO L272 TraceCheckUtils]: 29: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {55270#true} is VALID [2022-02-20 20:01:05,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {55270#true} havoc ~__retres1~1; {55270#true} is VALID [2022-02-20 20:01:05,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {55270#true} assume !(1 == ~c_dr_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {55270#true} assume !(2 == ~c_dr_pc~0); {55270#true} is VALID [2022-02-20 20:01:05,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {55270#true} ~__retres1~1 := 0; {55270#true} is VALID [2022-02-20 20:01:05,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {55270#true} #res := ~__retres1~1; {55270#true} is VALID [2022-02-20 20:01:05,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,629 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {55270#true} {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1636#return; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:05,630 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {55320#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {55275#(= ~c_dr_st~0 0)} #1642#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,631 INFO L272 TraceCheckUtils]: 41: Hoare triple {55275#(= ~c_dr_st~0 0)} call reset_delta_events1(); {55318#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:05,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {55318#(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); {55270#true} is VALID [2022-02-20 20:01:05,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {55270#true} assume !(1 == ~q_write_ev~0); {55270#true} is VALID [2022-02-20 20:01:05,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,631 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {55270#true} {55275#(= ~c_dr_st~0 0)} #1644#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {55275#(= ~c_dr_st~0 0)} assume !false; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {55275#(= ~c_dr_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {55275#(= ~c_dr_st~0 0)} assume !false; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,632 INFO L272 TraceCheckUtils]: 49: Hoare triple {55275#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {55270#true} is VALID [2022-02-20 20:01:05,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {55270#true} havoc ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {55270#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55270#true} is VALID [2022-02-20 20:01:05,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {55270#true} #res := ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,633 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {55270#true} {55275#(= ~c_dr_st~0 0)} #1646#return; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {55275#(= ~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; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {55275#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {55275#(= ~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; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {55275#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {55275#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {55275#(= ~c_dr_st~0 0)} assume !false; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {55275#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {55275#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {55275#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:05,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {55275#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {55271#false} is VALID [2022-02-20 20:01:05,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {55271#false} assume !false; {55271#false} is VALID [2022-02-20 20:01:05,636 INFO L272 TraceCheckUtils]: 65: Hoare triple {55271#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {55270#true} is VALID [2022-02-20 20:01:05,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {55270#true} havoc ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {55270#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55270#true} is VALID [2022-02-20 20:01:05,636 INFO L290 TraceCheckUtils]: 68: Hoare triple {55270#true} #res := ~__retres1~2; {55270#true} is VALID [2022-02-20 20:01:05,636 INFO L290 TraceCheckUtils]: 69: Hoare triple {55270#true} assume true; {55270#true} is VALID [2022-02-20 20:01:05,636 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {55270#true} {55271#false} #1646#return; {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 71: Hoare triple {55271#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; {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 72: Hoare triple {55271#false} assume 0 != eval1_~tmp___1~0#1; {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 73: Hoare triple {55271#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 74: Hoare triple {55271#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {55271#false} assume !(0 == ~p_dw_pc~0); {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {55271#false} assume 1 == ~p_dw_pc~0; {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {55271#false} assume !(0 == ~q_free~0); {55271#false} is VALID [2022-02-20 20:01:05,637 INFO L290 TraceCheckUtils]: 78: Hoare triple {55271#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; {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {55271#false} assume !false; {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {55271#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {55271#false} assume { :end_inline_do_write_p } true; {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {55271#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; {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {55271#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; {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {55271#false} assume !(0 == ~c_dr_pc~0); {55271#false} is VALID [2022-02-20 20:01:05,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {55271#false} assume 2 == ~c_dr_pc~0; {55271#false} is VALID [2022-02-20 20:01:05,639 INFO L290 TraceCheckUtils]: 86: Hoare triple {55271#false} do_read_c_~a~0#1 := ~a_t~0; {55271#false} is VALID [2022-02-20 20:01:05,639 INFO L290 TraceCheckUtils]: 87: Hoare triple {55271#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; {55271#false} is VALID [2022-02-20 20:01:05,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {55271#false} assume !(~p_last_write~0 == ~c_last_read~0); {55271#false} is VALID [2022-02-20 20:01:05,639 INFO L272 TraceCheckUtils]: 89: Hoare triple {55271#false} call error1(); {55271#false} is VALID [2022-02-20 20:01:05,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {55271#false} assume !false; {55271#false} is VALID [2022-02-20 20:01:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:01:05,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:05,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204991497] [2022-02-20 20:01:05,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204991497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:05,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:05,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:05,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917432062] [2022-02-20 20:01:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:05,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:05,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:05,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:05,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:05,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:05,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:05,696 INFO L87 Difference]: Start difference. First operand 2009 states and 2646 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:08,797 INFO L93 Difference]: Finished difference Result 5606 states and 7354 transitions. [2022-02-20 20:01:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2022-02-20 20:01:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2022-02-20 20:01:08,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 950 transitions. [2022-02-20 20:01:09,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:10,040 INFO L225 Difference]: With dead ends: 5606 [2022-02-20 20:01:10,040 INFO L226 Difference]: Without dead ends: 3916 [2022-02-20 20:01:10,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:01:10,043 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 1464 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:10,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 1556 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:01:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-02-20 20:01:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3696. [2022-02-20 20:01:10,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:10,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3916 states. Second operand has 3696 states, 2926 states have (on average 1.2956254272043746) internal successors, (3791), 2986 states have internal predecessors, (3791), 406 states have call successors, (406), 272 states have call predecessors, (406), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) [2022-02-20 20:01:10,230 INFO L74 IsIncluded]: Start isIncluded. First operand 3916 states. Second operand has 3696 states, 2926 states have (on average 1.2956254272043746) internal successors, (3791), 2986 states have internal predecessors, (3791), 406 states have call successors, (406), 272 states have call predecessors, (406), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) [2022-02-20 20:01:10,245 INFO L87 Difference]: Start difference. First operand 3916 states. Second operand has 3696 states, 2926 states have (on average 1.2956254272043746) internal successors, (3791), 2986 states have internal predecessors, (3791), 406 states have call successors, (406), 272 states have call predecessors, (406), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) [2022-02-20 20:01:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:10,686 INFO L93 Difference]: Finished difference Result 3916 states and 5110 transitions. [2022-02-20 20:01:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 5110 transitions. [2022-02-20 20:01:10,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:10,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:10,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 3696 states, 2926 states have (on average 1.2956254272043746) internal successors, (3791), 2986 states have internal predecessors, (3791), 406 states have call successors, (406), 272 states have call predecessors, (406), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) Second operand 3916 states. [2022-02-20 20:01:10,702 INFO L87 Difference]: Start difference. First operand has 3696 states, 2926 states have (on average 1.2956254272043746) internal successors, (3791), 2986 states have internal predecessors, (3791), 406 states have call successors, (406), 272 states have call predecessors, (406), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) Second operand 3916 states. [2022-02-20 20:01:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:11,123 INFO L93 Difference]: Finished difference Result 3916 states and 5110 transitions. [2022-02-20 20:01:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 5110 transitions. [2022-02-20 20:01:11,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:11,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:11,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:11,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2926 states have (on average 1.2956254272043746) internal successors, (3791), 2986 states have internal predecessors, (3791), 406 states have call successors, (406), 272 states have call predecessors, (406), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) [2022-02-20 20:01:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4804 transitions. [2022-02-20 20:01:11,710 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4804 transitions. Word has length 91 [2022-02-20 20:01:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:11,710 INFO L470 AbstractCegarLoop]: Abstraction has 3696 states and 4804 transitions. [2022-02-20 20:01:11,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4804 transitions. [2022-02-20 20:01:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:11,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:11,713 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:11,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:11,713 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -184998007, now seen corresponding path program 1 times [2022-02-20 20:01:11,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:11,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175291514] [2022-02-20 20:01:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {75692#(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); {75645#true} is VALID [2022-02-20 20:01:11,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75645#true} {75647#(= 1 ~c_dr_i~0)} #1638#return; {75647#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {75693#(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); {75645#true} is VALID [2022-02-20 20:01:11,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume !(0 == ~q_write_ev~0); {75645#true} is VALID [2022-02-20 20:01:11,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75645#true} {75646#false} #1640#return; {75646#false} is VALID [2022-02-20 20:01:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {75645#true} havoc ~__retres1~0; {75645#true} is VALID [2022-02-20 20:01:11,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume !(1 == ~p_dw_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} assume !(2 == ~p_dw_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {75645#true} ~__retres1~0 := 0; {75645#true} is VALID [2022-02-20 20:01:11,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {75645#true} #res := ~__retres1~0; {75645#true} is VALID [2022-02-20 20:01:11,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,765 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75645#true} {75645#true} #1634#return; {75645#true} is VALID [2022-02-20 20:01:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {75645#true} havoc ~__retres1~1; {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume !(1 == ~c_dr_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} assume !(2 == ~c_dr_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {75645#true} ~__retres1~1 := 0; {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {75645#true} #res := ~__retres1~1; {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75645#true} {75645#true} #1636#return; {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {75694#(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; {75645#true} is VALID [2022-02-20 20:01:11,769 INFO L272 TraceCheckUtils]: 1: Hoare triple {75645#true} call #t~ret8 := is_do_write_p_triggered(); {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} havoc ~__retres1~0; {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {75645#true} assume !(1 == ~p_dw_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {75645#true} assume !(2 == ~p_dw_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {75645#true} ~__retres1~0 := 0; {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {75645#true} #res := ~__retres1~0; {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {75645#true} {75645#true} #1634#return; {75645#true} is VALID [2022-02-20 20:01:11,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {75645#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {75645#true} assume !(0 != ~tmp~1); {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {75645#true} call #t~ret9 := is_do_read_c_triggered(); {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {75645#true} havoc ~__retres1~1; {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {75645#true} assume !(1 == ~c_dr_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {75645#true} assume !(2 == ~c_dr_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {75645#true} ~__retres1~1 := 0; {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {75645#true} #res := ~__retres1~1; {75645#true} is VALID [2022-02-20 20:01:11,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {75645#true} {75645#true} #1636#return; {75645#true} is VALID [2022-02-20 20:01:11,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {75645#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {75645#true} is VALID [2022-02-20 20:01:11,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {75645#true} assume !(0 != ~tmp___0~1); {75645#true} is VALID [2022-02-20 20:01:11,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {75645#true} {75646#false} #1642#return; {75646#false} is VALID [2022-02-20 20:01:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {75693#(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); {75645#true} is VALID [2022-02-20 20:01:11,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume !(1 == ~q_write_ev~0); {75645#true} is VALID [2022-02-20 20:01:11,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75645#true} {75646#false} #1644#return; {75646#false} is VALID [2022-02-20 20:01:11,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {75645#true} havoc ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75645#true} is VALID [2022-02-20 20:01:11,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} #res := ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,780 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75645#true} {75646#false} #1646#return; {75646#false} is VALID [2022-02-20 20:01:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {75645#true} havoc ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75645#true} is VALID [2022-02-20 20:01:11,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} #res := ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,783 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75645#true} {75646#false} #1646#return; {75646#false} is VALID [2022-02-20 20:01:11,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {75645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {75645#true} is VALID [2022-02-20 20:01:11,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {75645#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {75645#true} is VALID [2022-02-20 20:01:11,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {75645#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {75647#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:11,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {75647#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {75647#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:11,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {75647#(= 1 ~c_dr_i~0)} call update_channels1(); {75692#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:11,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {75692#(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); {75645#true} is VALID [2022-02-20 20:01:11,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,785 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {75645#true} {75647#(= 1 ~c_dr_i~0)} #1638#return; {75647#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:11,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {75647#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {75647#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:11,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {75647#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {75647#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:11,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {75647#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {75646#false} is VALID [2022-02-20 20:01:11,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {75646#false} assume { :end_inline_init_threads1 } true; {75646#false} is VALID [2022-02-20 20:01:11,786 INFO L272 TraceCheckUtils]: 12: Hoare triple {75646#false} call fire_delta_events1(); {75693#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:11,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {75693#(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); {75645#true} is VALID [2022-02-20 20:01:11,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {75645#true} assume !(0 == ~q_write_ev~0); {75645#true} is VALID [2022-02-20 20:01:11,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,787 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {75645#true} {75646#false} #1640#return; {75646#false} is VALID [2022-02-20 20:01:11,787 INFO L272 TraceCheckUtils]: 17: Hoare triple {75646#false} call activate_threads1(); {75694#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:11,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {75694#(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; {75645#true} is VALID [2022-02-20 20:01:11,787 INFO L272 TraceCheckUtils]: 19: Hoare triple {75645#true} call #t~ret8 := is_do_write_p_triggered(); {75645#true} is VALID [2022-02-20 20:01:11,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {75645#true} havoc ~__retres1~0; {75645#true} is VALID [2022-02-20 20:01:11,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {75645#true} assume !(1 == ~p_dw_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {75645#true} assume !(2 == ~p_dw_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {75645#true} ~__retres1~0 := 0; {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {75645#true} #res := ~__retres1~0; {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75645#true} {75645#true} #1634#return; {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {75645#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {75645#true} assume !(0 != ~tmp~1); {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L272 TraceCheckUtils]: 29: Hoare triple {75645#true} call #t~ret9 := is_do_read_c_triggered(); {75645#true} is VALID [2022-02-20 20:01:11,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {75645#true} havoc ~__retres1~1; {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {75645#true} assume !(1 == ~c_dr_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {75645#true} assume !(2 == ~c_dr_pc~0); {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {75645#true} ~__retres1~1 := 0; {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {75645#true} #res := ~__retres1~1; {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75645#true} {75645#true} #1636#return; {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {75645#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {75645#true} assume !(0 != ~tmp___0~1); {75645#true} is VALID [2022-02-20 20:01:11,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,790 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {75645#true} {75646#false} #1642#return; {75646#false} is VALID [2022-02-20 20:01:11,790 INFO L272 TraceCheckUtils]: 41: Hoare triple {75646#false} call reset_delta_events1(); {75693#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:11,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {75693#(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); {75645#true} is VALID [2022-02-20 20:01:11,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {75645#true} assume !(1 == ~q_write_ev~0); {75645#true} is VALID [2022-02-20 20:01:11,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,790 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {75645#true} {75646#false} #1644#return; {75646#false} is VALID [2022-02-20 20:01:11,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {75646#false} assume !false; {75646#false} is VALID [2022-02-20 20:01:11,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {75646#false} assume !false; {75646#false} is VALID [2022-02-20 20:01:11,791 INFO L272 TraceCheckUtils]: 49: Hoare triple {75646#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {75645#true} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {75645#true} havoc ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {75645#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75645#true} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {75645#true} #res := ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,791 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {75645#true} {75646#false} #1646#return; {75646#false} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {75646#false} assume 0 != eval1_~tmp___1~0#1; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 57: Hoare triple {75646#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {75646#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 59: Hoare triple {75646#false} assume 0 == ~p_dw_pc~0; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {75646#false} assume !false; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {75646#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 62: Hoare triple {75646#false} assume { :end_inline_do_write_p } true; {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 63: Hoare triple {75646#false} assume !(0 == ~c_dr_st~0); {75646#false} is VALID [2022-02-20 20:01:11,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {75646#false} assume !false; {75646#false} is VALID [2022-02-20 20:01:11,793 INFO L272 TraceCheckUtils]: 65: Hoare triple {75646#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {75645#true} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {75645#true} havoc ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {75645#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75645#true} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {75645#true} #res := ~__retres1~2; {75645#true} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {75645#true} assume true; {75645#true} is VALID [2022-02-20 20:01:11,793 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {75645#true} {75646#false} #1646#return; {75646#false} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 71: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {75646#false} assume 0 != eval1_~tmp___1~0#1; {75646#false} is VALID [2022-02-20 20:01:11,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {75646#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {75646#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {75646#false} assume !(0 == ~p_dw_pc~0); {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {75646#false} assume 1 == ~p_dw_pc~0; {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {75646#false} assume !(0 == ~q_free~0); {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {75646#false} assume !false; {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {75646#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75646#false} is VALID [2022-02-20 20:01:11,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {75646#false} assume { :end_inline_do_write_p } true; {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {75646#false} assume !(0 == ~c_dr_pc~0); {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {75646#false} assume 2 == ~c_dr_pc~0; {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {75646#false} do_read_c_~a~0#1 := ~a_t~0; {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {75646#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; {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {75646#false} assume !(~p_last_write~0 == ~c_last_read~0); {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L272 TraceCheckUtils]: 89: Hoare triple {75646#false} call error1(); {75646#false} is VALID [2022-02-20 20:01:11,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {75646#false} assume !false; {75646#false} is VALID [2022-02-20 20:01:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:11,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:11,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175291514] [2022-02-20 20:01:11,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175291514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:11,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:11,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:11,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798438979] [2022-02-20 20:01:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:11,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:11,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:11,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:11,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:11,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:11,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:11,833 INFO L87 Difference]: Start difference. First operand 3696 states and 4804 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,499 INFO L93 Difference]: Finished difference Result 5504 states and 7072 transitions. [2022-02-20 20:01:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 794 transitions. [2022-02-20 20:01:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 794 transitions. [2022-02-20 20:01:14,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 794 transitions. [2022-02-20 20:01:14,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 794 edges. 794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:15,182 INFO L225 Difference]: With dead ends: 5504 [2022-02-20 20:01:15,182 INFO L226 Difference]: Without dead ends: 2127 [2022-02-20 20:01:15,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:15,186 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 657 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:15,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 1709 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-02-20 20:01:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2009. [2022-02-20 20:01:15,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:15,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2127 states. Second operand has 2009 states, 1612 states have (on average 1.3095533498759304) internal successors, (2111), 1638 states have internal predecessors, (2111), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:15,280 INFO L74 IsIncluded]: Start isIncluded. First operand 2127 states. Second operand has 2009 states, 1612 states have (on average 1.3095533498759304) internal successors, (2111), 1638 states have internal predecessors, (2111), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:15,282 INFO L87 Difference]: Start difference. First operand 2127 states. Second operand has 2009 states, 1612 states have (on average 1.3095533498759304) internal successors, (2111), 1638 states have internal predecessors, (2111), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:15,403 INFO L93 Difference]: Finished difference Result 2127 states and 2768 transitions. [2022-02-20 20:01:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2768 transitions. [2022-02-20 20:01:15,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:15,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:15,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 2009 states, 1612 states have (on average 1.3095533498759304) internal successors, (2111), 1638 states have internal predecessors, (2111), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) Second operand 2127 states. [2022-02-20 20:01:15,411 INFO L87 Difference]: Start difference. First operand has 2009 states, 1612 states have (on average 1.3095533498759304) internal successors, (2111), 1638 states have internal predecessors, (2111), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) Second operand 2127 states. [2022-02-20 20:01:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:15,535 INFO L93 Difference]: Finished difference Result 2127 states and 2768 transitions. [2022-02-20 20:01:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2768 transitions. [2022-02-20 20:01:15,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:15,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:15,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:15,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1612 states have (on average 1.3095533498759304) internal successors, (2111), 1638 states have internal predecessors, (2111), 217 states have call successors, (217), 140 states have call predecessors, (217), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-02-20 20:01:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2603 transitions. [2022-02-20 20:01:15,714 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2603 transitions. Word has length 91 [2022-02-20 20:01:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:15,715 INFO L470 AbstractCegarLoop]: Abstraction has 2009 states and 2603 transitions. [2022-02-20 20:01:15,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2603 transitions. [2022-02-20 20:01:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:15,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:15,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:15,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:15,716 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash -828087601, now seen corresponding path program 1 times [2022-02-20 20:01:15,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:15,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654015897] [2022-02-20 20:01:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {90094#(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); {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:15,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:15,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {90048#(= ~q_read_ev~0 2)} #1638#return; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {90096#(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); {90046#true} is VALID [2022-02-20 20:01:15,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume !(0 == ~q_write_ev~0); {90046#true} is VALID [2022-02-20 20:01:15,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90046#true} {90048#(= ~q_read_ev~0 2)} #1640#return; {90046#true} is VALID [2022-02-20 20:01:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {90046#true} havoc ~__retres1~0; {90046#true} is VALID [2022-02-20 20:01:15,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume !(1 == ~p_dw_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} assume !(2 == ~p_dw_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {90046#true} ~__retres1~0 := 0; {90046#true} is VALID [2022-02-20 20:01:15,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {90046#true} #res := ~__retres1~0; {90046#true} is VALID [2022-02-20 20:01:15,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,794 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {90046#true} {90046#true} #1634#return; {90046#true} is VALID [2022-02-20 20:01:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {90046#true} havoc ~__retres1~1; {90046#true} is VALID [2022-02-20 20:01:15,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume !(1 == ~c_dr_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} assume !(2 == ~c_dr_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {90046#true} ~__retres1~1 := 0; {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L290 TraceCheckUtils]: 4: Hoare triple {90046#true} #res := ~__retres1~1; {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {90046#true} {90046#true} #1636#return; {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {90097#(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; {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L272 TraceCheckUtils]: 1: Hoare triple {90046#true} call #t~ret8 := is_do_write_p_triggered(); {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} havoc ~__retres1~0; {90046#true} is VALID [2022-02-20 20:01:15,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {90046#true} assume !(1 == ~p_dw_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {90046#true} assume !(2 == ~p_dw_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {90046#true} ~__retres1~0 := 0; {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {90046#true} #res := ~__retres1~0; {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {90046#true} {90046#true} #1634#return; {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {90046#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {90046#true} assume !(0 != ~tmp~1); {90046#true} is VALID [2022-02-20 20:01:15,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {90046#true} call #t~ret9 := is_do_read_c_triggered(); {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {90046#true} havoc ~__retres1~1; {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {90046#true} assume !(1 == ~c_dr_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {90046#true} assume !(2 == ~c_dr_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {90046#true} ~__retres1~1 := 0; {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {90046#true} #res := ~__retres1~1; {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {90046#true} {90046#true} #1636#return; {90046#true} is VALID [2022-02-20 20:01:15,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {90046#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {90046#true} is VALID [2022-02-20 20:01:15,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {90046#true} assume !(0 != ~tmp___0~1); {90046#true} is VALID [2022-02-20 20:01:15,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,803 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {90046#true} {90046#true} #1642#return; {90046#true} is VALID [2022-02-20 20:01:15,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {90096#(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); {90046#true} is VALID [2022-02-20 20:01:15,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume !(1 == ~q_write_ev~0); {90046#true} is VALID [2022-02-20 20:01:15,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90046#true} {90046#true} #1644#return; {90046#true} is VALID [2022-02-20 20:01:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {90046#true} havoc ~__retres1~2; {90046#true} is VALID [2022-02-20 20:01:15,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90046#true} is VALID [2022-02-20 20:01:15,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} #res := ~__retres1~2; {90046#true} is VALID [2022-02-20 20:01:15,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,809 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {90046#true} {90046#true} #1646#return; {90046#true} is VALID [2022-02-20 20:01:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:15,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {90046#true} havoc ~__retres1~2; {90046#true} is VALID [2022-02-20 20:01:15,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90112#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:15,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {90112#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {90112#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:15,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {90112#(= ~p_dw_st~0 0)} assume true; {90112#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:15,817 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {90112#(= ~p_dw_st~0 0)} {90088#(not (= ~p_dw_st~0 0))} #1646#return; {90047#false} is VALID [2022-02-20 20:01:15,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {90046#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {90046#true} is VALID [2022-02-20 20:01:15,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {90046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {90046#true} is VALID [2022-02-20 20:01:15,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {90046#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {90048#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {90048#(= ~q_read_ev~0 2)} call update_channels1(); {90094#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:15,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#(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); {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:15,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:15,820 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {90095#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {90048#(= ~q_read_ev~0 2)} #1638#return; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {90048#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {90048#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {90048#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {90048#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {90048#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:15,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {90048#(= ~q_read_ev~0 2)} call fire_delta_events1(); {90096#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:15,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {90096#(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); {90046#true} is VALID [2022-02-20 20:01:15,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {90046#true} assume !(0 == ~q_write_ev~0); {90046#true} is VALID [2022-02-20 20:01:15,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,822 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {90046#true} {90048#(= ~q_read_ev~0 2)} #1640#return; {90046#true} is VALID [2022-02-20 20:01:15,822 INFO L272 TraceCheckUtils]: 17: Hoare triple {90046#true} call activate_threads1(); {90097#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:15,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {90097#(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; {90046#true} is VALID [2022-02-20 20:01:15,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {90046#true} call #t~ret8 := is_do_write_p_triggered(); {90046#true} is VALID [2022-02-20 20:01:15,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {90046#true} havoc ~__retres1~0; {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {90046#true} assume !(1 == ~p_dw_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {90046#true} assume !(2 == ~p_dw_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {90046#true} ~__retres1~0 := 0; {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {90046#true} #res := ~__retres1~0; {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {90046#true} {90046#true} #1634#return; {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {90046#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {90046#true} assume !(0 != ~tmp~1); {90046#true} is VALID [2022-02-20 20:01:15,823 INFO L272 TraceCheckUtils]: 29: Hoare triple {90046#true} call #t~ret9 := is_do_read_c_triggered(); {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {90046#true} havoc ~__retres1~1; {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {90046#true} assume !(1 == ~c_dr_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {90046#true} assume !(2 == ~c_dr_pc~0); {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {90046#true} ~__retres1~1 := 0; {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {90046#true} #res := ~__retres1~1; {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {90046#true} {90046#true} #1636#return; {90046#true} is VALID [2022-02-20 20:01:15,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {90046#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {90046#true} is VALID [2022-02-20 20:01:15,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {90046#true} assume !(0 != ~tmp___0~1); {90046#true} is VALID [2022-02-20 20:01:15,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,825 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {90046#true} {90046#true} #1642#return; {90046#true} is VALID [2022-02-20 20:01:15,825 INFO L272 TraceCheckUtils]: 41: Hoare triple {90046#true} call reset_delta_events1(); {90096#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:15,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {90096#(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); {90046#true} is VALID [2022-02-20 20:01:15,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {90046#true} assume !(1 == ~q_write_ev~0); {90046#true} is VALID [2022-02-20 20:01:15,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {90046#true} {90046#true} #1644#return; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {90046#true} assume !false; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {90046#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; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {90046#true} assume !false; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L272 TraceCheckUtils]: 49: Hoare triple {90046#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {90046#true} havoc ~__retres1~2; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {90046#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90046#true} is VALID [2022-02-20 20:01:15,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {90046#true} #res := ~__retres1~2; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {90046#true} assume true; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {90046#true} {90046#true} #1646#return; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {90046#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; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {90046#true} assume 0 != eval1_~tmp___1~0#1; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {90046#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; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {90046#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; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {90046#true} assume 0 == ~p_dw_pc~0; {90046#true} is VALID [2022-02-20 20:01:15,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {90046#true} assume !false; {90046#true} is VALID [2022-02-20 20:01:15,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {90046#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {90088#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:15,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {90088#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {90088#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:15,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {90088#(not (= ~p_dw_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {90088#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:15,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {90088#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {90088#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:15,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {90088#(not (= ~p_dw_st~0 0))} assume !false; {90088#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:15,829 INFO L272 TraceCheckUtils]: 66: Hoare triple {90088#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {90046#true} is VALID [2022-02-20 20:01:15,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {90046#true} havoc ~__retres1~2; {90046#true} is VALID [2022-02-20 20:01:15,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {90046#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90112#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:15,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {90112#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {90112#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:15,830 INFO L290 TraceCheckUtils]: 70: Hoare triple {90112#(= ~p_dw_st~0 0)} assume true; {90112#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:15,830 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {90112#(= ~p_dw_st~0 0)} {90088#(not (= ~p_dw_st~0 0))} #1646#return; {90047#false} is VALID [2022-02-20 20:01:15,830 INFO L290 TraceCheckUtils]: 72: Hoare triple {90047#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; {90047#false} is VALID [2022-02-20 20:01:15,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {90047#false} assume 0 != eval1_~tmp___1~0#1; {90047#false} is VALID [2022-02-20 20:01:15,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {90047#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 75: Hoare triple {90047#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 76: Hoare triple {90047#false} assume !(0 == ~p_dw_pc~0); {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 77: Hoare triple {90047#false} assume 1 == ~p_dw_pc~0; {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 78: Hoare triple {90047#false} assume !(0 == ~q_free~0); {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 79: Hoare triple {90047#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; {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 80: Hoare triple {90047#false} assume !false; {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 81: Hoare triple {90047#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {90047#false} is VALID [2022-02-20 20:01:15,831 INFO L290 TraceCheckUtils]: 82: Hoare triple {90047#false} assume { :end_inline_do_write_p } true; {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 83: Hoare triple {90047#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; {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 84: Hoare triple {90047#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; {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 85: Hoare triple {90047#false} assume !(0 == ~c_dr_pc~0); {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 86: Hoare triple {90047#false} assume 2 == ~c_dr_pc~0; {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 87: Hoare triple {90047#false} do_read_c_~a~0#1 := ~a_t~0; {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 88: Hoare triple {90047#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; {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 89: Hoare triple {90047#false} assume !(~p_last_write~0 == ~c_last_read~0); {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L272 TraceCheckUtils]: 90: Hoare triple {90047#false} call error1(); {90047#false} is VALID [2022-02-20 20:01:15,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {90047#false} assume !false; {90047#false} is VALID [2022-02-20 20:01:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:01:15,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:15,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654015897] [2022-02-20 20:01:15,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654015897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:15,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:15,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:15,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464928061] [2022-02-20 20:01:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:15,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:15,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:15,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:15,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:15,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:15,882 INFO L87 Difference]: Start difference. First operand 2009 states and 2603 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:20,353 INFO L93 Difference]: Finished difference Result 4665 states and 5993 transitions. [2022-02-20 20:01:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:01:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1226 transitions. [2022-02-20 20:01:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1226 transitions. [2022-02-20 20:01:20,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1226 transitions. [2022-02-20 20:01:21,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1226 edges. 1226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:21,466 INFO L225 Difference]: With dead ends: 4665 [2022-02-20 20:01:21,466 INFO L226 Difference]: Without dead ends: 2823 [2022-02-20 20:01:21,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:01:21,469 INFO L933 BasicCegarLoop]: 681 mSDtfsCounter, 2236 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:21,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2278 Valid, 1989 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2022-02-20 20:01:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2646. [2022-02-20 20:01:21,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:21,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2823 states. Second operand has 2646 states, 2090 states have (on average 1.2708133971291866) internal successors, (2656), 2125 states have internal predecessors, (2656), 296 states have call successors, (296), 189 states have call predecessors, (296), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) [2022-02-20 20:01:21,642 INFO L74 IsIncluded]: Start isIncluded. First operand 2823 states. Second operand has 2646 states, 2090 states have (on average 1.2708133971291866) internal successors, (2656), 2125 states have internal predecessors, (2656), 296 states have call successors, (296), 189 states have call predecessors, (296), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) [2022-02-20 20:01:21,644 INFO L87 Difference]: Start difference. First operand 2823 states. Second operand has 2646 states, 2090 states have (on average 1.2708133971291866) internal successors, (2656), 2125 states have internal predecessors, (2656), 296 states have call successors, (296), 189 states have call predecessors, (296), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) [2022-02-20 20:01:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:21,845 INFO L93 Difference]: Finished difference Result 2823 states and 3568 transitions. [2022-02-20 20:01:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3568 transitions. [2022-02-20 20:01:21,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:21,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:21,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 2646 states, 2090 states have (on average 1.2708133971291866) internal successors, (2656), 2125 states have internal predecessors, (2656), 296 states have call successors, (296), 189 states have call predecessors, (296), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) Second operand 2823 states. [2022-02-20 20:01:21,856 INFO L87 Difference]: Start difference. First operand has 2646 states, 2090 states have (on average 1.2708133971291866) internal successors, (2656), 2125 states have internal predecessors, (2656), 296 states have call successors, (296), 189 states have call predecessors, (296), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) Second operand 2823 states. [2022-02-20 20:01:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:22,068 INFO L93 Difference]: Finished difference Result 2823 states and 3568 transitions. [2022-02-20 20:01:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3568 transitions. [2022-02-20 20:01:22,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:22,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:22,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:22,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2090 states have (on average 1.2708133971291866) internal successors, (2656), 2125 states have internal predecessors, (2656), 296 states have call successors, (296), 189 states have call predecessors, (296), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) [2022-02-20 20:01:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3363 transitions. [2022-02-20 20:01:22,376 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 3363 transitions. Word has length 92 [2022-02-20 20:01:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:22,377 INFO L470 AbstractCegarLoop]: Abstraction has 2646 states and 3363 transitions. [2022-02-20 20:01:22,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3363 transitions. [2022-02-20 20:01:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-02-20 20:01:22,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:22,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:22,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:01:22,379 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1167702267, now seen corresponding path program 1 times [2022-02-20 20:01:22,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:22,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931728336] [2022-02-20 20:01:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:22,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,429 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {105580#true} {105582#(= ~t7_i~0 1)} #1666#return; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 20:01:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:22,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {105696#(and (= ~E_6~0 |old(~E_6~0)|) (= ~T9_E~0 |old(~T9_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_8~0 |old(~E_8~0)|) (= ~E_7~0 |old(~E_7~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~T7_E~0 |old(~T7_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T8_E~0 |old(~T8_E~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T6_E~0)| ~T6_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_9~0 |old(~E_9~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {105580#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {105580#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {105580#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {105580#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {105580#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {105580#true} assume 0 == ~T6_E~0;~T6_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {105580#true} assume !(0 == ~T7_E~0); {105580#true} is VALID [2022-02-20 20:01:22,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {105580#true} assume 0 == ~T8_E~0;~T8_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {105580#true} assume 0 == ~T9_E~0;~T9_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {105580#true} assume 0 == ~E_M~0;~E_M~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {105580#true} assume 0 == ~E_1~0;~E_1~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {105580#true} assume 0 == ~E_2~0;~E_2~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {105580#true} assume 0 == ~E_3~0;~E_3~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {105580#true} assume 0 == ~E_4~0;~E_4~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {105580#true} assume !(0 == ~E_5~0); {105580#true} is VALID [2022-02-20 20:01:22,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {105580#true} assume 0 == ~E_6~0;~E_6~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {105580#true} assume 0 == ~E_7~0;~E_7~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {105580#true} assume 0 == ~E_8~0;~E_8~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {105580#true} assume 0 == ~E_9~0;~E_9~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,458 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {105580#true} {105581#false} #1668#return; {105581#false} is VALID [2022-02-20 20:01:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 20:01:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:22,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {105697#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t6_st~0)| ~t6_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t9_st~0)| ~t9_st~0) (= |old(~t4_st~0)| ~t4_st~0) (= |old(~t8_st~0)| ~t8_st~0) (= |old(~t7_st~0)| ~t7_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;havoc ~tmp___5~0#1;havoc ~tmp___6~0#1;havoc ~tmp___7~0#1;havoc ~tmp___8~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {105580#true} is VALID [2022-02-20 20:01:22,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {105580#true} assume !(1 == ~m_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {105580#true} is_master_triggered_~__retres1~4#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {105580#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {105580#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~6#1 := #t~ret33#1;havoc #t~ret33#1; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {105580#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {105580#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {105580#true} assume 1 == ~t1_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {105580#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {105580#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {105580#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~4#1 := #t~ret34#1;havoc #t~ret34#1; {105580#true} is VALID [2022-02-20 20:01:22,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {105580#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {105580#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {105580#true} is VALID [2022-02-20 20:01:22,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {105580#true} assume !(1 == ~t2_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {105580#true} is_transmit2_triggered_~__retres1~6#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {105580#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {105580#true} is VALID [2022-02-20 20:01:22,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {105580#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~1#1 := #t~ret35#1;havoc #t~ret35#1; {105580#true} is VALID [2022-02-20 20:01:22,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {105580#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {105580#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {105580#true} assume 1 == ~t3_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {105580#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {105580#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {105580#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {105580#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {105580#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {105580#true} is VALID [2022-02-20 20:01:22,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {105580#true} assume 1 == ~t4_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {105580#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {105580#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {105580#true} #t~ret37#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___3~0#1 := #t~ret37#1;havoc #t~ret37#1; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {105580#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {105580#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {105580#true} assume !(1 == ~t5_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {105580#true} is_transmit5_triggered_~__retres1~9#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {105580#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {105580#true} #t~ret38#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___4~0#1 := #t~ret38#1;havoc #t~ret38#1; {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {105580#true} assume !(0 != ~tmp___4~0#1); {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {105580#true} assume { :begin_inline_is_transmit6_triggered } true;havoc is_transmit6_triggered_#res#1;havoc is_transmit6_triggered_~__retres1~10#1;havoc is_transmit6_triggered_~__retres1~10#1; {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {105580#true} assume 1 == ~t6_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {105580#true} assume 1 == ~E_6~0;is_transmit6_triggered_~__retres1~10#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {105580#true} is_transmit6_triggered_#res#1 := is_transmit6_triggered_~__retres1~10#1; {105580#true} is VALID [2022-02-20 20:01:22,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {105580#true} #t~ret39#1 := is_transmit6_triggered_#res#1;assume { :end_inline_is_transmit6_triggered } true;assume -2147483648 <= #t~ret39#1 && #t~ret39#1 <= 2147483647;~tmp___5~0#1 := #t~ret39#1;havoc #t~ret39#1; {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {105580#true} assume 0 != ~tmp___5~0#1;~t6_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {105580#true} assume { :begin_inline_is_transmit7_triggered } true;havoc is_transmit7_triggered_#res#1;havoc is_transmit7_triggered_~__retres1~11#1;havoc is_transmit7_triggered_~__retres1~11#1; {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {105580#true} assume !(1 == ~t7_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {105580#true} is_transmit7_triggered_~__retres1~11#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {105580#true} is_transmit7_triggered_#res#1 := is_transmit7_triggered_~__retres1~11#1; {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {105580#true} #t~ret40#1 := is_transmit7_triggered_#res#1;assume { :end_inline_is_transmit7_triggered } true;assume -2147483648 <= #t~ret40#1 && #t~ret40#1 <= 2147483647;~tmp___6~0#1 := #t~ret40#1;havoc #t~ret40#1; {105580#true} is VALID [2022-02-20 20:01:22,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {105580#true} assume 0 != ~tmp___6~0#1;~t7_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {105580#true} assume { :begin_inline_is_transmit8_triggered } true;havoc is_transmit8_triggered_#res#1;havoc is_transmit8_triggered_~__retres1~12#1;havoc is_transmit8_triggered_~__retres1~12#1; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {105580#true} assume 1 == ~t8_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {105580#true} assume 1 == ~E_8~0;is_transmit8_triggered_~__retres1~12#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {105580#true} is_transmit8_triggered_#res#1 := is_transmit8_triggered_~__retres1~12#1; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {105580#true} #t~ret41#1 := is_transmit8_triggered_#res#1;assume { :end_inline_is_transmit8_triggered } true;assume -2147483648 <= #t~ret41#1 && #t~ret41#1 <= 2147483647;~tmp___7~0#1 := #t~ret41#1;havoc #t~ret41#1; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {105580#true} assume 0 != ~tmp___7~0#1;~t8_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {105580#true} assume { :begin_inline_is_transmit9_triggered } true;havoc is_transmit9_triggered_#res#1;havoc is_transmit9_triggered_~__retres1~13#1;havoc is_transmit9_triggered_~__retres1~13#1; {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {105580#true} assume !(1 == ~t9_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {105580#true} is_transmit9_triggered_~__retres1~13#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {105580#true} is_transmit9_triggered_#res#1 := is_transmit9_triggered_~__retres1~13#1; {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {105580#true} #t~ret42#1 := is_transmit9_triggered_#res#1;assume { :end_inline_is_transmit9_triggered } true;assume -2147483648 <= #t~ret42#1 && #t~ret42#1 <= 2147483647;~tmp___8~0#1 := #t~ret42#1;havoc #t~ret42#1; {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {105580#true} assume 0 != ~tmp___8~0#1;~t9_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,493 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {105580#true} {105581#false} #1670#return; {105581#false} is VALID [2022-02-20 20:01:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-02-20 20:01:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:22,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {105696#(and (= ~E_6~0 |old(~E_6~0)|) (= ~T9_E~0 |old(~T9_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_8~0 |old(~E_8~0)|) (= ~E_7~0 |old(~E_7~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~T7_E~0 |old(~T7_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T8_E~0 |old(~T8_E~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T6_E~0)| ~T6_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_9~0 |old(~E_9~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {105580#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {105580#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {105580#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {105580#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {105580#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {105580#true} assume 1 == ~T6_E~0;~T6_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {105580#true} assume !(1 == ~T7_E~0); {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {105580#true} assume 1 == ~T8_E~0;~T8_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {105580#true} assume 1 == ~T9_E~0;~T9_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {105580#true} assume 1 == ~E_M~0;~E_M~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {105580#true} assume 1 == ~E_1~0;~E_1~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {105580#true} assume 1 == ~E_2~0;~E_2~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {105580#true} assume 1 == ~E_3~0;~E_3~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {105580#true} assume 1 == ~E_4~0;~E_4~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {105580#true} assume !(1 == ~E_5~0); {105580#true} is VALID [2022-02-20 20:01:22,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {105580#true} assume 1 == ~E_6~0;~E_6~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {105580#true} assume 1 == ~E_7~0;~E_7~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {105580#true} assume 1 == ~E_8~0;~E_8~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {105580#true} assume 1 == ~E_9~0;~E_9~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,516 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {105580#true} {105581#false} #1672#return; {105581#false} is VALID [2022-02-20 20:01:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-02-20 20:01:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:22,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {105580#true} havoc ~__retres1~14; {105580#true} is VALID [2022-02-20 20:01:22,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {105580#true} assume 0 == ~m_st~0;~__retres1~14 := 1; {105580#true} is VALID [2022-02-20 20:01:22,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {105580#true} #res := ~__retres1~14; {105580#true} is VALID [2022-02-20 20:01:22,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,520 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {105580#true} {105581#false} #1674#return; {105581#false} is VALID [2022-02-20 20:01:22,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {105580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {105580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {105580#true} is VALID [2022-02-20 20:01:22,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {105580#true} assume !(0 != main_#t~nondet46#1);havoc main_#t~nondet46#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~15#1;havoc main2_~__retres1~15#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1;~t5_i~0 := 1;~t6_i~0 := 1;~t7_i~0 := 1;~t8_i~0 := 1;~t9_i~0 := 1; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {105582#(= ~t7_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret44#1, start_simulation2_#t~ret45#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {105582#(= ~t7_i~0 1)} call update_channels2(); {105580#true} is VALID [2022-02-20 20:01:22,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,521 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {105580#true} {105582#(= ~t7_i~0 1)} #1666#return; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {105582#(= ~t7_i~0 1)} assume { :begin_inline_init_threads2 } true; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~t5_i~0;~t5_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {105582#(= ~t7_i~0 1)} assume 1 == ~t6_i~0;~t6_st~0 := 0; {105582#(= ~t7_i~0 1)} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {105582#(= ~t7_i~0 1)} assume !(1 == ~t7_i~0);~t7_st~0 := 2; {105581#false} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {105581#false} assume 1 == ~t8_i~0;~t8_st~0 := 0; {105581#false} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {105581#false} assume 1 == ~t9_i~0;~t9_st~0 := 0; {105581#false} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {105581#false} assume { :end_inline_init_threads2 } true; {105581#false} is VALID [2022-02-20 20:01:22,524 INFO L272 TraceCheckUtils]: 19: Hoare triple {105581#false} call fire_delta_events2(); {105696#(and (= ~E_6~0 |old(~E_6~0)|) (= ~T9_E~0 |old(~T9_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_8~0 |old(~E_8~0)|) (= ~E_7~0 |old(~E_7~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~T7_E~0 |old(~T7_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T8_E~0 |old(~T8_E~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T6_E~0)| ~T6_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_9~0 |old(~E_9~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {105696#(and (= ~E_6~0 |old(~E_6~0)|) (= ~T9_E~0 |old(~T9_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_8~0 |old(~E_8~0)|) (= ~E_7~0 |old(~E_7~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~T7_E~0 |old(~T7_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T8_E~0 |old(~T8_E~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T6_E~0)| ~T6_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_9~0 |old(~E_9~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {105580#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {105580#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {105580#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {105580#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {105580#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {105580#true} assume 0 == ~T6_E~0;~T6_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {105580#true} assume !(0 == ~T7_E~0); {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {105580#true} assume 0 == ~T8_E~0;~T8_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {105580#true} assume 0 == ~T9_E~0;~T9_E~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {105580#true} assume 0 == ~E_M~0;~E_M~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {105580#true} assume 0 == ~E_1~0;~E_1~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {105580#true} assume 0 == ~E_2~0;~E_2~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {105580#true} assume 0 == ~E_3~0;~E_3~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {105580#true} assume 0 == ~E_4~0;~E_4~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {105580#true} assume !(0 == ~E_5~0); {105580#true} is VALID [2022-02-20 20:01:22,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {105580#true} assume 0 == ~E_6~0;~E_6~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {105580#true} assume 0 == ~E_7~0;~E_7~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {105580#true} assume 0 == ~E_8~0;~E_8~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {105580#true} assume 0 == ~E_9~0;~E_9~0 := 1; {105580#true} is VALID [2022-02-20 20:01:22,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,537 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {105580#true} {105581#false} #1668#return; {105581#false} is VALID [2022-02-20 20:01:22,537 INFO L272 TraceCheckUtils]: 42: Hoare triple {105581#false} call activate_threads2(); {105697#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t6_st~0)| ~t6_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t9_st~0)| ~t9_st~0) (= |old(~t4_st~0)| ~t4_st~0) (= |old(~t8_st~0)| ~t8_st~0) (= |old(~t7_st~0)| ~t7_st~0))} is VALID [2022-02-20 20:01:22,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {105697#(and (= |old(~t5_st~0)| ~t5_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t6_st~0)| ~t6_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t9_st~0)| ~t9_st~0) (= |old(~t4_st~0)| ~t4_st~0) (= |old(~t8_st~0)| ~t8_st~0) (= |old(~t7_st~0)| ~t7_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;havoc ~tmp___4~0#1;havoc ~tmp___5~0#1;havoc ~tmp___6~0#1;havoc ~tmp___7~0#1;havoc ~tmp___8~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {105580#true} is VALID [2022-02-20 20:01:22,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {105580#true} assume !(1 == ~m_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {105580#true} is_master_triggered_~__retres1~4#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {105580#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {105580#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~6#1 := #t~ret33#1;havoc #t~ret33#1; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {105580#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {105580#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {105580#true} assume 1 == ~t1_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {105580#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {105580#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {105580#true} is VALID [2022-02-20 20:01:22,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {105580#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~4#1 := #t~ret34#1;havoc #t~ret34#1; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {105580#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 55: Hoare triple {105580#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 56: Hoare triple {105580#true} assume !(1 == ~t2_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {105580#true} is_transmit2_triggered_~__retres1~6#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {105580#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 59: Hoare triple {105580#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~1#1 := #t~ret35#1;havoc #t~ret35#1; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 60: Hoare triple {105580#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {105580#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {105580#true} assume 1 == ~t3_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {105580#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {105580#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 65: Hoare triple {105580#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 66: Hoare triple {105580#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 67: Hoare triple {105580#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 68: Hoare triple {105580#true} assume 1 == ~t4_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,540 INFO L290 TraceCheckUtils]: 69: Hoare triple {105580#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 70: Hoare triple {105580#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 71: Hoare triple {105580#true} #t~ret37#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___3~0#1 := #t~ret37#1;havoc #t~ret37#1; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {105580#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {105580#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {105580#true} assume !(1 == ~t5_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 75: Hoare triple {105580#true} is_transmit5_triggered_~__retres1~9#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 76: Hoare triple {105580#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 77: Hoare triple {105580#true} #t~ret38#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___4~0#1 := #t~ret38#1;havoc #t~ret38#1; {105580#true} is VALID [2022-02-20 20:01:22,541 INFO L290 TraceCheckUtils]: 78: Hoare triple {105580#true} assume !(0 != ~tmp___4~0#1); {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 79: Hoare triple {105580#true} assume { :begin_inline_is_transmit6_triggered } true;havoc is_transmit6_triggered_#res#1;havoc is_transmit6_triggered_~__retres1~10#1;havoc is_transmit6_triggered_~__retres1~10#1; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 80: Hoare triple {105580#true} assume 1 == ~t6_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {105580#true} assume 1 == ~E_6~0;is_transmit6_triggered_~__retres1~10#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 82: Hoare triple {105580#true} is_transmit6_triggered_#res#1 := is_transmit6_triggered_~__retres1~10#1; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 83: Hoare triple {105580#true} #t~ret39#1 := is_transmit6_triggered_#res#1;assume { :end_inline_is_transmit6_triggered } true;assume -2147483648 <= #t~ret39#1 && #t~ret39#1 <= 2147483647;~tmp___5~0#1 := #t~ret39#1;havoc #t~ret39#1; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 84: Hoare triple {105580#true} assume 0 != ~tmp___5~0#1;~t6_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {105580#true} assume { :begin_inline_is_transmit7_triggered } true;havoc is_transmit7_triggered_#res#1;havoc is_transmit7_triggered_~__retres1~11#1;havoc is_transmit7_triggered_~__retres1~11#1; {105580#true} is VALID [2022-02-20 20:01:22,542 INFO L290 TraceCheckUtils]: 86: Hoare triple {105580#true} assume !(1 == ~t7_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {105580#true} is_transmit7_triggered_~__retres1~11#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {105580#true} is_transmit7_triggered_#res#1 := is_transmit7_triggered_~__retres1~11#1; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {105580#true} #t~ret40#1 := is_transmit7_triggered_#res#1;assume { :end_inline_is_transmit7_triggered } true;assume -2147483648 <= #t~ret40#1 && #t~ret40#1 <= 2147483647;~tmp___6~0#1 := #t~ret40#1;havoc #t~ret40#1; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {105580#true} assume 0 != ~tmp___6~0#1;~t7_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {105580#true} assume { :begin_inline_is_transmit8_triggered } true;havoc is_transmit8_triggered_#res#1;havoc is_transmit8_triggered_~__retres1~12#1;havoc is_transmit8_triggered_~__retres1~12#1; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 92: Hoare triple {105580#true} assume 1 == ~t8_pc~0; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 93: Hoare triple {105580#true} assume 1 == ~E_8~0;is_transmit8_triggered_~__retres1~12#1 := 1; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 94: Hoare triple {105580#true} is_transmit8_triggered_#res#1 := is_transmit8_triggered_~__retres1~12#1; {105580#true} is VALID [2022-02-20 20:01:22,543 INFO L290 TraceCheckUtils]: 95: Hoare triple {105580#true} #t~ret41#1 := is_transmit8_triggered_#res#1;assume { :end_inline_is_transmit8_triggered } true;assume -2147483648 <= #t~ret41#1 && #t~ret41#1 <= 2147483647;~tmp___7~0#1 := #t~ret41#1;havoc #t~ret41#1; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 96: Hoare triple {105580#true} assume 0 != ~tmp___7~0#1;~t8_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 97: Hoare triple {105580#true} assume { :begin_inline_is_transmit9_triggered } true;havoc is_transmit9_triggered_#res#1;havoc is_transmit9_triggered_~__retres1~13#1;havoc is_transmit9_triggered_~__retres1~13#1; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 98: Hoare triple {105580#true} assume !(1 == ~t9_pc~0); {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 99: Hoare triple {105580#true} is_transmit9_triggered_~__retres1~13#1 := 0; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 100: Hoare triple {105580#true} is_transmit9_triggered_#res#1 := is_transmit9_triggered_~__retres1~13#1; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 101: Hoare triple {105580#true} #t~ret42#1 := is_transmit9_triggered_#res#1;assume { :end_inline_is_transmit9_triggered } true;assume -2147483648 <= #t~ret42#1 && #t~ret42#1 <= 2147483647;~tmp___8~0#1 := #t~ret42#1;havoc #t~ret42#1; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 102: Hoare triple {105580#true} assume 0 != ~tmp___8~0#1;~t9_st~0 := 0; {105580#true} is VALID [2022-02-20 20:01:22,544 INFO L290 TraceCheckUtils]: 103: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {105580#true} {105581#false} #1670#return; {105581#false} is VALID [2022-02-20 20:01:22,545 INFO L272 TraceCheckUtils]: 105: Hoare triple {105581#false} call reset_delta_events2(); {105696#(and (= ~E_6~0 |old(~E_6~0)|) (= ~T9_E~0 |old(~T9_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_8~0 |old(~E_8~0)|) (= ~E_7~0 |old(~E_7~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~T7_E~0 |old(~T7_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T8_E~0 |old(~T8_E~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T6_E~0)| ~T6_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_9~0 |old(~E_9~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 106: Hoare triple {105696#(and (= ~E_6~0 |old(~E_6~0)|) (= ~T9_E~0 |old(~T9_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_8~0 |old(~E_8~0)|) (= ~E_7~0 |old(~E_7~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~T7_E~0 |old(~T7_E~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~T8_E~0 |old(~T8_E~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= |old(~T6_E~0)| ~T6_E~0) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~0)|) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_9~0 |old(~E_9~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 107: Hoare triple {105580#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 108: Hoare triple {105580#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 109: Hoare triple {105580#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 110: Hoare triple {105580#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 111: Hoare triple {105580#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {105580#true} assume 1 == ~T6_E~0;~T6_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 113: Hoare triple {105580#true} assume !(1 == ~T7_E~0); {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 114: Hoare triple {105580#true} assume 1 == ~T8_E~0;~T8_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 115: Hoare triple {105580#true} assume 1 == ~T9_E~0;~T9_E~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 116: Hoare triple {105580#true} assume 1 == ~E_M~0;~E_M~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 117: Hoare triple {105580#true} assume 1 == ~E_1~0;~E_1~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 118: Hoare triple {105580#true} assume 1 == ~E_2~0;~E_2~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 119: Hoare triple {105580#true} assume 1 == ~E_3~0;~E_3~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,546 INFO L290 TraceCheckUtils]: 120: Hoare triple {105580#true} assume 1 == ~E_4~0;~E_4~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 121: Hoare triple {105580#true} assume !(1 == ~E_5~0); {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 122: Hoare triple {105580#true} assume 1 == ~E_6~0;~E_6~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 123: Hoare triple {105580#true} assume 1 == ~E_7~0;~E_7~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 124: Hoare triple {105580#true} assume 1 == ~E_8~0;~E_8~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 125: Hoare triple {105580#true} assume 1 == ~E_9~0;~E_9~0 := 2; {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 126: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,547 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {105580#true} {105581#false} #1672#return; {105581#false} is VALID [2022-02-20 20:01:22,547 INFO L290 TraceCheckUtils]: 128: Hoare triple {105581#false} assume !false; {105581#false} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {105581#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_5~0#1, eval2_#t~nondet28#1, eval2_~tmp_ndt_6~0#1, eval2_#t~nondet29#1, eval2_~tmp_ndt_7~0#1, eval2_#t~nondet30#1, eval2_~tmp_ndt_8~0#1, eval2_#t~nondet31#1, eval2_~tmp_ndt_9~0#1, eval2_#t~nondet32#1, eval2_~tmp_ndt_10~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {105581#false} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 130: Hoare triple {105581#false} assume !false; {105581#false} is VALID [2022-02-20 20:01:22,548 INFO L272 TraceCheckUtils]: 131: Hoare triple {105581#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {105580#true} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 132: Hoare triple {105580#true} havoc ~__retres1~14; {105580#true} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {105580#true} assume 0 == ~m_st~0;~__retres1~14 := 1; {105580#true} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 134: Hoare triple {105580#true} #res := ~__retres1~14; {105580#true} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 135: Hoare triple {105580#true} assume true; {105580#true} is VALID [2022-02-20 20:01:22,548 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {105580#true} {105581#false} #1674#return; {105581#false} is VALID [2022-02-20 20:01:22,548 INFO L290 TraceCheckUtils]: 137: Hoare triple {105581#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 138: Hoare triple {105581#false} assume 0 != eval2_~tmp~5#1; {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 139: Hoare triple {105581#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 140: Hoare triple {105581#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 141: Hoare triple {105581#false} assume !(0 == ~m_pc~0); {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 142: Hoare triple {105581#false} assume 1 == ~m_pc~0; {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 143: Hoare triple {105581#false} assume ~token~0 != 9 + ~local~0; {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L272 TraceCheckUtils]: 144: Hoare triple {105581#false} call error2(); {105581#false} is VALID [2022-02-20 20:01:22,549 INFO L290 TraceCheckUtils]: 145: Hoare triple {105581#false} assume !false; {105581#false} is VALID [2022-02-20 20:01:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:01:22,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:22,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931728336] [2022-02-20 20:01:22,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931728336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:22,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:22,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:01:22,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444838169] [2022-02-20 20:01:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:22,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2022-02-20 20:01:22,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:22,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:01:22,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:22,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:01:22,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:01:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:01:22,632 INFO L87 Difference]: Start difference. First operand 2646 states and 3363 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)